Simple, Scaleable Network Algorithms

Prof. Balaji Prabhakar, Stanford University

About the Event

Randomized algorithms are particularly well-suited for coping with the so-called "curse of dimensionality" from which many networking problems suffer. The main idea of randomized algoriths is simple to state: Rather than contend with a large state space, the trick is to base decisions upon a few randomly chosen samples. This talk will illustrate the use of randomization in devising simple-to-impelement, high-performance network algorithms; specifically, for switch scheduling, web caching, and bandwidth partitioning.

Additional Information

Contact: Kim A. Winick

Phone: 734-754-5203

Email: winick@umich.edu

Sponsor: Lucent Technologies/EECS500

Open to: Public