BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Stabilizing Internet Routing: or\, A Story of Heterogeneity - Brig
 hten Godfrey (UC Berkeley)
DTSTART:20080320T163000Z
DTEND:20080320T173000Z
UID:TALK11209@talks.cam.ac.uk
CONTACT:Eiko Yoneki
DESCRIPTION:A significant cause of the unreliability of end-to-end communi
 cations on the Internet is route instability: dynamic changes in routers' 
 selected paths. Instability is becoming even more problematic due to the i
 ncreasing prevalence of real-time applications and concerns about the scal
 ability of the Internet routing architecture.  Yet Route Flap Damping\, th
 e main mechanism for combating instability\, has introduced unexpected pat
 hologies and reduced availability.\n\nThis talk describes a more principle
 d approach to stabilizing Internet routing.  First\, we characterize the d
 esign space by identifying general approaches to achieve stability\, and g
 iving theoretical bounds on optimal strategies within each approach. Secon
 d\, I will describe Stable Route Selection (StaRS)\, a new mechanism which
  uses flexibility in route selection to improve stability without sacrific
 ing availability.  Simulation and experimental results show that StaRS imp
 roves stability and end-to- end reliability while deviating only slightly 
 from preferred routes\, and closely approaching our theoretical lower boun
 d.  These results indicate that StaRS is a promising\, easily deployable w
 ay to safely stabilize Internet routing.\n\nStaRS's stability improvements
  are enabled by dramatic heterogeneity in route failure patterns.  Time pe
 rmitting\, I will present the case that StaRS is an instance of a much mor
 e general principle: that heterogeneity --- variation in reliability\, pro
 cessing speed\, bandwidth\, or other metrics --- should quite often be vie
 wed as an advantage.  This thesis is supported by practical and theoretica
 l results in a variety of settings including distributed hash tables\, ove
 rlay multicast\, and job scheduling.\n\nBio: Brighten Godfrey's research c
 oncerns distributed and networked systems\, including Internet routing arc
 hitecture\, distributed algorithms\, analysis of networks\, peer-to-peer s
 ystems and overlay networks.  He is presently a Ph.D. candidate advised by
  Ion Stoica at UC Berkeley.\n\n
LOCATION:Lecture Theatre 2\, Computer Laboratory\, William Gates Builiding
END:VEVENT
END:VCALENDAR