skip to main content
research-article

Choosing partners based on availability in P2P networks

Published:30 July 2012Publication History
Skip Abstract Section

Abstract

Availability of applications or devices is known to be one of the most critical variables impacting the performances of software systems. We study in this article the problem of finding peers matching a given availability pattern in a peer-to-peer (P2P) system. Motivated by practical examples, we specify two formal problems of availability matching that arise in real applications: disconnection matching, where peers look for partners expected to disconnect at the same time, and presence matching, where peers look for partners expected to be online simultaneously in the future. As a scalable and inexpensive solution, we propose to use epidemic protocols for topology management; we provide corresponding metrics for both matching problems. We evaluated this solution by simulating two P2P applications, task scheduling and file storage, over a new trace of the eDonkey network, the largest one with availability information. We first proved the existence of regularity patterns in the sessions of 14M peers over 27 days. We also showed that, using only 7 days of history, a simple predictor could select predictable peers and successfully predicted their online periods for the next week. Finally, simulations showed that our simple solution provided good partners fast enough to match the needs of both applications, and that consequently, these applications performed as efficiently at a much lower cost. This solution is purely distributed as it does not rely on any central server or oracle to operate. We believe that this work will be useful for many P2P applications for which it has been shown that choosing good partners, based on their availability, drastically improves their performance and stability.

