ACM Home Page
Please provide us with feedback. Feedback
Maintaining replicas in unstructured P2P systems
Full text PdfPdf (327 KB)
Source International Conference On Emerging Networking Experiments And Technologies archive
Proceedings of the 2008 ACM CoNEXT Conference table of contents
Madrid, Spain
Article No. 19  
Year of Publication: 2008
ISBN:978-1-60558-210-8
Authors
Christof Leng  TU Darmstadt
Wesley W. Terpstra  TU Darmstadt
Bettina Kemme  McGill University
Wilhelm Stannat  TU Darmstadt
Alejandro P. Buchmann  TU Darmstadt
Sponsors
ACM: Association for Computing Machinery
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 31,   Downloads (12 Months): 67,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1544012.1544031
What is a DOI?

ABSTRACT

Replication is widely used in unstructured peer-to-peer systems to improve search or achieve availability. We identify and solve a subclass of replication problems where each object is associated with a maintainer node, and its replicas should only be available as long as its maintainer is part of the network. Such requirement can be found in various applications, e.g., when objects are directory lists, service lists, or subscriptions of a publish/subscribe system.

We provide maintainers with proven guarantees on the number of replicas, in spite of network churn and crash failures. We also tackle the related problems of changing the number of replicas, updating replicas, balancing storage load in a heterogeneous network, and eliminating replicas left by crashing maintainers. Our algorithm is based on probabilistic methods and is simple to implement. We show by simulation and formal proof that our algorithm is correct.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
P. Billingsley. Convergence of Probability Measures. Wiley-Interscience, second edition, July 1999.
5
6
 
7
 
8
 
9
 
10
 
11
 
12
J. Kangasharju, K. W. Ross, and D. A. Turner. Optimizing File Availability in Peer-to-Peer Content Distribution. In INFOCOM, 2007.
 
13
14
15
16
17
18
 
19
S. Saroiu, P. K. Gummadi, and S. D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Multimedia Comp. and Networking, 2002.
 
20
 
21
E. Sit, A. Haeberlen, F. Dabek, B. Chun, H. Weatherspoon, R. Morris, M. F. Kaashoek, and J. Kubiatowicz. Proactive Replication for Data Durability. In IPTPS, 2006.
22
23

Collaborative Colleagues:
Christof Leng: colleagues
Wesley W. Terpstra: colleagues
Bettina Kemme: colleagues
Wilhelm Stannat: colleagues
Alejandro P. Buchmann: colleagues