ICME Seminar: Network Algorithms

Balaji Prabhakar Associate Professor of Electrical Engineering and of Computer Science, Stanford University

Over the past 10-15 years the area of Network Algorithms has grown from a collection of isolated algorithms and analysis methods into a cohesive body of research and development. Algorithms for highspeed implementations are characterized by several requirements, of which speed, scalability and simplicity are the most important. For algorithms designed to operate in router hardware, there is the additional stringent constraint of low heat dissipation.

We overview the development of Network Algorithms, and describe algorithms for bandwidth partitioning, switching and routing. We highlight the crucial role of randomization in simplifying the implementation while delivering a high performance.