6.829
Computer Networks
Fall 2002
Topics
- L0 for background ( PDF ) Part I: Internetworking and Routing Packet Switching ( PDF ) A Simple Network
- The Internetworking Problem ( PDF ) The IP/TCP Split Connections Scaling IP
- Scaling IP (cont.) ( PDF ) Routers: Forwarding and Routing The IP Forwarding Path
- Tutorial on useful tools ( PDF )
- Internet Routing-in-the-Wild
- Intro to the ns2 Network Simulator ( PDF )
- Router Design and Implementation
- Security Problems with the Internet Architecture ( PDF )
- Tutorial on IPv6 ( PDF )
- Project Proposals Due (3 days after T3). Three hard copies.
- Part II: Resource Management End-to-End Congestion Control ( PDF )
- Router-Assisted Congestion Control: Active Queue Management ( PDF )
- Fair Queuing and Variants ( PDF )
- Modeling and Measurement-I: Packet Trains Slides ( PDF )
- TCP Congestion Control Impediments
- Adaptive Network Applications Nick’s CM slides ( PDF ) Xiaowei’s ALF slides ( PDF )
- Tutorial: Project Office Hours
- QoS-I: Why QoS; Basic Models and Architecture ( PDF )
- QoS-II: Mechanisms and Properties
- Modeling and Measurement-II: Traffic Self-Similarity; Virus Propagation ( PDF )
- Part III: Communication and Network Services P2P Networks Distributed Hash Table (DHT) Abstraction and Algorithms
- Routing in Overlay Networks ( PDF )
- Wireless and Mobility: MAC Protocols, Routing
- Wireless Protocols: Data Transport and Sensor Data Dissemination (Cross-Layer Protocols)
- Anonymity ( PDF )
- Group Communication: Multicast Routing and Transport
- Multicast (cont.); Scalability and Robustness in Networks ( PDF )
- Project Presentations (2 days after L22)
- Project Presentations (3 days after L22)
Readings
- [Hin96] Hinden, R. “IP Next Generation Overview.” Comm of the ACM 39, no. 6 (June 1996): 61-71.
- [Pax97] Paxson, V. “End-to-End Routing Behavior in the Internet.” IEEE/ACM Transactions on Networking 5, no. 5 (October 1997): 601-615.
- [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.
- [ASSW02] Anderson, T., S. Shenker, I. Stoica, and D. Wetherall. “Towards More Robust Internet Protocols.” (July 2002).
- [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.
- [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.
- [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.
- [MS97] Maufer, T., and C. Semeria. “Introduction to IP Multicast Routing.” Internet-Draft, July 1997.
- [Nor00] Norton, W. “Internet Service Providers and Peering.” 2000.
- [FF96] Floyd, S., and K. Fall. “A Simulation Comparison of Tahoe, Reno, and SACK TCP.” ACM SIGCOMM CCR (1996).
- [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.
- [Elw01] Elwalid, A., C. Jin, S. Low, and I. Widjaja. “MATE: MPLS Adaptive Traffic Engineering.” Proc IEEE INFOCOM (2001). Anchorage, AK.
- [She96] Shepard, T. J. “A Channel Access Scheme for Large Dense Packet Radio Networks.” Proc ACM SIGCOMM (August 1996). Stanford, 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.
Sources
- Course catalogue ↗Historical OpenCourseWare
- MIT OCW syllabus ↗
- MIT OCW calendar ↗
- MIT OCW readings ↗
- Historical MIT OpenCourseWare offering. Named reading entries and schedule topics are automatically extracted from the linked source pages.