Advertisement

A Topology-Aware Approach for Distributed Data Reconciliation in P2P Networks

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

Abstract

A growing number of collaborative applications are being built on top of Peer-to-Peer (P2P) networks which provide scalability and support dynamic behavior. However, the distributed algorithms used by these applications typically introduce multiple communications and interactions between nodes. This is because P2P networks are constructed independently of the underlying topology, which may cause high latencies and communication overheads. In this paper, we propose a topology-aware approach that exploits physical topology information to perform P2P distributed data reconciliation, a major function for collaborative applications. Our solution (P2P-Reconciler-TA) relies on dynamically selecting nodes to execute specific steps of the algorithm, while carefully placing relevant data. We show that P2P-Reconciler-TA introduces a gain of 50% compared to P2P-Reconciler and still scales up.

Keywords

Distribute Hash Table Provider Selection Good Neighbor Good Provider Collaborative Application 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kermarrec, A.M., Rowstron, A., Shapiro, M., Druschel, P.: The IceCube approach to the reconciliation of diverging replicas. In: Proc. of ACM PODC, ACM Press, New York (2001)Google Scholar
  2. 2.
    Krishnamurthy, B., Wang, J., Xie, Y.: Early measurements of a cluster-based architecture for P2P systems. In: Proc of ACM SIGCOMM (2001)Google Scholar
  3. 3.
    Liu, Y., Xiao, L., Liu, X., Ni, L.M., Zhang, X.: Location awareness in unstructured P2P pystems. IEEE Trans. Parallel Distrib. Syst. 16(2) (2005)Google Scholar
  4. 4.
    Martins, V., Pacitti, E.: Dynamic and distributed reconciliation in P2P-DHT networks. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par 2006. LNCS, vol. 4128, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
  6. 6.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. of ACM SIGCOMM (2001)Google Scholar
  7. 7.
    Ratnasamy, S., Handley, M., Karp, R.M., Shenker, S.: Topologically-aware overlay construction and server selection. In: Proc. of IEEE INFOCOM (2002)Google Scholar
  8. 8.
    Rowstron, A., Druschel, P.: Pastry: scalable, distributed object location and routing for large-scale P2P systems. In: Proc. of IFIP/ACM Middleware, ACM Press, New York (2001)Google Scholar
  9. 9.
    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 Journal on Selected Areas in Communications (JSAC) 22(1) (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Manal El Dick
    • 1
  • Vidal Martins
    • 1
    • 2
  • Esther Pacitti
    • 1
  1. 1.ATLAS Group, INRIA and LINA, University of NantesFrance
  2. 2.PPGIA/PUCPR - Pontifical Catholic University of ParanáBrazil

Personalised recommendations