This is a graduate-level course targeted towards students with computer communication networks background. It investigates fundamental principles and theories of computer networking, including scheduling, routing, flow control, and network optimization, with the goal to expose students to analytical and mathematical tools for advanced research in computer networking.
The prerequisites of this course include Computer Communication Networks (or Introduction to Computer Networks) and Engineering Mathematics (Probability in particular).
March 1
| Introduction
Reference:
- KMK, Sections 1.2-1.3.
|
March 8
| Network Calculus (Deterministic Network Analysis)
Reference:
- J.-Y. Le Boudec and P. Thiran, Network Calculus, Chapter 1, Springer, 2004.
|
March 15
| Network Calculus (Deterministic Network Analysis)
Reference:
- J.-Y. Le Boudec and P. Thiran, Network Calculus, Chapter 1, Springer, 2004.
|
March 22
| Network Calculus (Deterministic Network Analysis)
Reference:
- J.-Y. Le Boudec and P. Thiran, Network Calculus, Chapter 1, Springer, 2004.
- KMK, Chapter 4.
|
March 29
| Queueing Theory (Stochastic Network Analysis)
Reference:
- B&G, Chapter 3.
- J. Little, "A Proof for the Queuing Formula: L=λW," Operations Research, vol. 9, no. 3, pp. 383-387, May/June 1961.
|
April 12
| Queueing Theory (Stochastic Network Analysis)
Reference:
- B&G, Chapter 3.
- L. Kleinrock, Queueing Systems Volume I: Theory, Chapter 4, Wiley, 1975.
|
April 19
| Queueing Theory (Stochastic Network Analysis)
Reference:
- B&G, Chapter 3.
- K. Marshall, "Some Inequalities in Queuing," Operations Research, vol. 16, no. 3, pp. 651-668, May/June 1968.
|
April 26
| Packet Scheduling
Reference:
- A. Parekh and R. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case," IEEE/ACM Transactions on Networking, vol. 1, no. 3, pp. 344-357, June 1993.
- J. Bennett and H. Zhang, "WF2Q: Worst-Case Fair Weighted Fair Queueing," in Proceedings of IEEE INFOCOM, San Francisco, CA, USA, pp. 120-128, March 1996.
- S. Golestani, "A Self-Clocked Fair Queueing Scheme for Broadband Applications," in Proceedings of IEEE INFOCOM, Toronto, Canada, pp. 636-646, June 1994.
- P. Goyal, H. Vin, and H. Cheng, "Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks," IEEE/ACM Transactions on Networking, vol. 5, no. 5, pp. 690-704, October 1997.
|
May 3
| Packet Scheduling
Reference:
- M. Shreedhar and G. Varghese, "Efficient Fair Queueing Using Deficit Round-Robin," IEEE/ACM Transactions on Networking, vol. 4, no. 3, pp. 375-385, June 1996.
- L. Georgiadis, R. Guerin, and A. Parekh, "Optimal Multiplexing on a Single Link: Delay and Buffer Requirements," IEEE Transactions on Information Theory, vol. 43, no. 5, pp. 1518-1535, September 1997.
- D. Stiliadis and A. Varma, "Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms," IEEE/ACM Transactions on Networking, vol. 6, no. 5, pp. 611-624, October 1998.
- H. Zhang and S. Keshav, "Comparison of Rate-Based Service Disciplines," in Proceedings of ACM SIGCOMM, Zurich, Switzerland, pp. 113-121, September 1991.
|
May 10
| Network Flow Theory
Reference:
- AMO, Sections 1.2 & 2.2.
- D. Bertsekas, Network Optimization: Continuous and Discrete Models, Sections 1.1 & 1.2, Athena Scientific, 1998.
|
May 17
| Midterm Exam
|
May 24
| Network Flow Theory (Shortest Path Problem)
Reference:
- AMO, Chapter 4.
- D. Bertsekas, Network Optimization: Continuous and Discrete Models, Chapter 2, Athena Scientific, 1998.
|
May 31
| Network Flow Theory (Shortest Path Problem)
Reference:
- AMO, Chapters 5 & 6.
- D. Bertsekas, Network Optimization: Continuous and Discrete Models, Chapters 2 & 3, Athena Scientific, 1998.
|
June 7
| Network Flow Theory (Max Flow Problem)
Reference:
- AMO, Chapter 6.
- D. Bertsekas, Network Optimization: Continuous and Discrete Models, Chapter 3, Athena Scientific, 1998.
|
June 14
| Network Flow Theory (Min-Cost Flow Problem)
|
June 21
| Final Exam
|
June 28
| Network Optimization Tools
|