• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Autonomous Replication for High Availability in Unstructured P2P Systems (2003)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.research.rutgers.edu]
  • [www.panic-lab.rutgers.edu]
  • [www.research.rutgers.edu]
  • [www.cs.rutgers.edu]
  • [www.matiascuenca.com.ar]
  • [www.panic-lab.rutgers.edu]
  • [www.cs.rutgers.edu]
  • [www.cs.rutgers.edu]
  • [www.cs.rutgers.edu]
  • [www.cs.rutgers.edu]
  • [www.research.rutgers.edu]
  • [athos.rutgers.edu]
  • [www.panic-lab.rutgers.edu]
  • [www.cs.rutgers.edu]
  • [www.research.rutgers.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Francisco Matias Cuenca-Acuna , Richard P. Martin , Thu D. Nguyen
Venue:In Proceedings of the Symposium on Reliable Distributed Systems (SRDS
Citations:16 - 7 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Cuenca-Acuna03autonomousreplication,
    author = {Francisco Matias Cuenca-Acuna and Richard P. Martin and Thu D. Nguyen},
    title = {Autonomous Replication for High Availability in Unstructured P2P Systems},
    booktitle = {In Proceedings of the Symposium on Reliable Distributed Systems (SRDS},
    year = {2003}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We consider the problem of increasing the availability of shared data in peer-to-peer systems. In particular, we conservatively estimate the amount of excess storage required to achieve a practical availability of 99.9% by studying a decentralized algorithm that only depends on a modest amount of loosely synchronized global state. Our algorithm uses randomized decisions extensively together with a novel application of an erasure code to tolerate autonomous peer actions as well as staleness in the loosely synchronized global state. We study the behavior of this algorithm in three distinct environments modeled on previously reported measurements. We show that while peers act autonomously, the community as a whole will reach a stable configuration. We also show that space is used fairly and efficiently, delivering three nines availability at a cost of six times the storage footprint of the data collection when the average peer availability is only 24%.

Citations

3028 H.: Chord: A scalable Peer-To-Peer lookup service for internet applications - Stoica, Morris, et al.
2353 A scalable content-addressable network - Ratnasamy, Francis, et al. - 2001
1503 Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems - Rowstron, Druschel - 2001
1185 Space/time trade-offs in hash coding with allowable errors - Bloom - 1970
928 Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz, et al. - 2001
914 A measurement study of peer-to-peer file sharing systems - Saroiu, Gummadi, et al. - 2002
847 Oceanstore: An architecture for global-scale persistent storage - Kubiatowicz, Bindel, et al. - 2000
777 Wide-area cooperative storage with CFS - Dabek, Kaashoek, et al. - 2001
374 Lottery Scheduling: Flexible Proportional-Share Resource Management - Waldspurger, Weihl
352 Effective erasure codes for reliable computer communication protocols - Rizzo - 1997
336 FARSITE: Federated, available, and reliable storage for an incompletely trusted environment - Adya, Bolosky, et al. - 2002
257 Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs - Bolosky, Douceur, et al.
245 G.: Understanding availability - Bhagwan, Savage, et al. - 2003
232 Ivy: a read/write peer-to-peer file system - Muthitacharoen, Morris, et al. - 2002
165 Analysis of the evolution of peerto-peer systems - Liben-Nowell, Balakrishnan, et al. - 2002
150 Erasure coding vs. replication: A quantitative comparison - Weatherspoon, Kubiatowicz - 2002
139 PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities - Cuenca-Acuna, Peery, et al. - 2003
48 T.D.: Text-based content search and retrieval in ad-hoc p2p communities - Cuenca-Acuna, Nguyen - 2002
37 Competitive hill-climbing strategies for replica placement in a distributed file system - Douceur, Wattenhofer - 2001
35 The power of epidemics: Robust communication for large-scale distributed systems - VOGELS, RENESSE, et al. - 2003
16 Measuring End-User Availability on the Web: Practical Experience - Merzbacher, Patterson - 2002
15 Silverback: A Global-Scale Archival System - Weatherspoon, Wells, et al. - 2000
6 Dependability in the Internet Era. Keynote presentation at the 2nd HDCC Workshop - Gray - 2001
4 Irregularities in file-size distributions - Evans, Kuenning - 2002
4 Transaction-based Charging in Mnemosyne: a Peer-to-Peer Steganographic Storage System - Roscoe, Hand - 2002
2 Oceanstore: An architecture for - Kubiatowicz, Bindel, et al. - 2000
1 Intel pentium 4 and intel xeon processor optimization reference manual - unknown authors - 2002
1 ReliableStorage for an Incompletely Trusted Environment - Federated, Available - 1970
1 on Peer-to-Peer Computing (co-located with Networking 2002), May 2002.[20 - Rowstron, Druschel - 1994
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University