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
Using the transformational approach to build a safe and generic data synchronizer
GROUP '03 Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work
ACM Computing Surveys (CSUR)
Guaranteeing correctness and availability in P2P range indices
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Preventive Replication in a Database Cluster
Distributed and Parallel Databases
Data currency in replicated DHTs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Dynamic and distributed reconciliation in P2P-DHT networks
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
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
Replication in DHTs using dynamic groups
Transactions on large-scale data- and knowledge-centered systems III
| Hi-index | 0.00 |
In this paper, we address data reconciliation in peer-to-peer (P2P) collaborative applications. We propose P2P-LTR (Logging and Timestamping for Reconciliation) which provides P2P logging and timestamping services for P2P reconciliation over a distributed hash table (DHT). While updating at collaborating peers, updates are timestamped and stored in a highly available P2P log. During reconciliation, these updates are retrieved in total order to enforce eventual consistency. In this paper, we first give an overview of P2P-LTR with its model and its main procedures. We then present our prototype used to validate P2P-LTR. To demonstrate P2P-LTR, we propose several scenarios that test our solutions and measure performance. In particular, we demonstrate how P2P-LTR handles the dynamic behavior of peers with respect to the DHT.