Dynamic and Distributed Reconciliation in P2P-DHT Networks

  • Vidal Martins
  • Esther Pacitti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4128)


Optimistic replication can provide high data availability for collaborative applications in large scale distributed systems (grid, P2P, and mobile systems). However, if data reconciliation is performed by a single node, data availability remains an important issue since the reconciler node can fail. Thus, reconciliation should also be distributed and reconciliation data should be replicated. We have previously proposed the DSR-cluster algorithm, a distributed version of the IceCube semantic reconciliation engine designed for cluster networks. However DSR-cluster is not suitable for P2P networks, which are usually built on top of the Internet. In this case, network costs must be considered. The main contribution of this paper is the DSR-P2P algorithm, a distributed reconciliation algorithm designed for P2P networks. We first propose a P2P-DHT cost model for computing communication costs in a DHT overlay network. Second, taking into account this model, we propose a cost model for computing the cost of each reconciliation step. Third, we propose an algorithm that dynamically selects the best nodes for each reconciliation step. Our algorithm yields high data availability with acceptable performance and limited overhead.


Cost Model Distribute Hash Table Connected Node Cost Provider Lookup Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aberer, K., Cudré-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-grid: a self-organizing structured p2p system. SIGMOD Rec. 32(3) (2003)Google Scholar
  2. 2.
  3. 3.
    Clarke, I., Hong, T.W., Miller, S.G., Sandberg, O., Wiley, B.: Protecting free expression online with freenet. IEEE Internet Computing 6(1) (2002)Google Scholar
  4. 4.
    Howell, F., McNab, R.: Simjava: a discrete event simulation library for java. In: Web-based Modeling and Simulation (1998)Google Scholar
  5. 5.
    Huebsch, R., Hellerstein, J.M., Lanham, N., Stoica, I., Loo, B.T., Shenker, S.: Querying the internet with pier. In: Proc. of VLDB Conference (2003)Google Scholar
  6. 6.
    Kermarrec, A., Rowstron, A., Shapiro, M., Druschel, P.: The icecube approach to the reconciliation of divergent replicas. In: Proc. of ACM PODC (2001)Google Scholar
  7. 7.
    Knezevic, P., Wombacher, A., Risse, T.: Enabling high data availability in a dht. In: Proc. of DEXA Workshops (2005)Google Scholar
  8. 8.
    Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: Proc. of ACM ASPLOS (2000)Google Scholar
  9. 9.
    Martins, V., Pacitti, E., Valduriez, P.: Distributed semantic reconciliation of replicated data. In: Proc. of CDUR, IEEE France and ACM SIGOPS France (2005)Google Scholar
  10. 10.
    Martins, V., Pacitti, E., Valduriez, P.: A dynamic distributed algorithm for semantic reconciliation. In: Distributed Data and Structures 7 (WDAS) (2006)Google Scholar
  11. 11.
    Preguiça, N., Shapiro, M., Matheson, C.: Semantics-based reconciliation for collaborative and mobile environments. In: Proc. of IFCIS CoopIS (2003)Google Scholar
  12. 12.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proc. of ACM SIGCOMM (2001)Google Scholar
  13. 13.
    Saito, Y., Shapiro, M.: Optimistic replication. ACM Comput. Surv. 37(1) (2005)Google Scholar
  14. 14.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. of ACM SIGCOMM (2001)Google Scholar
  15. 15.
    Whittaker, S., Isaacs, E., O’Day, V.: Widening the net: workshop report on the theory and practice of physical and network communities. ACM SIGCHI Bulletin 29(3) (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Vidal Martins
    • 1
    • 2
  • Esther Pacitti
    • 1
  1. 1.ATLAS Group, INRIA and LINAUniversity of NantesFrance
  2. 2.PPGIA/PUCPRPontifical Catholic University of ParanáBrazil

Personalised recommendations