Web server workload characterization: the search for invariants
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
TYPHOON: mobile distributed hash tables
Journal of Parallel and Distributed Computing
Scoped broadcast in structured P2P networks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Auto-Adaptive Distributed Hash Tables
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
A peer-to-peer mechanism for resource location and allocation over the grid
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
MUREX: a mutable replica control scheme for structured peer-to-peer storage systems
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
| Hi-index | 0.00 |
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.