Fault-resilient Overlay Routing

Exploiting Routing Redundancy via
Structured Peer-to-Peer Overlays


Structured peer-to-peer overlays provide a natural infrastructure for resilient routing via efficient fault detection and precomputation of backup paths. These overlays can respond to faults in a few hundred milliseconds by rapidly shifting between alternate routes. In this work, we present two adaptive mechanisms for structured overlays and illustrate their operation in the context of Tapestry, a fault-resilient overlay from Berkeley. We also describe a transparent, protocol-independent traffic redirection mechanism that tunnels legacy application traffic through overlays. Our measurements of a Tapestry prototype show it to be a highly responsive routing service, effective at circumventing a range of failures while incurring reasonable cost in maintenance bandwidth and additional routing latency.

Publications:

Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays
Ben Y. Zhao, Ling Huang, Jeremy Stribling, Anthony D. Joseph, and John D. Kubiatowicz
The 11th IEEE International Conference on Network Protocols (ICNP)
Atlanta, Georgia, November 2003
[Abstract, PDF (163KB), ps.gz (120KB)]

Exploiting Routing Redundancy Using a Wide-area Overlay
Ben Y. Zhao, Ling Huang, Anthony D. Joseph and John D. Kubiatowicz
U. C. Berkeley Technical Report UCB/CSD-02-1215, November 2002
[Compressed Postscript(176KB), PDF(155KB)]

Talks:

Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays
Presented at The 11th IEEE International Conference on Network Protocols(ICNP)
Talk: [PDF (603KB), PPS (151KB)]

People:

Ben Y. Zhao, August 24, 2003