 TITLE: Simple,
scaleable network algorithms
SPEAKER:
Balaji Prabhakar
Depts of Electrical Engineering and Computer Science
Stanford University
DATE: 2:00 - 3:00 P.M., Tuesday August 5, 2003
LOCATION: Pi, 1L (PA)
HOST: Vinay Deolalikar
ABSTRACT:
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 algorithms 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-implement, high-performance network algorithms.
Joint work with: P. Giaccone, K. Psounis and D. Shah
|
printable version
