The readings listed on this page are in three parts. First come the background readings. You will find them useful to get up to speed. Then come the assigned readings. Finally, we list several papers as optional readings, for you to learn more about specific topics. The schedule provides hints on when any given optional reading might be useful. All papers are named by shorthand names such as CK74.
Background (will not be explicitly discussed in class)
[SRC84] Saltzer, J., D. Reed, and D. Clark. “End-to-end Arguments in System Design.” ACM Transactions on Computer Systems (TOCS) 2, no. 4 (1984): 195-206. (This paper is covered in 6.033.)
[L0] Balakrishnan, H. “Single-link Communication.” 6.829 Computer Networks Lecture Notes, Fall 2002. (Read this before or soon after first lecture.) (PDF)
Assigned Readings (by Topic Area)
Part I. Internetworking and Routing
[Cla88] Clark, D. “Design Philosophy of the DARPA Internet Protocol.” Proc ACM SIGCOMM (August 1988): 106-114. Stanford, CA.
[Hin96] Hinden, R. “IP Next Generation Overview.” Comm of the ACM 39, no. 6 (June 1996): 61-71.
Unicast IP Forwarding and Routing
[L4] Balakrishnan, H. “Wide-area Unicast Routing.” 6.829 Computer Networks Lecture Notes, Fall 2002. (PDF)
Internet Routing in-the-Wild (Measurement)
[Pax97] Paxson, V. “End-to-End Routing Behavior in the Internet.” IEEE/ACM Transactions on Networking 5, no. 5 (October 1997): 601-615.
Big Fast Routers
[P+98] Partridge, C., et al. “A 50 Gb/s IP Router.” IEEE/ACM Transactions on Networking 6, no. 3 (June 1998): 237-248.
[McK96] McKeown, N., M. Izzard, A. Mekkittikul, W. Ellersick, and M. Horowitz. “The Tiny Tera: A Packet Switch Core.” Proc Hot Interconnects V (August 1996). Stanford University.
Security Issues in the Internet Architecture
[Bel89] Bellovin, Steven M. “Security Problems in the TCP/IP Protocol Suite (PDF).” Computer Communications Review 2, no. 19 (April 1989): 32-48.
[ASSW02] Anderson, T., S. Shenker, I. Stoica, and D. Wetherall. “Towards More Robust Internet Protocols.” (July 2002).
Part II. Resource Management
End-to-End Congestion Control
[JK88] Jacobson, V., and M. Karels. “Congestion Avoidance and Control.” Proc ACM SIGCOMM (August 1988). Stanford, CA.
[CJ89] Chiu, and D. M., and R. Jain. “Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks.” Computer Networks and ISDN Systems 17 (1989): 1-14.
Router-Assisted Congestion Control, Active Queue Management, and Scheduling
[KHR02] Katabi, D., M. Handley, and C. Rohrs. “Congestion control for high bandwidth-delay product networks.” Proc ACM SIGCOMM (August 2002). Pittsburgh, PA.
[DKS90] Demers, A., S. Keshav, and S. Shenker. “Analysis and Simulation of a Fair Queueing Algorithm.” Internetworking: Research and Experience 1, no. 1 (1990): 3-26. (If you like, you may also read the slightly older SIGCOMM ‘89 version.)
[SSZ98] Stoica, I., S. Shenker, and H. Zhang. “Core - Stateless Fair Queueing: Achieving Approximately Fair Allocations in High Speed Networks.” Proc ACM SIGCOMM (September 1998). Vancouver, Canada. ASIN: B0006R9W38.
Modeling and Measurement
[JD02] Jain, M., and C. Dovrolis. “End-to-end Available Bandwidth: Measurement Methodology, Dynamics, and Relation with TCP Throughput.” Proc ACM SIGCOMM (August 2002). Pittsburgh, PA.
[WGJPS02] Willinger, W., R. Govindan, S. Jamin, V. Paxson, and S. Shenker. “Scaling phenomena in the Internet: Critically examining criticality.” Proc Natl Acad Sci USA 99, supplement 1 (February 19, 2002): 2573-2580.
[SPW02] Staniford, S., V. Paxson, and N. Weaver. “How to 0wn the Internet in Your Spare Time.” Proc USENIX Security Symp (August 2002). San Francisco, CA.
Adaptive Applications and Internet QoS
[CT90] Clark, D., and D. Tennenhouse. “Architectural Consideration for a New Generation of Protocols.” Proc ACM SIGCOMM (September 1990). Philadelphia, PA.
[She95] Shenker, S. “Fundamental Design Issues for the Future Internet.” IEEE Journal on Selected Areas in Communications 13, no. 7 (September 1995): 1176-1188.
[CF98] Clark, D., and W. Feng. “Explicit Allocation of Best-Effort Packet Delivery Service.” IEEE/ACM Transactions on Networking 6, no.4 (August 1998): 362-373.
Part III. Network Services
[BMJ+98] Broch, J., D. Maltz, D. Johnson, Y. C. Hu, and J. Jetcheva. “A Performance Comparison of Multi-Hop Wireless Ad Hoc Routing Protocols.” Proc ACM MOBICOM (August 1998). Dallas, TX.
[IGE00] Intanagonwiwat, C., R. Govindan, and D. Estrin. “Directed diffusion: A scalable and robust communication paradigm for sensor networks.” Proc ACM MOBICOM (August 2000). Boston, MA.
[JSBM01] Jung, J., E. Sit, H. Balakrishnan, and R. Morris. “DNS Performance and the Effectiveness of Caching.” Proc ACM SIGCOMM Internet Measurement Workshop (November 2001). San Francisco, CA. (PDF)
Peer-to-Peer Networking, Distributed Hash Tables
[BKKMS03] ———. Looking Up Data in P2P Systems, Comm. of the ACM (February 2003).
[CSWH00] Clarke, I., O. Sandberg, B. Wiley, and T. Hong. “Freenet: A Distributed Anonymous Information Storage and Retrieval System.” Proc ICSI Workshop on Design Issues in Anonymity and Unobservability (July 2000). Berkeley, CA.
[ABKM01] Andersen, D., H. Balakrishnan, M. Kaashoek, and R. Morris. “Resilient Overlay Networks.” Proc 18th ACM SOSP (October 2001). Banff, Canada.
[MS97] Maufer, T., and C. Semeria. “Introduction to IP Multicast Routing.” Internet-Draft, July 1997.
Optional Additional Readings and References
[Nor00] Norton, W. “Internet Service Providers and Peering.” 2000.
Reliable Transport and Congestion Control
[FF96] Floyd, S., and K. Fall. “A Simulation Comparison of Tahoe, Reno, and SACK TCP.” ACM SIGCOMM CCR (1996).
[FF99] Floyd, S., and K. Fall. “Promoting the Use of End-to-End Congestion Control in the Internet.” IEEE/ACM Transactions on Networking 7, no. 4 (August 1999): 458-472.
[RJ90] Ramakrishnan, K. K., and R. Jain. “A Binary Feedback Scheme for Congestion Avoidance in Computer Networks.” ACM Transactions on Computer Systems (TOCS) 8, no. 2 (May 1990): 158-181.
[BB01] Bansal, D., and H. Balakrishnan. “Binomial Congestion Control Algorithm.” Proc IEEE INFOCOM (April 2001). Anchorage, AK.
[SEW01] Spring, N., D. Ely, D. Wetherall, S. Savage, and T. Anderson. “Robust ECN Signaling.” Proc International Conf on Network Protocols (November 2001). Riverside, CA.
[Huitema96] Huitema, C. Routing in the Internet. Upper Saddle River, NJ: Prentice Hall, January 15, 2000. ISBN: 0130226475. (Search for Huitema on the Prentice Hall site.)
[Stewart99] Stewart, J. BGP4 Inter-Domain Routing in the Internet. Reading, MA: Addison-Wesley, January 1999. ISBN: 0201379511.
[Tsu88] Tsuchiya, P. “The Landmark Hierarchy: A New Hierarchy for Routing in Very Large Networks.” Proc ACM SIGCOMM (August 1988): 35-42. Stanford, CA.
Adaptive and Network-Aware Applications
[PM95] Padmanabhan, V., and J. Mogul. “Improving HTTP Latency.” Computer Networks and ISDN Systems 28 (December 1995): 25-35.
[RHE99] Rejaie, R., M. Handley, and D. Estrin. “Quality Adaptation for Congestion Controlled Video Playback over the Internet.” Proc ACM SIGCOMM (September 1999).
Traffic Engineering, Flow Modeling
[Elw01] Elwalid, A., C. Jin, S. Low, and I. Widjaja. “MATE: MPLS Adaptive Traffic Engineering.” Proc IEEE INFOCOM (2001). Anchorage, AK.
[EV02] Estan, C., and G. Varghese. “New directions in traffic measurement and accounting.” Proc ACM SIGCOMM (August 2002). Pittsburgh, PA.
[Pap98] Papadopoulos, C. “An Error Control Scheme for Large-Scale Multicast Applications.” Proc IEEE INFOCOM ‘98 (March 1998). San Francisco, CA.
[Joh96] Johnson, D. “Scalable Support for Transparent Mobile Host Internetworking.” Chapter 3 in Mobile Computing. Edited by T. Imielinski and H. Korth. Kluwer Academic Publishers, 1996, pp. 103-128.
[SB00] Snoeren, A., and H. Balakrishnan. “An End-to-End Approach to Host Mobility.” Proc ACM MOBICOM (August 2000). Boston, MA.
[She96] Shepard, T. J. “A Channel Access Scheme for Large Dense Packet Radio Networks.” Proc ACM SIGCOMM (August 1996). Stanford, CA.
[J+01] Li, J., C. Blake, D. De Couto, H. Lee, and R. Morris. “Capacity of Wireless Ad Hoc Networks.” Proc ACM MOBICOM (July 2001). Rome, Italy.
[CJBM01] Chen, B., K. Jamieson, H. Balakrishnan, and R. Morris. “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks.” Proc ACM MOBICOM (July 2001). Rome, Italy.
[FCAB98] Fan, L., P. Cao, J. Almeida, and A. Broder. “Summary Cache: A Scalable Wide-Area Cache Sharing Protocol.” Proc SIGCOMM ‘98 (September 1998): 254-265. Vancouver, Canada.
Introducing New Services: Overlays v. Active Networks
Modeling and Measurement
[Bol93] Bolot, J. C. “End-to-End Packet Delay and Loss Behavior in the Internet.” Proc ACM SIGCOMM (August 1993). San Francisco, CA.
[LTWW94] Leland, W. E., M. S. Taqqu, W. Willinger, and D. V. Wilson. “On the Self-Similar Nature of Ethernet Traffic.” IEEE/ACM Transactions on Networking 2, no. 1 (February 1994): 1-15.
Paper on Topology Modeling.