skip to main content
10.1145/1376916.1376956acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Near-optimal dynamic replication in unstructured peer-to-peer networks

Authors Info & Claims
Published:09 June 2008Publication History

ABSTRACT

Replicating data in distributed systems is often needed for availability and performance. In unstructured peer-to-peer networks, with epidemic messaging for query routing, replicating popular data items is also crucial to ensure high probability of finding the data within a bounded search distance from the requestor. This paper considers such networks and aims to maximize the probability of successful search. Prior work along these lines has analyzed the optimal degrees of replication for data items with non-uniform but global request rates, but did not address the issue of where replicas should be placed and was very very limited in the capabilities for handling heterogeneity and dynamics of network and workload.

This paper presents the integrated P2R2 algorithm for dynamic replication that addresses all these issues, and determines both the degrees of replication and the placement of the replicas in a provably near-optimal way. We prove that the P2R2 algorithm can guarantee a successful-search probability that is within a factor of 2 of the optimal solution. The algorithm is efficient and can handle workload evolution. We prove that, whenever the access patterns are in steady state, our algorithm converges to the desired near-optimal placement. We further show by simulations that the convergence rate is fast and that our algorithm outperforms prior methods.

References

  1. I. D. Baev and R. Rajaraman. Approximation algorithms for data placement in arbitrary networks. In SODA, pages 661--670, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. Bhagwan, K. Tati, Y.-C. Cheng, S. Savage, and G. M. Voelker. Total recall: System support for automated availability management. In NSDI, pages 337--350, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Chekuri and S. Khanna. A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput., 35(3):713--728, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Chekuri and A. Kumar. Maximum coverage problem with group budget constraints and applications. In APPROX-RANDOM, pages 72--83, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  5. B.-G. Chun, F. Dabek, A. Haeberlen, E. Sit, H. Weatherspoon, F. Kaashoek, J. Kubiatowicz, and R. Morris. Efficient replica maintenance for distributed storage systems. In Proceedings of the 3rd USENIX Symposium on Networked Systems Design and Implementation (NSDI '06), San Jose, CA, May 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. In SIGCOMM, pages 177--190, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. F. Dabek, J. Li, E. Sit, J. Robertson, M. F. Kaashoek, and R. Morris. Designing a dht for low latency and high throughput. In NSDI, pages 85--98, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. T. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulié. Epidemic information dissemination in distributed systems. IEEE Computer, 37(5):60--67, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan. The pairing heap: A new form of self-adjusting heap. Algorithmica, 1(1):111--129, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks: Algorithms and evaluation. Perform. Eval., 63(3):241--263, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S. Guha and K. Munagala. Improved algorithms for the data placement problem. In SODA, pages 106--107, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. S. Khuller, A. Moss, and J. Naor. The budgeted maximum coverage problem. Inf. Process. Lett., 70(1):39--45, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. E. L. Lawler. Fast approximation algorithms for knapsack problems. Math. Oper. Res., 4(4):339--356, 1979.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. B. Leong, B. Liskov, and E. D. Demaine. Epichord: Parallelizing the chord lookup algorithm with reactive routing state management. Computer Communications, 29(9):1243--1259, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. E. Leontiadis, V. V. Dimakopoulos, and E. Pitoura. Creating and maintaining replicas in unstructured peer-to-peer systems. In Euro-Par, pages 1015--1025, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In ICS, pages 84--95, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. R. Morselli, B. Bhattacharjee, A. Srinivasan, and M. A. Marsh. Efficient lookup on unstructured topologies. In PODC, pages 77--86, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. R. Nelson. Probability, Stocastic Processes, and Queuing Theory - The Mathematics of Computer Performance Modeling. Springer, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. L. T. Nguyen, W. G. Yee, D. Jia, and O. Frieder. A tool for information retrieval research in peer-to-peer file sharing systems. http://ir.iit.edu/~waigen/proj/pirs/irwire/. In ICDE, pages 1525--1526, 2007.Google ScholarGoogle Scholar
  20. V. Ramasubramanian and E. G. Sirer. Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays. In NSDI, pages 99--112, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Y. Saito and M. Shapiro. Optimistic replication. ACM Comput. Surv., 37(1):42--81, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. D. B. Shmoys, C. Swamy, and R. Levi. Facility location with service installation costs. In SODA, pages 1088--1097, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. D. B. Shmoys and É. Tardos. An approximation algorithm for the generalized assignment problem. Math. Program., 62:461--474, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. R. Steinmetz and K. Wehrle, editors. Peer-to-Peer Systems and Applications, volume 3485 of Lecture Notes in Computer Science. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. J. Winick and S. Jamin. Inet-3.0: Internet topology generator. http://topology.eecs.umich.edu/inet/. Technical Report UM-CSE-TR-456-02, EECS, University of Michigan, 2002.Google ScholarGoogle Scholar

Index Terms

  1. Near-optimal dynamic replication in unstructured peer-to-peer networks

        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
        • Published in

          cover image ACM Conferences
          PODS '08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
          June 2008
          330 pages
          ISBN:9781605581521
          DOI:10.1145/1376916

          Copyright © 2008 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 9 June 2008

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate476of1,835submissions,26%

        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!