CAS CS 591 A1
Spring 2001

Advanced Computer Networks (officially, Networking Seminar)

Final Exam Tuesday May 8, 2001, 2:00 PM - 4:00 PM, MCS 148.

This course emphasizes the design, analysis, and implementation of (existing and emerging) protocols from link-level to applications.

This is a tentative syllabus and subject to change. Please check this page regularly and follow announcements in class. Dates are approximate. 

Not all topics listed below will be necessarily covered or covered in detail. Speed and level of coverage will depend to some extent on the maturity and background of the class.

Readings will include lecture slides, notes, some papers and RFCs. Some of the papers/RFCs (or portions thereof) are must-read, the rest are supplementary. This page will include links to these readings.

Lecture slides below are in PDF format. PDF files require Adobe Acrobat Reader. You can view PostScript files using ghostview.
Tue       Thu
1/16       1/18
Introduction: traffic management, support for emerging applications, simulation
1/23       1/25
1/30        2/1
Scheduling and Buffer Management: implementation, fairness, performance bounds, admission control, 
priorities, work conservation, scheduling best-effort (BE) flows, scheduling guaranteed-service (GS) flows (GPS, WRR, DRR, WFQ, EDD, RCSP), aggregation, drop strategies (tail-drop, RED, WRED)

project 1 Notes 
2/6        2/8
2/13       2/15
Flow/Congestion Control: implementation, modeling, fairness, stability, open-loop vs closed-loop vs hybrid, traffic specification (LBAP, leaky-bucket), window vs rate, hop-by-hop vs end-to-end, implicit vs explicit feedback, aggregate flow control, reliable multicast. TCP variants (Tahoe, Reno, Vegas, New-Reno, SACK),  DECbit, Packet Pair, NETBLT, ATM Forum EERC, T/TCP
NO CLASS (substitute Monday schedule)
2/27        3/1
Routing: implementation, stability/convergence, link-state vs distance-vector vs link-vector, conventional routing (RIP, IGRP, BGP, OSPF), multi-path and type-of-service (ToS) routing, quality-of-service (QoS) or constrained-based routing (QOSPF, ATM PNNI), routing heuristics for GS (load-balanced, load-profiled), trunk reservation, scaling techniques (state aggregation, virtual paths, limited scoping, quantization), coping with inaccuracies (systematic vs random), path caching, routing in telephone networks, Internet QoS routing, interaction with reservation (RSVP), multicast routing with reservation, fast routing/switching (Tag Switching, MPLS)
3/6       3/8
SPRING RECESS (Sat Mar 3 - Sun Mar 11)
Routing continued
MIDTERM (solution)
3/20    3/22
3/27    3/29
Traffic Management: utility function, traffic models (for telephone networks vs Internet), self-similarity, traffic classes (BE, GS), service models (DiffServ, IntServ), class-based allocation, controls at different time scales, renegotiation (RCBR), signaling  (RSVP, ATM signaling), resource translation/mapping, admission control (worst-case, statistical, measurement-based),  pricing, capacity planning
Project 2 Due 3/20


4/3      4/5
4/10     4/12
Wireless Access and Mobility: cellular (IS-41, mobile-IP) vs ad-hoc networks (MANETs),  channel allocation, reactive vs proactive routing, end-to-end vs local recovery (DSR, WAR), centralized vs distributed location management (IS-41, distributed location registers),  handoffs, mobile motion prediction, TCP over wireless (I-TCP, Snoop, WTCP), resource discovery, QoS
Proposal of Final Project Due 4/10

4/17    4/19
4/24   4/26
Applications/Middleware: multimedia and adaptive applications, voice and video over IP, real-time transport protocols (RTP, RTCP), forward error correction, scalable and QoS-aware servers, web proxy caching, multimedia streaming
Wrap Up and REVIEW
Final Project Due 5/1
NO CLASS (study period Thu and Fri, May 3 and 4)
FINAL EXAM: 2:00PM-4:00PM, MCS 148


Must-Read Notes/Papers/Chapters:

[R1] Discrete-Event Simulation - skip Section 7 (by Udaya Shankar)  - Slides

[R2] Chapter 9 (Scheduling), S. Keshav's book "An Engineering Approach to Computer Networking", on reserve in library.

[R3] Sections 1-5, and 7-8 of paper [SP5].

[R4] pp.1-7, and section 3.1 of paper [SP8].

[R5] Congestion Control (by Jean Walrand)

[R6] Sections 1-3.1 of paper [SP11].

