Simple, Scaleable Network Algorithms

Monday, August 6, 2001 - 3:00pm - 4:00pm
Keller 3-180
Balaji Prabhakar (Stanford University)
Several networking problems suffer from the curse of dimensionality: algorithmic solutions do not scale well with the size of the user population or with the speed of operation. There is often the need to take advantantage of some features of the problem to devise simple-to-implement, scaleable algorithms.

This talk illustrates the use of randomization, parallelism and memory to design algorithms for web caching, switch scheduling and bandwidth partitioning.

It represents joint work with P. Giaccone, R. Pan, K. Psounis and D. Shah.