Availability in Global Peer-To-Peer Storage Systems

Appeared in Distributed Data and Structures 6, Proceedings in Informatics.

Abstract

Peer-to-peer (P2P) file sharing applications have become increasingly popular. Measurements of P2P systems indicate large heterogeneity in the availability of individual nodes. Many have cyclic behavior, whereas others are always available. This paper proposes a cooperative storage technique that employs erasure coding schemes on a collection of data objects and provides various levels of data redundancy. Based on this technique, we study a history-based hill climbing scheme that takes advantage of varied time zones in a global P2P system. Our simulation results show the improved data availability by this scheme. We also investigate several climbing strategies including choice of coding schemes and laziness of data movement.

Publication date:
December 2004

Authors:
Qin Xin
Thomas Schwarz
Ethan L. Miller

Projects:
Ultra-Large Scale Storage

Available media

Full paper text: PDF

Bibtex entry

@inproceedings{xin-ddas04,
  author       = {Qin Xin and Thomas Schwarz and Ethan L. Miller},
  title        = {Availability in Global Peer-To-Peer Storage Systems},
  booktitle    = {Distributed Data and Structures 6, Proceedings in Informatics},
  month        = dec,
  year         = {2004},
}