Name
Abstract | ||
|---|---|---|
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network; efficient routing can be maintained in the face of participant node failures. This fault-tolerance is an important aspect of modern, decentralised data storage solutions. In architectures that employ DHTs, the choice of algorithm for data replication and maintenance can have a significant impact upon performance and reliability. This paper presents a comparative analysis of replication algorithms for architectures based upon a specific design of DHT. It presents also a novel maintenance algorithm for dynamic replica placement, and considers the reliability of the resulting designs at the system level. The performance of the algorithms is examined using simulation techniques; significant differences are identified in terms of communication costs and latency. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ARES.2006.108 | ARES |
Keywords | Field | DocType |
fault tolerant computing,storage management,table lookup,DHT,data maintenance algorithm,data replication algorithm,distributed hash tables,dynamic replica placement,fault-tolerance,local routing tables,reliable decentralised data storage,resilient lookup service | Replica,Replication (computing),Key-based routing,Latency (engineering),Computer science,Computer data storage,Routing table,Hash table,System level,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-2567-9 | 3 | 0.40 |
References | Authors | |
16 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthew Leslie | 1 | 16 | 1.51 |
| Jim Davies | 2 | 673 | 80.95 |
| Todd Huffman | 3 | 25 | 2.51 |