Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two

Peer-to-peer storage aims to build large-scale, reliable and available storage from many small-scale unreliable, low-availability distributed hosts. Data redundancy is the key to any data guarantees. However, preserving redundancy in the face of highly dynamic membership is costly. We apply a simple resource usage model to measured behavior from the Gnutella file-sharing network to argue that large-scale cooperative storage is limited by likely dynamics and cross-system bandwidth—not by local disk space. We examine some bandwidth optimization strategies like delayed response to failures, admission control, and load-shifting and find that they do not alter the basic problem. We conclude that when redundancy, data scale, and dynamics are all high, the requisite cross-system bandwidth is beyond reasonable expectations.

Charles Blake, MIT Laboratory for Computer Science

Rodrigo Rodrigues, MIT Laboratory for Computer Science

BibTeX
@inproceedings {270299,
author = {Charles Blake and Rodrigo Rodrigues},
title = {High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two},
booktitle = {9th Workshop on Hot Topics in Operating Systems (HotOS IX)},
year = {2003},
address = {Lihue, HI},
url = {https://www.usenix.org/conference/hotos-ix/high-availability-scalable-storage-dynamic-peer-networks-pick-two},
publisher = {USENIX Association},
month = may
}
Download

Links

Paper: 
http://www.usenix.org/events/hotos03/tech/full_papers/blake/blake.pdf
Paper (HTML): 
http://www.usenix.org/events/hotos03/tech/full_papers/blake/blake_html/index.html
Slides: 
http://www.usenix.org/events/hotos03/tech/talks/blake_talk.pdf
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us