Lectures
| Description | Lecture Notes |
|---|---|
| Adminstrative Matters | Lecture 0 |
| Summary of Lecture 1 | Lecture 1 |
| Summary of Lecture 2 | Lecture 2 Lecture 2 Annex |
| Summary of Lecture 3 | Lecture 3 |
| Summary of Lecture 4 | Lecture 4 |
| Summary of Lecture 5 | Lecture 5 |
| Summary of Lecture 6 | Lecture 6 |
| Summary of Lecture 7 | Lecture 7 |
| Summary of Lecture 8 | Lecture 8 |
| Summary of Lecture 9 | Lecture 9 |
| Modeling VC and Queueing Networks | Lecture 10 |
| Open and Closed Queueing Networks | Lecture 11 |
| Examples and Buzen's Algorithm | Lecture 12 |
| Mean Value Analysis | Lecture 13 |
| Traffic Engineering | Lecture 14 |
| WFQ & DRR | Lecture 15 |
| Formulas | Formula Sheet 1 and Formula Sheet 2 |
Textbook Chapters and Other Material
| Description | Notes |
|---|---|
| MATLAB Material | MATLAB_CNL.pdf |
| Introduction: Chapter 1 of Bertsekas & Gallager | Intro_Data_Nets.pdf |
| Queueing theory: Chapter 2 of M. Schwartz | Schwartz_CH2 |
| Queueing theory: Chapter 3 of Bertsekas & Gallager | Queueing_Data_Nets |
| Mischa Schwartz's book | Chapter 5 |
| Draft Queueing Simulation Book (Jabbari and St Jean) | Draft Book |
| Fair Queueing Reference Material | Analysis and Simulation of a Fair Queueing Algorithm |
| On the efficient implementation of Fair Queueing | |
| A generalized processor sharing approach to flow control in integrated services networks | |
| A generalized processor sharing approach to flow control in integrated services networks: the multiple node case | |
| Efficient fair queueing using Deficit Round-Robin |