Download:
|
by Sean Rhea, Dennis Geels, Timothy Roscoe, John Kubiatowicz, Sean Rhea, Dennis Geels, Timothy Roscoe, John Kubiatowicz
http://digitalassets.lib.berkeley.edu/techreports/ucb/text/CSD-03-1299.ps
Add To MetaCart
Abstract:
This paper addresses the problem of churn—the continuous process of node arrival and departure—in distributed hash tables (DHTs). We demonstrate through experiment that existing DHT implementations break down at churn levels observed in deployed peer-to-peer systems, contrary to simulation-based results. We present Bamboo, a DHT that handles high levels of churn, and discuss the manner in which it does so. We show that Bamboo is able to function effectively for median node session times as short as 1.4 minutes, while using less than 900 bytes/s/node of maintenance bandwidth in a 1000-node system. This churn rate is faster than that observed in real file-sharing systems such as Gnutella, Kazaa, Napster, and Overnet. Since Bamboo’s bandwidth usage scales logarithmically in the number of nodes, we expect this cost to remain within the reach of dialup modems even for very large systems. Moreover, in simulated networks without churn, Bamboo achieves lookup performance comparable with Pastry, an existing DHT with a similar structure. 1
Citations
|
2238
|
Chord: A scalable peerto-peer lookup service for internet applications
– Stoica, Morris, et al.
- 2001
|
|
1854
|
A scalable content-addressable network
– Ratnasamy, Francis, et al.
- 2001
|
|
1203
|
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
– Rowstron, Druschel
- 2001
|
|
807
|
Tapestry: An infrastructure for fault-tolerant wide-area location and routing
– Zhao, Kubiatowicz, et al.
- 2001
|
|
733
|
A Measurement Study of Peer-to-Peer File Sharing Systems
– Saroiu, Gummadi, et al.
- 2002
|
|
437
|
Epidemic algorithms for replicated database maintenance
– DEMERS, GREENE, et al.
- 1987
|
|
398
|
Accessing nearby copies of replicated objects in a distributed environment
– Plaxton, Rajaraman, et al.
- 1997
|
|
259
|
Kademlia: A Peer-to-peer Information System Based on the XOR Metric
– Maymounkov, Mazieres
- 2002
|
|
228
|
modeling and analysis of a peer-to-peer file-sharing workload
– Gummadi, Dunn, et al.
- 2003
|
|
183
|
Analyzing peer-to-peer traffic across large networks
– Sen, Wang
- 2002
|
|
170
|
Understanding Availability
– Bhagwan, Savage, et al.
- 2003
|
|
169
|
A Quantitative Comparison of Graphbased Models for Internet Topology
– Zegura, Calvert, et al.
- 1997
|
|
159
|
The impact of DHT routing geometry on resilience and proximity
– Gummadi, Gummadi, et al.
- 2003
|
|
132
|
Analysis of the Evolution of the Peer-to-Peer Systems
– Liben-Nowell, Balakrishnan, et al.
- 2002
|
|
118
|
Scalability and accuracy in a largescale network emulator
– VAHDAT, YOCUM, et al.
- 2002
|
|
117
|
Exploiting network proximity in peer-to-peer overlay networks
– Castro, Druschel, et al.
- 2002
|
|
96
|
Availability and locality measurements of peer-to-peer file systems
– Chu, Labonte, et al.
- 2002
|
|
72
|
High availability, scalable storage, dynamic peer networks: Pick two
– Blake, Rodrigues
- 2003
|
|
70
|
On Spreading A Rumor
– Pittel
- 1987
|
|
61
|
Brocade: Landmark routing on overlay networks
– Zhao, Duan, et al.
- 2002
|
|
51
|
Controlling the cost of reliability in peer-to-peer overlays
– Mahajan, Castro, et al.
- 2003
|
|
49
|
Datagram congestion control protocol (DCCP
– Kohler, Handley, et al.
|
|
28
|
Robust and efficient data management for a distributed hash table
– Cates
- 2003
|
|
9
|
Learning Euclidean coordinates for Internet hosts
– Cox, Dabek
- 2002
|
|
9
|
Building a flexible and efficient routing infrastructure: Need and challenges
– Lakshminarayanan, Stoica, et al.
- 2003
|
