UIUC Computer Science Department
University of Illinois at Urbana-Champaign
 Computer Science Colloquium, Brighten Godfrey, Computer Science Division, Univ. of Calif., Berkeley
  
  Speaker  Brighten Godfrey, Computer Science Division, University of California - Berkeley
    
 Date Mar 13, 2008
    
 Time 10:00 am  
    
 Location 2405 Siebel Center
    
 Sponsor Department of Computer Science
    
 Contact Chandra Chekuri
    
 E-Mail 
    
 Event type Colloquia
    
 Original Calendar 
    
 Views 107
    
 
 

Title:
Stabilizing Internet Routing: or, A Story of Heterogeneity

Abstract:
A significant cause of the unreliability of end-to-end communications on the Internet is route instability: dynamic changes in routers' selected paths. Instability is becoming even more problematic due to the increasing prevalence of real-time applications and concerns about the scalability of the Internet routing architecture. Yet Route Flap Damping, the main mechanism for combating instability, has introduced unexpected pathologies and reduced availability.

This talk describes a more principled approach to stabilizing Internet routing. We identify general approaches to achieve stability, and quantify their inherent tradeoffs with other objectives via upper and lower bounds. I will describe Stable Route Selection (StaRS), a new approach which uses flexibility in route selection to improve stability without sacrificing availability. Simulation and experimental results show that StaRS improves stability and end-to-end reliability while deviating only slightly from preferred routes, and closely approaching our theoretical lower bound. These results indicate that StaRS is a promising, easily deployable way to safely stabilize Internet routing.

StaRS's stability improvements are enabled by dramatic heterogeneity in route failure patterns. I will present the case that StaRS is an instance of a much more general principle: that heterogeneity --- variation in reliability, processing speed, bandwidth, or other metrics --- should quite often be viewed as an advantage. This thesis is supported by practical and theoretical results in a variety of settings including distributed hash tables, overlay multicast, and job scheduling.

Bio:
Brighten Godfrey's research concerns distributed and networked systems, including Internet routing architecture, distributed algorithms, analysis of networks, peer-to-peer systems and overlay networks. He is presently a Ph.D. candidate advised by Ion Stoica at UC Berkeley.

http://www.cs.berkeley.edu/~pbg/

 
 
March 2008
S M T W T F S

Department of Computer Science, Thomas M. Siebel Center for Computer Science, 201 N Goodwin Ave,
Urbana, IL 61801-2302. The Department is part of the College of Engineering at the University of Illinois at Urbana-Champaign. Contact academic@cs.uiuc.edu with academic questions
or webmaster@cs.uiuc.edu with questions or comments on this page.