28585 articles – 22070 references  [version française]

inria-00376751, version 1

Data Reconciliation in P2P Collaborative Applications

Mounir Tlili () a1, William Kokou Dedzoe () a1, Esther Pacitti () b1, Patrick Valduriez () a1, Reza Akbarinia () a1, Pascal Molli () c2, Gérôme Canals () 2, Julien Maire () 2, Stéphane Laurière () d3

24ème Journées "Bases de Données Avancées" - BDA 2008 (2008)

Abstract: 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.

  • a –  INRIA
  • b –  Université de Nantes
  • c –  UNIVERSITE HENRI POINCARE
  • d –  XWIKI
  • 1:  ATLAS (INRIA)
  • INRIA – Université de Nantes
  • 2:  ECOO (INRIA Lorraine - LORIA)
  • INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
  • 3:  XWiKi
  • XWIKI
  • Domain : Computer Science/Databases
  • Keywords : Data base – distributed data management – optimistic replication – P2P system – reconciliation – DHT.
 
  • inria-00376751, version 1
  • oai:hal.inria.fr:inria-00376751
  • From: 
  • Submitted on: Monday, 20 April 2009 10:55:48
  • Updated on: Tuesday, 1 December 2009 11:59:51