Skip to main content
SpringerLink
Log in

Scalable and topology-aware reconciliation on P2P networks

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

Collaborative applications are characterized by high levels of data sharing. Optimistic replication has been suggested as a mechanism to enable highly concurrent access to the shared data, whilst providing full application-defined consistency guarantees. Nowadays, there are a growing number of emerging cooperative applications adequate for Peer-to-Peer (P2P) networks. However, to enable the deployment of such applications in P2P networks, it is required a mechanism to deal with their high data sharing in dynamic, scalable and available way. Previous work on optimistic replication has mainly concentrated on centralized systems. Centralized approaches are inappropriate for a P2P setting due to their limited availability and vulnerability to failures and partitions from the network. In this paper, we focus on the design of a reconciliation algorithm designed to be deployed in large scale cooperative applications, such as P2P Wiki. The main contribution of this paper is a distributed reconciliation algorithm designed for P2P networks (P2P-reconciler). Other important contributions are: a basic cost model for computing communication costs in a DHT overlay network; a strategy for computing the cost of each reconciliation step taking into account the cost model; and an algorithm that dynamically selects the best nodes for each reconciliation step. Furthermore, since P2P networks are built independently of the underlying topology, which may cause high latencies and large overheads degrading performance, we also propose a topology-aware variant of our P2P-reconciler algorithm and show the important gains on using it. Our P2P-reconciler solution enables high levels of concurrency thanks to semantic reconciliation and yields high availability, excellent scalability, with acceptable performance and limited overhead.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aberer, K., Cudré-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-Grid: a self-organizing structured P2P system. ACM SIGMOD Rec. 32(3), 29–33 (2003)

    Article  Google Scholar 

  2. Akbarinia, R., Martins, V., Pacitti, E., Valduriez, P.: Global Data Management, 1st edn. IOS Press (2006) (Chapter: Design and implementation of Atlas P2P architecture)

  3. Akbarinia, R., Martins, V., Pacitti, E., Valduriez, P.: Top-k query processing in the APPA P2P system. In: Proc. of the Int. Conf. on High Performance Computing for Computational Science (VecPar), Rio de Janeiro, Brazil, July 2006

  4. Akbarinia, R., Pacitti, E., Valduriez, P.: Reducing network traffic in unstructured P2P systems using top-k queries. Distributed Parallel Databases 19(2–3), 67–86 (2006)

    Article  Google Scholar 

  5. Akbarinia, R., Pacitti, E., Valduriez, P.: Data currency in replicated DHTs. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, Beijing, China, June 2007, pp. 211–222

  6. Anwitaman, D., Hauswirth, M., Aberer, K.: Updates in highly unreliable, replicated peer-to-peer systems. In: Proc. of the IEEE Int. Conf. on Distributed Computing Systems (ICDCS), Washington, May 2003, pp. 76–85

  7. Brite: http://www.cs.bu.edu/brite/

  8. Castro, M., Jones, M.B., Kermarrec, A.-M., Rowstron, A., Theimer, M., Wang, H., Wolman, A.: An evaluation of scalable application-level multicast built using peer-to-peer overlays. In: Proc. of the Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), San Francisco, California, April 2003, pp. 1510–1520

  9. Chockler, G., Keidar, I., Vitenberg, R.: Group communication specifications: a comprehensive study. ACM Comput. Surv. 33(4), 427–469 (2001)

    Article  Google Scholar 

  10. Chong, Y.L., Hamadi, Y.: Distributed log-based reconciliation. In: Proc. of the European Conference on Artificial Intelligence (ECAI), Riva del Garda, Italy, September 2006, pp. 108–112

  11. Clarke, I., Miller, S., Hong, T.W., Sandberg, O., Wiley, B.: Protecting free expression online with Freenet. IEEE Internet Comput. 6(1), 40–49 (2002)

    Article  Google Scholar 

  12. El Dick, M., Martins, V., Pacitti, E.: A topology-aware approach for distributed data reconciliation in P2P networks. In: Proc. of the European Conf. on Parallel Computing (Euro-Par), Rennes, France, August 2007

  13. Grid5000 Project: http://www.grid5000.fr

  14. Howell, F., McNab, R.: SimJava: a discrete event simulation package for Java with applications in computer systems modeling. In: Proc. of the Int. Conf. on Web-based Modeling and Simulation, San Diego, California, January 1998

  15. Huebsch, R., Hellerstein, J., Lanham, N., Thau Loo, B., Shenker, S., Stoica, I.: Querying the Internet with PIER. In: Proc. of Int. Conf. on Very Large Databases (VLDB), Berlin, Germany, September 2003, pp. 321–332

  16. Kermarrec, A.-M., Rowstron, A., Shapiro, M., Druschel, P.: The IceCube approach to the reconciliation of diverging replicas. In: Proc. of the ACM Symp. on Principles of Distributed Computing (PODC), Newport, Rhode Island, August 2001, pp. 210–218

  17. Kleinbaum, D.G., Kupper, L.L., Muller, K.E., Nizam, A.: Applied Regression Analysis and Multi-variable Methods, 3rd edn. Duxbury Press (1998)

  18. Knezevic, P., Wombacher, A., Risse, T.: Enabling high data availability in a DHT. In: Proc. of the Int. Workshop on Grid and Peer-to-Peer Computing Impacts on Large Scale Heterogeneous Distributed Database Systems (GLOBE’05), Copenhagen, Denmark, August 2005, pp. 363–367

  19. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., 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 the ACM Int. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Cambridge, Massachusetts, November 2000, pp. 190–201

  20. Mandriva: http://club.mandriva.com/xwiki/

  21. Martins, V.: Data replication in P2P systems. Ph.D. thesis, University of Nantes, Nantes, France, May 2007. http://www.sciences.univ-nantes.fr/lina/gdd/members/vmartins/

  22. Martins, V., Akbarinia, R., Pacitti, E., Valduriez, P.: Reconciliation in the APPA P2P system. In: Proc. of the IEEE Int. Conf. on Parallel and Distributed Systems (ICPADS), Minneapolis, Minnesota, July 2006, pp. 401–410

  23. Martins, V., Pacitti, E.: Dynamic and distributed reconciliation in P2P-DHT networks. In: Proc. of the European Conf. on Parallel Computing (Euro-Par), Dresden, Germany, September 2006, pp. 337–349

  24. Martins, V., Pacitti, E., Jimenez-Peris, R., Valduriez, P.: Scalable and available reconciliation in P2P networks. In: Proc. of the Journées Bases de Données Avancées (BDA), Lille, France, October 2006

  25. Martins, V., Pacitti, E., Valduriez, P.: Distributed semantic reconciliation of replicated data. IEEE France and ACM SIGOPS France—Journées Francophones sur la Cohérence des Données en Univers Réparti (CDUR), Paris, France, November 2005

  26. Meteor: http://meteor.jxta.org/

  27. Preguiça, N., Shapiro, M., Matheson, C.: Efficient semantic-aware reconciliation for optimistic write sharing. Technical report MSR-TR-2002-52, Microsoft Research, Cambridge, UK, May 2002

  28. Preguiça, N., Shapiro, M., Matheson, C.: Semantics-based reconciliation for collaborative and mobile environments. In: Proc. of the Int. Conf. on Cooperative Information Systems (CoopIS), Catania, Italy, November 2003, pp. 38–55

  29. P2P network simulation: http://www.sciences.univ-nantes.fr/lina/gdd/members/vmartins/

  30. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. of the ACM SIGCOMM Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications, San Diego, California, August 2001, pp. 161–172

  31. Rowstron, A., Druschel, P.: Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. of the IFIP/ACM Int. Conf. on Distributed Systems Platforms (Middleware), Heidelberg, Germany, November 2001, pp. 329–350

  32. Saito, Y., Shapiro, M.: Optimistic replication. ACM Comput. Surv. 37(1), 42–81 (2005)

    Article  Google Scholar 

  33. Shapiro, M., Bhargavan, K., Krishna, N.: A constraint-based formalism for consistency in replicated systems. In: Proc. of the Int. Conf. on Principles of Distributed Systems (OPODIS), Grenoble, France, December 2004

  34. Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for Internet applications. In: Proc. of the ACM SIGCOMM Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications, San Diego, California, August 2001, pp. 149–160

  35. Vidot, N., Cart, M., Ferrie, J., Suleiman, M.: Copies convergence in a distributed real-time collaborative environment. In: Proc. of the ACM Int. Conf. on Computer Supported Cooperative Work (CSCW), Philadelphia, Pennsylvania, December 2000, pp. 171–180

  36. Whittaker, S., Issacs, E., O’Day, V.: Widening the net: workshop report on the theory and practice of physical and network communities. ACM SIGCHI Bull. 29(3), 27–30 (1997)

    Article  Google Scholar 

  37. Wikipedia: http://wikipedia.org/

  38. Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: a resilient global-scale overlay for service deployment. IEEE J. Sel. Areas Commun. 22(1), 41–53 (2004)

    Article  Google Scholar 

  39. Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: an infrastructure for fault-tolerant wide-area location and routing. Technical report CSD-010-1141, University of California, Berkeley, California (2001)