[R7] Sections 1-3.1 of paper [SP15].

[R8] R. Guerin, A. Orda, and D. Williams. QoS Routing Mechanisms and OSPF Extensions. Global Internet 1997.

[R9] Review of basic multicast routing - slides

[R10] QoSMIC: Quality of Service sensitive Multicast Internet protoCol, ACM SIGCOMM 1998.

[R11] D. Clark, S. Shenker, and L. Zhang. Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism. In Proc. ACM SIGCOMM '98 Conference.

[R12] Sections 1-3 and 5 from [SP18].

[R13] D. Clark and W. Fang. Explicit Allocation of Best-Effort Packet Delivery Service. IEEE/ACM Transactions on Networking, 6(4):362-373, Aug. 1998.

[R14] Sections 1-3 from [SP19].

Supplementary Notes:

[SN1] The Challenges of Multimedia Networking (by Mostafa Ammar)

[SN2] ns tutorial slides presented in class 1/18/2001 (PowerPoint format)

[SN3] On-line summaries of papers on RED [SP5], Congestion [SP6], TCP SACK [SP7], AIMD [SP8].

Supplementary Papers:

[SP1] J. Saltzer, D. Reed, and D. Clark. End-to-End Arguments in System Design. ACM Transactions on Computer Systems (TOCS), vol. 2, no. 4, pp. 195-206, 1984.

[SP2] David D. Clark. The Design Philosophy of the DARPA Internet Protocols. Proc. ACM SIGCOMM 1988, pp. 106-114.

[SP3] David D. Clark and Marjory S. Blumenthal. Rethinking the design of the Internet: The end to end arguments vs. the brave new world. Workshop on Policy Implications of End-to-End. December 1, 2000. 

[SP4] A. Demers, S. Keshav, and S. Shenker. Analysis and Simulation of a Fair Queueing Algorithm. ACM SIGCOMM 1989.

[SP5] S. Floyd and V. Jacobson. Random Early Detection gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking, V.1 N.4, August 1993, p. 397-413.

[SP6] Van Jacobson and Michael J. Karels. Congestion Avoidance and Control. ACM SIGCOMM 1998, pp. 273-288.

[SP7] Kevin Fall and Sally Floyd. Simulation based Comparisons of Tahoe, Reno, and SACK TCP

[SP8] D. Chiu and R. Jain. Analysis of the Increase/Decrease Algorithms for Congestion Avoidance in Computer Networks. Journal of Computer Networks and ISDN, Vol. 17, No. 1, June 1989, pp. 1-14.

[SP9] H. Zhang and D. Ferrari. Rate-Controlled Service Disciplines. Journal of High Speed Networks: Special Issue on Quality of Service, 3(4), 1994. 

[SP10] BGP RFC 1771.

[SP11] T. Griffin and G. Wilfong. An Analysis of BGP Convergence Properties. ACM SIGCOMM 1999.

[SP12] J. Mo, R. La, V. Anantharam, and J. Walrand. Analysis and Comparison of TCP Reno and Vegas. IEEE INFOCOM 1999.

[SP13] W. Lee, M. Hluchyi, and P. Humblet. Routing Subject to Quality of Service Constraints in Integrated Communication Networks. IEEE Network, July/August 1995.

[SP14] E. Crawley, R. Nair, B. Rajagopalan, and H. Sandick. A Framework for QoS-based Routing in the Internet. Internet Draft, April 1998.

[SP15] L. Guo and I. Matta. Search Space Reduction in QoS Routing. An earlier version in ICDCS 1999.

[SP16] G. Apostolopoulos, R. Guerin, S. Kamat, and S. Tripathi. Quality of Service Routing: A Performance Perspective. ACM SIGCOMM 1998.

[SP17] W. Zhao and S. Tripathi. Routing Guaranteed Quality of Service Connections in Integrated Services Packet Networks. ICNP 1997.

[SP18] S. Jamin et al. A Measurement-based Admission Control Algorithm for Integrated Services Packet Networks. IEEE/ACM Transactions on Networking, 5(1):56-70, Feb. 1997.

[SP19] H. Balakrishnan, S. Seshan, and R. Katz. Improving Reliable Transport and Handoff Performance in Cellular Wireless Networks. ACM Wireless Networks, Dec. 1995.

[SP20] R. Rejaie, M. Handley, and D. Estrin. RAP: An End-to-End Rate-based Congestion Control Mechanism for Realtime Streams in the Internet. Proc. IEEE Infocom 1999.

Back to course home page
Last updated:  May 1, 2001