| 1/4/05 | Introduction/Overview
[notes(pdf)] |
| 1/6/05 | Distributed Algorithms - Correctness
(Liveness, Saftey), 3 Army problem, Stop-and Wait ARQ
|
| 1/11/05 | Distributed Algorithms - Sliding widnow ARQ protocols,
Initialization and Disconnect protocols
|
| 1/13/05 | Introduction to delay models, Little's theorem |
| 1/18/05 | Poisson Processes, M/M/1 queue, Markov Chains |
| 1/20/05 | Balance equations for Markov Chains, PASTA, M/M/m and
M/M/m/m queues, Erlang loss formulas |
| 1/25/05 | Multiclass Loss Networks, Truncation |
| 1/27/05 | M/G/1 queues, the Pollaczek-Khinchin formula,
M/G/1 queues with Vacations |
| 2/1/05 | Reservations and Polling systems, Round robin queueing |
| 2/3/05 | Priority queueing, Conservation laws, the c-mu
rule |
| 2/8/05 | Generalized processor sharing, fair queueing |
| 2/10/05 | Networks of queues, Kleinrock's independence
assumption, Burkes theorem, Reversibility. |
| 2/15/05 | Other Traffic Models - Markov modulated
models, Fluid models, Gaussian models, Self-similar traffic. |
| 2/17/05 | MIDTERM EXAM |
| 2/22/05 | Routing and graph theory, Minimum spanning
trees |
| 2/24/05 | Shortest path trees, Bellman-Ford algorithm,
Multicast Routing/Steiner Trees |
| 3/1/05 | Adaptive shortest path routing, Optimization-based routing,
Frank-Wolfe Method. |
| 3/3/05 | |
| 3/8/05 | No class |
| 3/9/05 | MAKE-UP LECTURE (RM L251, 3:30-5:00): |
| 3/10/05 | PROJECT PRESENTATIONS |