What's new?

• Final exam: April 15, 4pm-6pm, BA 4164.
• To the final, you may bring Two handwritten aid sheets (standard form, only one side of each sheet can be written) or one sheet (written on both sides). Content can be any information desired, without restriction.
• Exercise set 7 is posted.
  
• Here are the slide sets for "Fair Queueing".
• Here are slides on Bufferless Multiplexing
• Here is a practice exam. (Will be discussed on Thursday)

Instructor

• Jorg Liebeherr
• jorg@comm.utoronto.ca, Tel: 416-946-3403, BA 4126
• Office Hours: By appointment via email.
• There is no TA assigned to this class.

Lectures: Reading Materials

• Packet Switches: IP routing, ATM switching, Ethernet switching
  • Slide set for lecture.
  • S. Fahmy, A Survey of ATM Switching Techniques, 1995.
  • J. Liebeherr, Liebeherr, Chapter 3, pages 1-10.
    
    
• Introduction to Quality of Service, Arrival Curves, and Service Curves
  
  • LBT, Chapter 1.1 - 1.4.
  • Performance Bounds for Flow control protocols, R. Agrawal, R. Cruz, C. Okino, R. Rajan, IEEE/ACM Transactions on Networking, Vol 7, No. 3, Pages 310-323.
    
• Traffic Regulation
  • LBT, Chapter 1.5-1.8.
    
• Min-Plus Linear Systems Theory
• LBT, Introduction (xiv-xviii), excerpts from Chapter 3 and 4.
• J. Liebeherr, M. Fidler, S. Valaee, A System Theoretic Approach to Bandwidth Estimation, Technical report, arXiv:0801.0455v1 , 2008.

• Packet Scheduling
  • Slide set for lecture
  • LBT, Chapter 2.1 and 2.3.
  • J. Liebeherr, D. Wrege, D. Ferrari, Exact Admission Control in Networks with Bounded Delay Sevices, IEEE/ACM Transactions on Networking, Vol. 4, No. 6, pp. 885 - 901, December 1996.
    
• Fair Queueing:
• H. Zhang, Service Disciplines for Guaranteed Performance Service in Packet Switching Networks, Proceedings of the IEEE, Vol. 83, No. 10, October 1995, Pages 1374-1396.
• A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated
  service networks : The single node case. IEEE/ACM Transactions on Networking, 1(3), June
  1993.
• A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated
  service networks : The multiple  node case. IEEE/ACM Transactions on Networking, 2(2), April
  1994.
  

•  Integrated Services (IntServ), Differentiated Services (DiffServ)

• LBT, Chapter 2.2, 2.4

• IP Lookup and Packet Classification

• J. Chao, Next Generation Routers, Proceedings of the IEEE, Vol. 90, No. 9, Pages 1518-1558, September 2002.
• M. A. Ruiz-Sanchez, E. W. Biersack, W. Dabbous, Survey and taxonomy of IP address lookup algorithms, IEEE Network, March/April 2001, Volume 15 , Issue 2, Pages 8 - 23.
• P. Gupta and N. McKeown, Algorithms for Packet Classification, IEEE Network, March/April 2001, Volume 15 , Issue 2, Pages 24-32.

• Statistical Multiplexing (Part 1)
  • O. Yaron and M. Sidi, Performance and stability of communication networks via robust exponential bounds, IEEE/ACM Transactions on Networking, 1(3):372–385, 1993.
  • R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn. Statistical service assurances for traffic scheduling algorithms. IEEE Journal on Selected Areas in Communications. Special Issue on Internet QoS, 18(12):2651–2664, 2000.
  • Also: 
  • A Network Calculus with Effective Bandwidth,  C. Li, A. Burchard, J. Liebeher, Technical Report, CS-2003-20, November 2003. (available here)
  • Statistical Per-Flow Service Bounds in a Network with Aggregate Provisioning, J. Liebeherr, S. D. Patek, and A. Burchard, Infocom 2003(available here).
    
• Congestion Control, Active Queue Management
• TBD.
• Switch Fabrics
  
  • TBD.