Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
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
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Adaptive clock synchronization in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Awarded Best Student Paper! - Pond: The OceanStore Prototype
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Data currency in replicated DHTs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
P2P logging and timestamping for reconciliation
Proceedings of the VLDB Endowment
Replication in DHTs using dynamic groups
Transactions on large-scale data- and knowledge-centered systems III
Hi-index | 0.00 |
Distributed Hash Tables (DHTs) provide an efficient solution for data location and lookup in large-scale P2P systems. However, it is up to the applications to deal with the availability of the data they store in the DHT, e.g. via replication. To improve data availability, most DHT applications rely on data replication. However, efficient replication management is quite challenging, in particular because of concurrent and missed updates. In this paper, we propose an efficient solution to data replication in DHTs. We propose a new service, called Continuous Timestamp based Replication Management (CTRM), which deals with the efficient storage, retrieval and updating of replicas in DHTs. To perform updates on replicas, we propose a new protocol that stamps update actions with timestamps generated in a distributed fashion. Timestamps are not only monotonically increasing but also continuous, i.e. without gap. The property of monotonically increasing allows applications to determine a total order on updates. The other property, i.e. continuity, enables applications to deal with missed updates. We evaluated the performance of our solution through simulation and experimentation. The results show its effectiveness for replication management in DHTs.