References

  1. Bhagwan, R., Savage, S., and Voelker, G. 2003. Understanding availability. In Proceedings of the International Conference on Peer-to-Peer Systems (IPTPS'03).Google ScholarGoogle Scholar
  2. Bhagwan, R., Tati, K., Cheng, Y.-C., Savage, S., and Voelker, G. M. 2004. Total recall: System support for automated availability management. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI'04). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Busca, J.-M., Picconi, F., and Sens, P. 2005. Pastis: A highly-scalable multi-user peer-to-peer file system. In Proceedings of the International European Conference on Parallel Processing (Euro-Par05). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Chun, B.-G., Dabek, F., Haeberlen, A., Sit, E., Weatherspoon, H., Kaashoek, F., Kubiatowicz, J., and Morris, R. 2006. Efficient replica maintenance for distributed storage systems. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI'06). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Cox, L. P., Murray, C. D., and Noble, B. D. 2002. Pastiche: Making backup cheap and easy. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI'02). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., and Stoica, I. 2001. Wide-Area cooperative storage with cfs. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP'01). Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Drost, N., van Nieuwpoort, R. V., and Bal, H. E. 2006. Simple locality-aware co-allocation in peer-to-peer supercomputing. In Proceedings of the Global and P2P Computing Workshop (GP2P'06). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Duminuco, A. and Biersack, E. 2009. A practical study of regenerating codes for peer-to-peer backup systems. In Proceedings of the International Conference on Distributed Computing Systems (ICDCS'09). Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Duminuco, A., Biersack, E. W., and En Najjary, T. 2007. Proactive replication in distributed storage systems using machine availability estimation. In Proceedings of the ACM Conference on Emerging Network Experiment and Technology (CoNEXT'07). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Godfrey, P. B. Shenker, S., and Stoica, I. 2006. Minimizing churn in distributed systems. In Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Guha, S., Daswani, N., and Jain, R. 2006. An experimental study of the Skype peer-to-peer voIP system. In Proceedings of the International Conference on Peer-to-Peer Systems (IPTPS'06).Google ScholarGoogle Scholar
  12. Handurukande, S. B., Kermarrec, A.-M., Le Fessant, F., Massoulie, L., and Patarin, S. 2006. Peer sharing behaviour in the edonkey network, and implications for the design of server-less file sharing systems. In Proceedings of the European Conference on Computer Systems (EuroSys'06). Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Jelasity, M. and Babaoglu, O. 2005. T-man: Gossip-Based overlay topology management. In Proceedings of the International Workshop on Engineering Self-Organizing Systems (ESOA'05). Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Jelasity, M. and Kermarrec, A.-M. 2006. Ordered slicing of very large-scale overlay networks. In Proceedings of the International Conference on Peer-to-Peer Computing (P2P'06). Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Jelasity, M., Montresor, A., and Babaoglu, O. 2009. T-man: Gossip-Based fast overlay topology construction. Comput. Netw. 53, 13, 2321--2339. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Kermarrec, A.-M., Le Merrer, E., Liu, Y., and Simon, G. 2009. Surfing peer-to-peer iptv: Distributed channel switching. In Proceedings of the International European Conference on Parallel Processing (Euro-Par'09). Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Killijian, M.-O., Courtes, L., and Powell, D. 2006. A survey of cooperative backup mechanisms. Tech. rep. 06472, LAAS.Google ScholarGoogle Scholar
  18. Kim, K. 2008. Lifetime-Aware replication for data durability in p2p storage network. IEICE Trans. 91B, 12, 4020--4023.Google ScholarGoogle ScholarCross RefCross Ref
  19. Kondo, D., Andrzejak, A., and Anderson, D. P. 2008. On correlated availability in Internet-distributed systems. In Proceedings of the IEEE/ACM International Conference on Grid Computing (GRID'08). Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Le Blond, S., Le Fessant, F., and Le Merrer, E. 2009. Finding good partners in availability-aware p2p networks. In Proceedings of the International Symposium on Stabilization, Security and Safety of Distributed Systems (SSS'09). Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Le Fessant, F., Sengul, C., and Kermarrec, A.-M. 2008. Pacemaker: Fighting selfishness in availability-aware large-scale networks. Tech. rep. RR-6594, INRIA.Google ScholarGoogle Scholar
  22. Mickens, J. W. and Noble, B. D. 2006. Exploiting availability prediction in distributed systems. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI'06). Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Morales, R. and Gupta, I. 2007. AVMON: Optimal and scalable discovery of consistent availability monitoring overlays for distributed systems. In Proceedings of the International Conference on Distributed Computing Systems (ICDCS'07). Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Pamies-Juarez, L., Garcia-Lopez, P., and Sanchez-Artigas, M. 2008. Rewarding stability in peer-to-peer backup systems. In Proceedings of the IEEE International Conference on Networks (ICON'08).Google ScholarGoogle Scholar
  25. Repository. 2010. Trace. http://socialstorage.gforge.inria.fr/.Google ScholarGoogle Scholar
  26. Sacha, J., Dowling, J., Cunningham, R., and Meier, R. 2006. Discovery of stable peers in a self-organising peer-to-peer gradient topology. In Proceedings of the International Conference on Distributed Applications and Interoperable Systems (DAIS'06). Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Saroiu, S., Gummadi, P. K., and Gribble, S. 2002. A measurement study of peer-to-peer file sharing systems. In Proceedings of the Conference on Multimedia Computing and Networking (MMCN'02).Google ScholarGoogle Scholar
  28. Stutzbach, D. and Rejaie, R. 2006. Understanding churn in peer-to-peer networks. In Proceedings of the Internet Measurement Conference (IMC'06). Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Voulgaris, S., Gavidia, D., and van Steen, M. 2005. CYCLON: Inexpensive membership management for unstructured p2p overlays. J. Netw. Syst. Manag. 13, 2.Google ScholarGoogle ScholarCross RefCross Ref
  30. Voulgaris, S., van Steen, M., and Iwanicki, K. 2007. Proactive gossip-based management of semantic overlay networks: Research articles. Concurr. Comput. Pract. Exper. 19, 17, 2299--2311. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Xin, Q., Schwarz, T., and Miller, E. L. 2004. Availability in global peer-to-peer storage systems. In Proceedings of the International Workshop on Distributed Data and Structures (WDAS'04).Google ScholarGoogle Scholar

Index Terms

  1. Choosing partners based on availability in P2P 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

              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 August 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!