Exploiting routing redundancy via structured peer-to-peer overlays

Author

Zhao, Ben Y. ; Huang, Ling ; Stribling, Jeremy ; Joseph, Anthony D. ; Kubiatowicz, John D.

Author_Institution

Div. of Comput. Sci., California Univ., Berkeley, CA, USA

fYear

2003

fDate

4-7 Nov. 2003

Firstpage

246

Lastpage

257

Abstract

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 paper, 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.

Keywords

Internet; computer networks; protocols; telecommunication network routing; telecommunication traffic; Berkeley; Tapestry prototype; fault detection; protocol-independent traffic redirection mechanism; resilient routing; routing redundancy; routing service; structured peer-to-peer overlays; Bandwidth; Convergence; Delay; Fault detection; Maintenance; Peer to peer computing; Protocols; Routing; Streaming media; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Network Protocols, 2003. Proceedings. 11th IEEE International Conference on

ISSN

1092-1648

Print_ISBN

0-7695-2024-3

Type

conf

DOI

10.1109/ICNP.2003.1249775

Filename

1249775