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

Download: ps, pdf, html, pdf:slides.

“High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two” by Charles Blake and Rodrigo Rodrigues. In Ninth Workshop on Hot Topics in Operating Systems (HotOS-IX), (Lihue, Hawaii), May 2003, pp. 1-6.

Abstract

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 use 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 needed cross-system bandwidth is unreasonable.

Download: ps, pdf, html, pdf:slides.

BibTeX entry:

@inproceedings{blake03high,
   author = {Charles Blake and Rodrigo Rodrigues},
   title = {High Availability, Scalable Storage, Dynamic Peer Networks:
	Pick Two},
   booktitle = {Ninth Workshop on Hot Topics in Operating Systems (HotOS-IX)},
   pages = {1--6},
   address = {Lihue, Hawaii},
   month = may,
   year = {2003}
}