CS653 (Fall 2018): Advanced Computer Networks
Overview Schedule Reading
Reading
 

Classic and contemporary must-read papers for networking researchers (an incomplete list):

Internet architecture and related musings

  • [CK74] V. Cerf and B. Kahn, A protocol for packet network intercommunication, IEEE Transactions on Communications, Vol. 22, 637-648, May 1974.
  • [Clark88] D. Clark, Design Philosophy of the DARPA Internet Protocols , In Proc. ACM SIGCOMM , Stanford, CA, August 1988, pp. 106-114.
  • [SRC84] J. Saltzer, D. Reed, and D. Clark, "End-to-end Arguments in System Design". ACM Transactions on Computer Systems (TOCS), Vol. 2, No. 4, 1984, pp. 195-206
  • [CT90] D. Clark and D. Tennenhouse, Architectural Consideration for a New Generation of Protocols , In Proc. ACM SIGCOMM , Philadelphia, PA, September 1990.
  • [Shenker94] Fundamental Design Issues for the Future Internet, S. Shenker, IEEE Journal on Selected Areas in Communication (JSAC), 13(7), 1995.
  • [MMZ02] P. Molinero-Fernandez, N. Mckeown, H. Zhang, "Is IP going to take over the world?", ACM HotNets 2002.
  • [Tussles] David D. Clark, John Wroclawski, Karen Sollins, and Robert Braden. Tussle in cyberspace: Defining tomorrow's internet. In Proceedings of the ACM SIGCOMM Conference , pages 347-356, Pittsburgh, PA, USA, August 2002.
  • [Odlyzko] Several easy-to-read but intriguing papers at: http://www.dtc.umn.edu/~odlyzko/doc/networks.html
  • [Isenberg97] D. Isenberg, The Rise of the Stupid Network, Computer Telephony, August 1997, pg 16-26.
  • [Haldane28] J.B.S. Haldane, "On Being the Right Size", 1928.

Interdomain routing

Resource management

  • [CJ89] D.-M. Chiu and R. Jain , Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , Computer Networks and ISDN Systems, Vol. 17, 1989, pp. 1-14.
  • [TCP] V. Jacobson and M. Karels, Congestion Avoidance and Control , In Proc. ACM SIGCOMM , Stanford, CA, August, 1988.
  • [RED] S. Floyd and V. Jacobson, Random Early Detection Gateways for Congestion Avoidance , IEEE/ACM Transactions on Networking , Vol. 1, No. 4, August 1993, pp. 397-413.
  • [XCP] Dina Katabi, Mark Handley, and Charles Rohrs, Congestion Control for Future High Bandwidth-Delay Product Networks . ACM Sigcomm 2002, August 2002.
  • [RCP] N. Dukkipati, M. Kobayashi, R. Zhang-Shen and N. McKeown, Processor Sharing Flows in the Internet, Thirteenth International Workshop on Quality of Service (IWQoS), Passau, Germany, June 2005.
  • [WFQ] A. Demers, S. Keshav, and S. Shenker , Analysis and Simulation of a Fair Queueing Algorithm , Internetworking: Research and Experience, Vol. 1, No. 1, pp. 3-26, 1990.
  • [CSFQ] I. Stoica , S. Shenker , and H. Zhang , Core -Stateless Fair Queueing: Achieving Approximately Fair Allocations in High Speed Networks , Proc. ACM SIGCOMM , Vancouver,Canada, September 1998.
  • [Shenker95] S. Shenker, Fundamental Design Issues for the Future Internet , IEEE Journal on Selected Areas in Communications, Vol. 13, No. 7, September 1995, pp. 1176-1188.
  • [CSZ92] D. Clark, S. Shenker , and L. Zhang, Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanisms . In Proc. SIGCOMM '92, Baltimore, MD, August 1992.
  • [MGR] C. Partridge et al., A 50 Gb/s IP Router , IEEE/ACM Trans. on Networking , Vol. 6, No. 3, pp. 237-248, June 1998.
  • [iSLIP] Nick McKeown, The iSLIP Scheduling Algorithm for Input-Queued Switches, IEEE/ACM Transactions on Networking (TON), Volume 7 ,  Issue 2  (April 1999) pp.188 - 201.

