Tornado: a capability-aware peer-to-peer storage overlay

Peer-to-peer storage networks aim at aggregating the storage in today's resource-abundant computers to form a large, shared storage space. With the extreme heterogeneity in machines, networks and administrative organizations over which such networks are laid, peer-to-peer storage networks must be aware of the capabilities of the constituent components to leverage their resources, performance and reliability. This paper reports our design of such a peer-to-peer storage network called Tornado. Tornado is built on top of three concepts. The first is the virtual home concept, which designates each data item in Tornado to a virtual home instead of directly to a peer node. The second concept is node autonomy, which allows each peer node to determine the number of virtual homes it intends to host according to its computational capability. The third concept is quality classification, which classifies the peer nodes into "good" and "bad" according to their static and dynamic capabilities. Only "good" peers can host virtual homes, whereby leveraging the reliability and capabilities of these peers. When a good peer becomes overloaded, Tornado seeks another good but inactive peer to relieve the load.

[1]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[2]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[3]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[5]  Martin F. Arlitt,et al.  Web server workload characterization: the search for invariants , 1996, SIGMETRICS '96.

[6]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[7]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[8]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[9]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[10]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[11]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[12]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.