skip to main content
research-article

RelaxDHT: A churn-resilient replication strategy for peer-to-peer distributed hash-tables

Published:30 July 2012Publication History
Skip Abstract Section

Abstract

DHT-based P2P systems provide a fault-tolerant and scalable means to store data blocks in a fully distributed way. Unfortunately, recent studies have shown that if connection/disconnection frequency is too high, data blocks may be lost. This is true for most of the current DHT-based systems' implementations. To deal with this problem, it is necessary to build more efficient replication and maintenance mechanisms. In this article, we study the effect of churn on PAST, an existing DHT-based P2P system. We then propose solutions to enhance churn tolerance and evaluate them through discrete event simulation.

References

  1. Adya, A., Bolosky, W., Castro, M., Chaiken, R., Cermak, G., Douceur, J., Howell, J., Lorch, J., Theimer, M., and Wattenhofer, R. 2002. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI '02). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Broder, A., Mitzenmacher, M., and Mitzenmacher, A. B. I. M. 2002. Network applications of bloom filters: A survey. In Internet Mathematics. 636--646.Google ScholarGoogle Scholar
  3. Busca, J.-M., Picconi, F., and Sens, P. 2005. Pastis: A highly-scalable multi-user peer-to-peer file system. In Proceedings of European Conference on Parallel Computing (Euro-Par '05). 1173--1182. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Castro, M., Costa, M., and Rowstron, A. 2004. Performance and dependability of structured peer-to-peer overlays. In (DSN '04) Proceedings of the International Conference on Dependable Systems and Network. IEEE Computer Society, Washington, DC, 9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Chawathe, Y., Ramabhadran, S., Ratnasamy, S., LaMarca, A., Shenker, S., and Hellerstein, J. M. 2005. A case study in building layered dht applications. In Proceedings of the SIGCOMM Conference, R. Guérin, R. Govindan, and G. Minshall, Eds. ACM, 97--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Dabek, F., Kaashoek, F. M., Karger, D., Morris, R., and Stoica, I. 2001. Wide-area cooperative storage with CFS. In Proceedings of the 8th ACM Symposium on Operating Systems Principles (SOSP '01). Vol. 35. ACM Press, New York, 202--215. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, F. F., and Morris, R. 2004. Designing a DHT for low latency and high throughput. In Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI '04). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Ghemawat, S., Gobioff, H., and Leung, S.-T. 2003. The google file system. In (SOSP '03) Proceedings of the 9th ACM Symposium on Operating Systems Principles. ACM Press, New York, 29--43. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Ghodsi, A., Alima, L. O., and Haridi, S. 2005. Symmetric replication for structured peer-to-peer systems. In Proceedings of the 3rd International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P '05), 12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Gupta, A., Agrawal, D., and Abbadi, A. E. 2003. Approximate range selection queries in peer-to-peer systems. In Proceedings of the CIDR Conference on Innovative Data Systems Research.Google ScholarGoogle Scholar
  11. Jelasity, M., Montresor, A., Jesi, G. P., and Voulgaris, S. 2008. The Peersim simulator. http://peersim.sf.net.Google ScholarGoogle Scholar
  12. Jernberg, J., Vlassov, V., Ghodsi, A., and Haridi, S. 2006. Doh: A content delivery peer-to-peer network. In Proceedings of European Conference on Parallel Computing (Euro-Par '06) 13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Kim, K. and Park, D. 2006. Reducing data replication overhead in DHT based peer-to-peer system. In Proceedings of the 2nd International Conference on High Performance Computing and Communications (HPCC '06). 915--924. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Ktari, S., Zoubert, M., Hecker, A., and Labiod, H. 2007. Performance evaluation of replication strategies in DHTs under churn. In Proceedings of the 6th International Conference on Mobile and Ubiquitous Multimedia (MUM '07). ACM Press, New York, 90--97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Landers, M., Zhang, H., and Tan, K.-L. 2004. Peerstore: Better performance by relaxing in peer-to-peer backup. In Proceedings of the 4th International Conference on Peer-to-Peer Computing (P2P '04). IEEE Computer Society, Washington, DC, 72--79. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Legtchenko, S., Monnet, S., Sens, P., and Muller, G. 2009. Churn-Resilient replication strategy for peer-to-peer distributed hash-tables. In Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'09). Lecture Notes in Computer Science, vol. 5873. Springer 485--499. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Lian, Q., Chen, W., and Zhang, Z. 2005. On the impact of replica placement to the reliability of distributed brick storage systems. In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS '05). IEEE Computer Society, Washington, DC, 187--196. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Madhyastha, H. V., Anderson, T. E., Krishnamurthy, A., Spring, N., and Venkataramani, A. 2006. A structural approach to latency prediction. In Internet Measurement Conference, J. M. Almeida, V. A. F. Almeida, and P. Barford, Eds. ACM, 99--104. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Maymounkov, P. and Mazieres, D. 2002. Kademlia: A peer-to-peer information system based on the xor metric. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02). 53--65. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Schenker, S. 2001. A scalable content-addressable network. In Proceedings of the SIGCOMM Conference. Vol. 31. ACM Press, 161--172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Rhea, S., Geels, D., Roscoe, T., and Kubiatowicz, J. 2004. Handling churn in a DHT. In Proceedings of the USENIX Technical Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Rodrigues, R. and Blake, C. 2004. When multi-hop peer-to-peer lookup matters. In Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS '04). 112--122. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Rowstron, A. and Druschel, P. 2001a. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Lecture Notes in Computer Science, vol. 2218. Springer, 329--350. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Rowstron, A. I. T. and Druschel, P. 2001b. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 8th ACM Symposium on Operating Systems Principles (SOSP '01). 188--201. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Schmidt, C. and Parashar, M. 2004. Enabling flexible queries with guarantees in p2p systems. IEEE Internet Comput. 8, 3, 19--26. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, F. F., Dabek, F., and Balakrishnan, H. 2003. Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11, 1, 17--32. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. van Renesse, R. 2004. Efficient reliable internet storage. In Proceedings of the 2nd Workshop on Dependable Distributed Data Management (WDDDM '04).Google ScholarGoogle Scholar
  28. Varvello, M., Diout, C., and Biersack, E. W. 2009. P2p second life: Experimental validation using kad. In Proceedings of the INFOCOM Conference. IEEE, 1161--1169.Google ScholarGoogle Scholar
  29. Zahn, T. and Schiller, J. H. 2006. Dht-based unicast for mobile ad hoc networks. In Proceedings of the PerCom Workshops. IEEE Computer Society, 179--183. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., and Kubiatowicz, J. D. 2003. Tapestry: A global-scale overlay for rapid service deployment. IEEE J. Select. Areas Comm. 22, 41--53. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., and Kubiatowicz, J. D. 2004. Tapestry: A resilient global-scale overlay for service deployment. IEEE J. Select. Areas Comm. 22, 41--53. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Ziv, J. and Lempel, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. Info. Theory 23, 337--343. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. ZZZ-gzip. 2012. Gzip. http://www.gzip.org/.Google ScholarGoogle Scholar

Index Terms

  1. RelaxDHT: A churn-resilient replication strategy for peer-to-peer distributed hash-tables

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image ACM Transactions on Autonomous and Adaptive Systems
              ACM Transactions on Autonomous and Adaptive Systems  Volume 7, Issue 2
              July 2012
              275 pages
              ISSN:1556-4665
              EISSN:1556-4703
              DOI:10.1145/2240166
              Issue’s Table of Contents

              Copyright © 2012 ACM

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 30 July 2012
              • Accepted: 1 November 2010
              • Revised: 1 October 2010
              • Received: 1 February 2010
              Published in taas Volume 7, Issue 2

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article
              • Research
              • Refereed

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader
            About Cookies On This Site

            We use cookies to ensure that we give you the best experience on our website.

            Learn more

            Got it!