3/29/10 | Introduction/Overview
[slides(pdf)], Probability review
[probability review notes (pdf)] |
3/31/10 | Delay models, Little's Theorem, Poisson processes. |
4/5/10 | Poisson Processes continued; the M/M/1 queue. |
4/7/10 | M/M/1 queue: Markov chain model, steady-state
probabilities. |
4/12/10 | PASTA property, M/M/m and M/M/m/m queues,
Erlang blocking formulas |
4/16/10 | Multi-class loss networks, reversibility,
truncation. |
4/19/10 | M/G/1 queues, PK-formula, M/G/1 queues with
vacations. |
4/23/10 | Multi-class M/G/1 queues;
reservation and polling systems. |
4/28/08 | Priority queues, Convervation Laws, c-mu rule |
4/26/10 | Generalized Processor sharing, weighted fair queueing |
4/28/10 | Traffic modeling: Markov modulated models, fluid models, self similarity and long range dependence |
5/3/10 | MIDTERM EXAM |
5/5/10 | Networks of queues, Burke's Theorem, Reversibility,
Klienrock's independence approximation |
5/10/10 | Packet switching, switch architectures,
maximum weight matching, Lyaponov stability. |
5/12/10 | Graph-based routing |
5/17/10 | Minimum spanning Trees, Shortest path trees, Bellman-Ford algorithm,
Adaptive shortest path routing |
5/19/10 | Optimization-based routing, convex programming, distributed optimal routing |
5/24/10 | Congestion control and Fairness, max-min fairness, proportional fairness, utility-based
congestion control. |
5/26/10 | utility-based congesiton control and TCP;
traffic policing/shapping; leaky-buckets and network
calculus. |