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
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
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
Protecting Free Expression Online with Freenet
IEEE Internet Computing
Open Problems in Data-Sharing Peer-to-Peer Systems
ICDT '03 Proceedings of the 9th International Conference on Database Theory
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
Fine-grained network time synchronization using reference broadcasts
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Adaptive clock synchronization in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Relaxed currency and consistency: how to say "good enough" in SQL
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Caching with "good enough" currency, consistency, and completeness
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Relaxed-currency serializability for middle-tier caching and replication
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Pond: the oceanstore prototype
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
Best position algorithms for top-k queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
P2P logging and timestamping for XWiki
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Efficient Processing of Continuous Join Queries Using Distributed Hash Tables
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
P2P logging and timestamping for reconciliation
Proceedings of the VLDB Endowment
Scalable and topology-aware reconciliation on P2P networks
Distributed and Parallel Databases
Maintaining replicas in unstructured P2P systems
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Load-Aware Dynamic Replication Management in a Data Grid
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Continuous timestamping for efficient replication management in DHTs
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
A formal characterization of SI-based ROWA replication protocols
Data & Knowledge Engineering
A P2P approach to many tasks computing for scientific workflows
VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science
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 a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without data currency guarantees. Supporting data currency in replicated DHTs is difficult as it requires the ability to return a current replica despite peers leaving the network or concurrent updates. In this paper, we give a complete solution to this problem. We propose an Update Management Service (UMS) to deal with data availability and efficient retrieval of current replicas based on timestamping. For generating timestamps, we propose a Key-based Timestamping Service (KTS) which performs distributed timestamp generation using local counters. Through probabilistic analysis, we compute the expected number of replicas which UMS must retrieve for finding a current replica. Except for the cases where the availability of current replicas is very low, the expected number of retrieved replicas is typically small, e.g. if at least 35% of available replicas are current then the expected number of retrieved replicas is less than 3. We validated our solution through implementation and experimentation over a 64-node cluster and evaluated its scalability through simulation up to 10,000 peers using SimJava. The results show the effectiveness of our solution. They also show that our algorithm used in UMS achieves major performance gains, in terms of response time and communication cost, compared with a baseline algorithm.