Download references

Author information

Authors and Affiliations

  1. PPGIA/PUCPR, Pontifical Catholic University of Paraná, Rua Imaculada Conceição, 1155, Prado Velho, 80.215-901, Curitiba, Paraná, Brazil

    Vidal Martins

  2. ATLAS Team, INRIA and LINA, University of Nantes, 2, rue de la Houssinière, BP92208, 44322, Nantes Cedex 3, France

    Esther Pacitti & Manal El Dick

  3. Distributed Systems Lab, Facultad Informatica, Universidad Politécnica de Madrid, Campus de Montegancedo s/n, Boadilla del Monte, Madrid, 28660, Spain

    Ricardo Jimenez-Peris

Authors
  1. Vidal Martins
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Esther Pacitti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manal El Dick
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ricardo Jimenez-Peris
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vidal Martins.

Additional information

Recommended by Ahmed K. Elmagarmid.

Work partially funded by the ARA “Massive Data” of the French ministry of research (project Respire), the European Strep Grid4All project, the CAPES-COFECUB Daad project and the CNPq-INRIA Gridata project.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martins, V., Pacitti, E., El Dick, M. et al. Scalable and topology-aware reconciliation on P2P networks. Distrib Parallel Databases 24, 1–43 (2008). https://doi.org/10.1007/s10619-008-7029-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10619-008-7029-0

Keywords

Search

Navigation