Publications

Found 9 results
Author Title Type [ Year(Desc)]
Filters: First Letter Of Title is B and Author is Scott Shenker  [Clear All Filters]
1981
Kadanoff, L. P., & Shenker S. (1981).  Band to Band Hopping in One-Dimensional Maps. Journal of Physics A: Mathematical and General. 14(2), L23-26.
1998
Breslau, L., & Shenker S. (1998).  Best-Effort versus Reservations: A Simple Comparative Analysis. ACM Computer Communication Review. 28, 3-16.
2002
Feigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S. (2002).  A BGP-Based Mechanism for Lowest-Cost Routing. Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002). 173-182.
2004
Ramabhadran, S., Ratnasamy S., Hellerstein J. M., & Shenker S. (2004).  Brief Announcement: Prefix Hash Tree. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004). 367.
2005
Fonseca, R., Ratnasamy S., Zhao J., Ee C. Tien, Culler D. E., Shenker S., et al. (2005).  Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets. Proceedings of the Second USENIX Symposium on Networked Systems Design and Implementation (NSDI 2005). 329-342.
Feigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S. (2005).  A BGP-Based Mechanism for Lowest-Cost Routing. Distributed Computing. 18(1), 61-72.
2018
Iyer, A. Padmanabha, Panda A., Venkataraman S., Chowdhury M., Akella A., Shenker S., et al. (2018).  Bridging the GAP: towards approximate graph analytics. Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA).