TY - GEN
T1 - Tornado
T2 - International Parallel and Distributed Processing Symposium, IPDPS 2003
AU - Hsiao, Hung Chang
AU - King, Chung Ta
PY - 2003/1/1
Y1 - 2003/1/1
N2 - Peer-to-peer storage networks aim at aggregating the unused storage in today's resource-abundant computers to form a large, shared storage space. To lay over the extremely variant machines, networks and administrative organizations, 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 two concepts. The first is the virtual home concept, which adds an extra level of abstraction between data and storage nodes to mask the underlying heterogeneity. The second concept is the classification of the storage nodes into "good" and "bad" according to their static and dynamic capabilities. Only "good" peers can host virtual homes, whereby introducing quality of services into the storage network. We evaluate Tornado via simulation. The results show that Tornado is comparable with previous systems, where each route takes at most [log N] hops, anew node takes [log N]2 messages to join, and the memory overhead in each node is O(log N). Moreover, Tornado is able to provide comprehensive services with features scattered in different systems previously, and takes account of and exploits the heterogeneity in the underlying network environment.
AB - Peer-to-peer storage networks aim at aggregating the unused storage in today's resource-abundant computers to form a large, shared storage space. To lay over the extremely variant machines, networks and administrative organizations, 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 two concepts. The first is the virtual home concept, which adds an extra level of abstraction between data and storage nodes to mask the underlying heterogeneity. The second concept is the classification of the storage nodes into "good" and "bad" according to their static and dynamic capabilities. Only "good" peers can host virtual homes, whereby introducing quality of services into the storage network. We evaluate Tornado via simulation. The results show that Tornado is comparable with previous systems, where each route takes at most [log N] hops, anew node takes [log N]2 messages to join, and the memory overhead in each node is O(log N). Moreover, Tornado is able to provide comprehensive services with features scattered in different systems previously, and takes account of and exploits the heterogeneity in the underlying network environment.
UR - http://www.scopus.com/inward/record.url?scp=84862935014&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84862935014&partnerID=8YFLogxK
U2 - 10.1109/IPDPS.2003.1213171
DO - 10.1109/IPDPS.2003.1213171
M3 - Conference contribution
AN - SCOPUS:84862935014
T3 - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003
BT - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 22 April 2003 through 26 April 2003
ER -