Download:
|
by Ben Y. Zhao, Ben Y. Zhao, Ling Huang, Ling Huang, Anthony D. Joseph, Anthony D. Joseph, John D. Kubiatowicz, John D. Kubiatowicz
http://oceanstore.cs.berkeley.edu/publications/papers/compressed/ft-tapestry-tr.ps.gz
Add To MetaCart
Abstract:
As new and interesting peer-to-peer applications combine with advancements in networking technology, they are reaching millions of users across the globe. Numerous studies have shown, however, that loss of connectivity is common on the wide-area network, due to hardware and software failures, and network misconfigurations. Despite the natural redundancy present in underlying network links, the current IP layer fails to recognize and recover from these frequent failures in a timely fashion. This paper presents fault-tolerant routing on the Tapestry overlay network, which exploits existing network redundancy by dynamically switching traffic onto precomputed alternate routes. Furthermore, messages in our system can be duplicated and multicast "around " network congestion and failure hotspots with rapid reconvergence to drop duplicates. Our simulations show fault-tolerant Tapestry to be highly effective at circumventing link and node failures, with reasonable cost in terms of additional routing latency and bandwidth cost. 1
Citations
|
2113
|
Chord: A scalable peer-to-peer lookup service for internet applications
– Stoica, Morris, et al.
|
|
1749
|
A scalable content-addressable network
– Ratnasamy, Francis, et al.
- 2001
|
|
1137
|
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
– Rowstron, Druschel
- 2001
|
|
768
|
Tapestry: An infrastructure for fault-tolerant wide-area location and routing
– Zhao, Kubiatowicz, et al.
- 2001
|
|
643
|
Oceanstore: An architecture for global-scale persistent storage
– Kubiatowicz, Bindel, et al.
- 2000
|
|
607
|
End-to-end Internet Packet Dynamics
– Paxson
- 1999
|
|
605
|
Resilient Overlay Networks
– Andersen, Balakrishnan, et al.
- 2001
|
|
581
|
Wide-area cooperative storage with CFS
– Dabek, Kaashoek, et al.
- 2001
|
|
499
|
How to Model an Internetwork
– Zegura, Bhattacharjee
- 1996
|
|
452
|
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
– Rowstron, Druschel
- 2001
|
|
451
|
End-to-end routing behavior in the internet
– Paxson
- 1997
|
|
375
|
Accessing nearby copies of replicated objects in a distributed environment
– Plaxton, Rajaraman, et al.
- 1997
|
|
289
|
Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination
– Zhuang, Zhao, et al.
- 2001
|
|
243
|
Kademlia: A peer-to-peer information system based on the xor metric
– Maymounkov, Mazi`eres
- 2002
|
|
217
|
Internet routing instability
– Labovitz, Malan, et al.
- 1998
|
|
206
|
SCRIBE: The de-sign of a large-scale event notification infrastructure
– ROWSTRON, KERMARREC, et al.
- 2001
|
|
126
|
Distributed object location in a dynamic network
– Hildrum, Kubiatowicz, et al.
|
|
93
|
An architecture for IP address allocation with CIDR
– Rekhter, Li
- 1993
|
|
83
|
A border gateway protocol 4 (BGP-4
– Rekhter, Li, et al.
- 2003
|
|
70
|
End-to-end WAN service availability
– Chandra, Dahlin, et al.
- 2001
|
|
58
|
Brocade: Landmark rout-ing on overlay networks
– ZHAO, DUAN, et al.
|
|
23
|
An experimental study of delayed Internet routing convergence
– Labovitz, Ahuja, et al.
- 2000
|
|
14
|
MD2, MD4, MD5, SHA and other hash functions
– ROBSHAW
- 1995
|
|
10
|
A Wireless Network in MosquitoNet
– Cheshire, Baker
- 1996
|
|
1
|
a case for informed internet routing and transport
– Detour
- 1999
|
