Skip to main content

Part of the book series: Lecture Notes in Computer Science ((TLDKS,volume 6790))

  • 537 Accesses

Abstract

Distributed Hash Tables (DHTs) provide an efficient solution for data location and lookup in large-scale P2P systems. However, it is up to the applications to deal with the availability of the data they store in the DHT, e.g. via replication. To improve data availability, most DHT applications rely on data replication. However, efficient replication management is quite challenging, in particular because of concurrent and missed updates. In this paper, we propose a complete solution to data replication in DHTs. We propose a new service, called Continuous Timestamp based Replication Management (CTRM), which deals with the efficient storage, retrieval and updating of replicas in DHTs. In CTRM, the replicas are maintained by groups of peers which are determined dynamically using a hash function. To perform updates on replicas, we propose a new protocol that stamps the updates with timestamps that are generated in a distributed fashion using the dynamic groups. Timestamps are not only monotonically increasing but also continuous, i.e. without gap. The property of monotonically increasing allows applications to determine a total order on updates. The other property, i.e. continuity, enables applications to deal with missed updates. We evaluated the performance of our solution through simulation and experimentation. The results show its effectiveness for replication management in DHTs.

Work partially funded by the ANR DataRing projet.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akbarinia, R., Pacitti, E., Valduriez, P.: Data Currency in Replicated DHTs. In: ACM Int. Conf. on Management of Data (SIGMOD), pp. 211–222 (2007)

    Google Scholar 

  2. Akbarinia, R., Tlili, M., Pacitti, E., Valduriez, P., Lima, A.A.B.: Continuous timestamping for efficient replication management in dHTs. In: Hameurlain, A., Morvan, F., Tjoa, A.M. (eds.) Globe 2010. LNCS, vol. 6265, pp. 38–49. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Bromwich, T.J.I.: An Introduction to the Theory of Infinite Series, 3rd edn. Chelsea Pub. Co., New York (1991)

    MATH  Google Scholar 

  4. Cecchet, E., Candea, G., Ailamaki, A.: Middleware-based database replication: the gaps between theory and practice. In: ACM Int. Conf. on Management of Data (SIGMOD), pp. 739–752 (2008)

    Google Scholar 

  5. Chawathe, Y., Ramabhadran, S., Ratnasamy, S., LaMarca, A., Shenker, S., Hellerstein, J.M.: A case study in building layered DHT applications. In: ACM Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), pp. 97–108 (2005)

    Google Scholar 

  6. Clarke, I., Miller, S.G., Hong, T.W., Sandberg, O., Wiley, B.: Protecting Free Expression Online with Freenet. IEEE Internet Computing 6(1), 40–49 (2002)

    Article  Google Scholar 

  7. Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-Area Cooperative Storage with CFS. In: ACM Symp. on Operating Systems Principles, pp. 202–215 (2001)

    Google Scholar 

  8. Datta, A., Hauswirth, M., Aberer, K.: Updates in Highly Unreliable, Replicated Peer-to-Peer Systems. In: IEEE Int. Conf. on Distributed Computing Systems (ICDCS), pp. 76–87 (2003)

    Google Scholar 

  9. Gnutella, http://www.gnutelliums.com/

  10. Ktari, S., Zoubert, M., Hecker, A., Labiod, H.: Performance evaluation of replication strategies in DHTs under churn. In: Int. Conf. on Mobile and Ubiquitous Multimedia (MUM), pp. 90–97 (2007)

    Google Scholar 

  11. Kazaa, http://www.kazaa.com/

  12. Krikellas, K., Elnikety, S., Vagena, Z., Hodson, O.: Strongly consistent replication for a bargain. In: IEEE Int. Conf. on Data Engineering (ICDE), pp. 52–63 (2010)

    Google Scholar 

  13. Knezevic, P., Wombacher, A., Risse, T.: Enabling High Data Availability in a DHT. In: Proc. of Int. Workshop on Grid and P2P Computing Impacts on Large Scale Heterogeneous Distributed Database Systems, pp. 363–367 (2005)

    Google Scholar 

  14. Lin, Y., Kemme, B., Jiménez-Peris, R., Patiño-Martínez, M., Armendáriz-Iñigo, J.E.: Snapshot isolation and integrity constraints in replicated databases. ACM Transactions on Database Systems (TODS) 34(2) (2009)

    Google Scholar 

  15. Özsu, T., Valduriez, P.: Principles of Distributed Database Systems, 2nd edn. Prentice-Hall, Englewood Cliffs (1999)

    Google Scholar 

  16. PalChaudhuri, S., Saha, A.K., Johnson, D.B.: Adaptive Clock Synchronization in Sensor Networks. In: Int. Symp. on Information Processing in Sensor Networks, pp. 340–348 (2004)

    Google Scholar 

  17. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: ACM Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), pp. 161–172 (2001)

    Google Scholar 

  18. Rhea, S.C., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: USENIX Annual Technical Conf, pp. 127–140 (2004)

    Google Scholar 

  19. Rhea, S.C., Eaton, P., Geels, D., Weatherspoon, H., Zhao, B., Kubiatowicz, J.: Pond: the OceanStore Prototype. In: USENIX Conf. on File and Storage Technologies, pp. 1–14 (2003)

    Google Scholar 

  20. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Liu, H. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: ACM Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), pp. 149–160 (2001)

    Google Scholar 

  22. Tlili, M., Dedzoe, W.K., Pacitti, E., Valduriez, P., Akbarinia, R., Molli, P., Canals, G., Laurière, S.: P2P logging and timestamping for reconciliation. PVLDB 1(2), 1420–1423 (2008)

    Google Scholar 

  23. Xwiki Concerto Project, http://concerto.xwiki.com

  24. Wong, L., Arora, N.S., Gao, L., Hoang, T., Wu, J.: Oracle Streams: A High Performance Implementation for Near Real Time Asynchronous Replication. In: IEEE Int. Conf. on Data Engineering (ICDE), pp. 1363–1374 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Akbarinia, R., Tlili, M., Pacitti, E., Valduriez, P., Lima, A.A.B. (2011). Replication in DHTs Using Dynamic Groups. In: Hameurlain, A., Küng, J., Wagner, R. (eds) Transactions on Large-Scale Data- and Knowledge-Centered Systems III. Lecture Notes in Computer Science, vol 6790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23074-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23074-5_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23073-8

  • Online ISBN: 978-3-642-23074-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics