Due to the explosive growth of communications networks, there is a crucial need for efficient algorithms in various domains of networking. In this talk, we discuss algorithmic strategies for a family of such problems that involve routing, wavelength assignment and (distributed) scheduling. Randomization, linear programming, and multi-commodity flow play key roles in these approaches.

Host: Rajmohan Rajaraman