DocumentCode :
1905598
Title :
Replica Placement and Location using Distributed Hash Tables
Author :
Bauer, Daniel ; Hurley, Paul ; Waldvogel, Marcel
fYear :
2007
fDate :
15-18 Oct. 2007
Firstpage :
315
Lastpage :
324
Abstract :
Interest in distributed storage is fueled by demand for reliability and resilience combined with decreasing hardware costs. Peer-to-peer storage networks based on distributed hash tables are attractive for their efficient use of resources and resulting performance. The placement and subsequent efficient location of replicas in such systems remain open problems, especially (1) the requirement to update replicated content, (2) working in the absence of global information, and (3) determination of the locations in a dynamic system without introducing single points of failure. We present and evaluate a novel and versatile technique, replica enumeration, which allows for controlled replication and replica access. The possibility of enumerating and addressing individual replicas allows dynamic updates as well as superior performance without burdening the network with state information, yet taking advantage of locality information when available. We simulate, analyze, and prove properties of the system, and discuss some applications.
Keywords :
digital storage; file organisation; peer-to-peer computing; distributed hash tables; distributed storage; dynamic system; global information; location; open problems; peer-to-peer storage networks; replica enumeration; replica placement; replicated content; versatile technique; Analytical models; Computer network reliability; Costs; Fuel storage; Government; Hardware; IP networks; Laboratories; Peer to peer computing; Resilience;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Local Computer Networks, 2007. LCN 2007. 32nd IEEE Conference on
Conference_Location :
Dublin
ISSN :
0742-1303
Print_ISBN :
0-7695-3000-1
Electronic_ISBN :
0742-1303
Type :
conf
DOI :
10.1109/LCN.2007.47
Filename :
4367859
Link To Document :
بازگشت