Wireless networking

  • [MACAW] V. Bharghavan, A. Demers, S. Shenker , and L. Zhang. MACAW: A Media Access Protocol for Wireless LANs , In Proc. ACM SIGCOMM , London, U.K., September 1994, pp. 212-225.
  • [ETX] D. De Couto, D. Aguayo, J. Bicket, and R. Morris, A High-Throughput Path Metric for Multi-Hop Wireless Routing, Proceedings ACM MOBICOM, San Diego, California, September 2003.
  • [MANET] Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu, and Jorjeta Jetcheva. A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols . In Proceedings of the Fourth Annual International Conference on Mobile Computing and Networking (MobiCom'98).
  • [ExOR] Sanjit Biswas and Robert Morris, Opportunistic Routing in Multi-Hop Wireless Networks, In the Proceedings of the ACM SIGCOMM  2005 , Philadelphia, Pennsylvania, August 2005.

Network services

  • [RON] D. Andersen , H. Balakrishnan , M. Kaashoek , R. Morris , Resilient Overlay Networks , Proc. 18th ACM SOSP, Banff, Canada, October 2001.
  • [OHSR04] Improving the Reliability of Internet Paths with One-hop Source Routing, Krishna P. Gummadi, Harsha Madhyastha, Steven D. Gribble, Henry M. Levy, and David J. Wetherall. Proceedings of the 6th Usenix/ACM Symposium on Operating Systems Design and Implementation (OSDI), San Francisco, CA, December 2004.
  • [Detour] Stefan Savage, Tom Anderson, Amit Aggarwal, David Becker, Neal Cardwell, Andy Collins, Eric Hoffman, John Snell, Amin Vahdat, Geoff Voelker, and John Zahorjan, Detour: a Case for Informed Internet Routing and Transport, IEEE Micro, pp. 50-59, v 19, no 1, January 1999
  • [DHTSurvey] H. Balakrishnan , M. Kaashoek , D. Karger , R. Morris , and I. Stoica , Looking Up Data in P2P Systems, Comm. of the ACM, February 2003.
  • [Chord] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications, In Proc. ACM SIGCOMM 2001.
  • [PRR]  C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, Newport, Rhode Island, pages 311-320, June 1997
  • [CH97] D. Karger, E. Lehman, F. T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 654--663, May 1997
  • [Pastry] A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems", Middleware'2001, Germany, November 2001.
  • [i3] Ion Stoica, Daniel Adkins, Shelley Zhaung, Scott Shenker, and Sonesh Surana, Internet Indirection Infrastructure, Proceedings of ACM SIGCOMM'02 , Pittsburgh, PA, August 2002, pp. 73-86.
  • [SRM] S. Floyd , V. Jacobson, C. Liu, S. McCanne, L. Zhang, A Reliable Multicast Framework for Light-Weight Sessions and Application Level Framing , IEEE/ACM Transactions on Networking , 1997.
  • [SOS] A. Keromytis,, V. Misra  and D. Rubenstein, Secure Overlay Services, SIGCOMM 2002.
  • [Mayday] D. Andersen, Mayday: Distributed Filtering for Internet Services, USITS 2003.

Network security

  • [HIT] Alex C. Snoeren , Craig Partridge, Luis A. Sanchez, Christine E. Jones, Fabrice Tchakountio, Stephen T. Kent, and W. Timothy Strayer, Hash-Based IP Traceback, Proc. of the ACM SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 2001.
  • [TVA] Xiaowei Yang, David Wetherall, and Tom Anderson, A DoS-limiting Network Architecture, Proc. of ACM SIGCOMM August 2005.
  • [SPW02] S. Staniford, V. Paxson, N. Weaver, How to Own the Internet in Your Spare Time , Proc. USENIX Security Symp., San Francisco, CA, August 2002.
  • [SEVS04] Sumeet Singh, Cristian Estan, George Varghese and Stefan Savage, Automated Worm Fingerprinting , Proceedings of the ACM/USENIX Symposium on Operating System Design and Implementation , San Francisco, CA, December 2004.
  • [B4Sale] Srikanth Kandula, Dina Katabi, Matthias Jacob, and Arthur Burger, "Botz-4-Sale: Surviving DDos Attacks that Mimic Flash Crowds" Usenix NSDI 2005
  • [Listen04] Lakshminarayanan Subramanian, Volker Roth, Ion Stoica, Scott Shenker and Randy H. Katz. Listen and Whisper: Security Mechanisms for BGP , First Symposium on Networked Systems Design and Implementation (NSDI'04), March, 2004.

Fault tolerance

  • [BQS97] Dahlia Malkhi, Michael Reiter, Byzantine Quorum Systems, STOC 1997.
  • [PBFT99] M. Castro and B. Liskov, Practical Byzantine Fault Tolerance, OSDI 1999.
  • [PR85] Radia J. Perlman: An algorithm for distributed computation of a spanningtree in an extended LAN. SIGCOMM 1985: 44-53
  • [BAR05] BAR Fault Tolerance for Cooperative Services, A. Aiyer, L. Alvisi, A. Clement, M. Dahlin, J.P. Martin, C. Porth, SOSP 2005.

Selfish routing

  • [QYZS03] L. Qui, Y.R. Yang, Y. Zhang, S. Shenker, Selfish Routing in Internet-like Environments, SIGCOMM 2003.
  • [RT02] T. Roughgarden and E. Tardos, How Bad is Selfish Routing, FOCS 2001, JACM 2002.
  • [FJB05] Nick Feamster, Ramesh Johari, Hari Balakrishnan, Implications of Autonomy for the Expressiveness of Policy Routing, SIGCOMM 2005.
  • [ZZLY] On Designing Incentive-Compatible Routing and Forwarding Protocols in Wireless Ad-Hoc Networks---An Integrated Approach Using Game Theoretical and Cryptographic Techniques , Sheng Zhong, Li Erran Li, Yanbin Liu, and Yang Richard Yang, Mobicom 2005.
  • [LZGT05] Yong Liu, Honggang Zhang, Weibo Gong, Don Towsley, On the Interaction Between Overlay Routing and Underlay Routing, INFOCOM 2005.
  • [ZKT05] Honggang Zhang, Jim Kurose, Don Towsley, Can an Overlay Compensate for a Careless Underlay?, UMass CMPSCI Technical Report 05-49.