EECS 454: Advanced Communication Networks
Spring 2010

Lecture Topics/Notes

Lectures from 2008 can be found here

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/10Multi-class loss networks, reversibility, truncation.
4/19/10M/G/1 queues, PK-formula, M/G/1 queues with vacations.
4/23/10Multi-class M/G/1 queues; reservation and polling systems.
4/28/08Priority queues, Convervation Laws, c-mu rule
4/26/10Generalized Processor sharing, weighted fair queueing
4/28/10Traffic modeling: Markov modulated models, fluid models, self similarity and long range dependence
5/5/10Networks 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/10Minimum spanning Trees, Shortest path trees, Bellman-Ford algorithm, Adaptive shortest path routing
5/19/10Optimization-based routing, convex programming, distributed optimal routing
5/24/10Congestion control and Fairness, max-min fairness, proportional fairness, utility-based congestion control.
5/26/10utility-based congesiton control and TCP; traffic policing/shapping; leaky-buckets and network calculus.