Stanford Networking Seminar

12:15PM, Thursday March 11, 2010
Gates 104


Building a Highly Flexible Internet: Two Routing Architectures for the Price of One
 

Brighten Godfrey
University of Illinois at Urbana-Champaign


About the talk:
The Internet has become the basis of most of humanity's remote communication. Its rapid growth and the fact that we use it in so many unexpected ways attest to the groundbreaking flexibility of its design. Yet because of this growth, the Internet's architecture has encountered a range of limitations. This talk will describe two routing protocols with the goal of breaking down those limitations. One key challenge is to enable more flexible choice of paths in the network, thus giving greater control and reliability to the network's users. I will discuss pathlet routing, our approach to making Internet routing fundamentally more flexible by representing the network as a virtual topology independent of the physical topology, and allowing users to select routes within that topology. A second challenge is to accommodate enormous scale and highly dynamic networks---without requiring traditional location-dependent addresses which have complicated mobility, management, and multihoming. I will present our work on Disco, the first distributed protocol which simultaneously guarantees scalability and nearly-shortest paths while routing on "flat" location-independent identifiers. Our work builds on recent theoretical advances in the area of compact routing, and is the first to realize these guarantees in a distributed setting. This talk describes work with Igor Ganichev, Scott Shenker, Ion Stoica, Ankit Singla, Kevin Fall, Gianluca Iannaccone, and Sylvia Ratnasamy.

About the speaker:
Brighten Godfrey is an assistant professor in the Department of Computer Science at the University of Illinois at Urbana-Champaign. He completed his Ph.D. at UC Berkeley in May 2009, advised by Ion Stoica, and his B.S. at Carnegie Mellon University in 2002. His research interests lie in the design and analysis of networked systems.