Algorithms for the Management of Networks
(236601)
Place and Time: Taub 8; Mon. 12:30-14:30 (Fall 2003/2004)
Lectures
(please
read the notes with a grain of suspicion...)
- 27/10 - introduction ; motivation
- 3/11 - (notes)
bounded delay buffers (deterministic algorithms); call admission on the
line (randomized algorithms)
- 10/11 - (notes) switch architectures;
simulating an OQ switch on a CIOQ switch
- 17/11 - (notes) OQ buffer management;
the Harmonic algorithm for shared memory switches
- 1/12 - Weighted fair queuing; online congestion minimization
- the AAP algorithm
- 8/12 - (notes) Proof of the competitiveness
of AAP. Adversarial Queuing Theory - definitions
- 21/12 - (notes) Adversarial Queuing
Theory; the protocol Furthest-To-Go
- 22/12 - (notes) Universally stable protocols;
instability of FIFO
- 29/12 - Stability against low-rate adversaries; routing in
the AQT setting
- 5/1 - Time-constrained scheduling
- 12/1 - (notes) Timed-constrained
scheduling (cont.); &:wnbsp;competitive TCP-acknowledgements
- 19/1 - (notes) Selfish
routing
- 26/1 - Selfish routing (cont.); open problems, concluding
remarks