skip to main content
article

Can ISPS and P2P users cooperate for improved performance?

Published:20 July 2007Publication History
Skip Abstract Section

Abstract

Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet routing architecture, contribute a significant portion of today's Internet traffic. While the P2P users are a good source of revenue for the Internet Service Providers (ISPs), the immense P2P traffic also poses a significant traffic engineering challenge to the ISPs. This is because P2P systems either implement their own routing in the overlay topology or may use a P2P routing underlay [1], both of which are largely independent of the Internet routing, and thus impedes the ISP's traffic engineering capabilities. On the other hand, P2P users are primarily interested in finding their desired content quickly, with good performance. But as the P2P system has no access to the underlying network, it either has to measure the path performance itself or build its overlay topology agnostic of the underlay. This situation is disadvantageous for both the ISPs and the P2P users.

To overcome this, we propose and evaluate the feasibility of a solution where the ISP offers an "oracle" to the P2P users. When the P2P user supplies the oracle with a list of possible P2P neighbors, the oracle ranks them according to certain criteria, like their proximity to the user or higher bandwidth links. This can be used by the P2P user to choose appropriate neighbors, and therefore improve its performance. The ISP can use this mechanism to better manage the immense P2P traffic, e.g., to keep it inside its network, or to direct it along a desired path. The improved network utilization will also enable the ISP to provide better service to its customers.

References

  1. A. Nakao, L. Peterson, and A. Bavier, "A Routing Underlay for Overlay Networks," in SIGCOMM, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. "Slyck," http://www.slyck.com/.Google ScholarGoogle Scholar
  3. T. Karagiannis, A. Broido, N. Brownlee, kc claffy, and M. Faloutsos, "Is P2P dying or just hiding?," in GLOBECOM, 2004.Google ScholarGoogle Scholar
  4. Light Reading, "Controlling P2P Traffic," http://www.lightreading.com/document.asp?site=lightreading&doc_id=44435&page_number=3.Google ScholarGoogle Scholar
  5. R. Steinmetz and K. Wehrle, P2P Systems and Applications, Springer Lecture Notes in CS, 2005.Google ScholarGoogle Scholar
  6. T. Mennecke, "DSL Broadband Providers Perform Balancing Act," http://www.slyck.com/news.php?story=973.Google ScholarGoogle Scholar
  7. R. Keralapura, N. Taft, C. Chuah, and G. Iannaccone, "Can ISPs Take the Heat from Overlay Networks?," in HotNets, 2004.Google ScholarGoogle Scholar
  8. G. Shen, Y. Wang, Y. Xiong, B. Zhao, and Z. Zhang, "HPTP: Relieving the Tension between ISPs and P2P," in IPTPS, 2007.Google ScholarGoogle Scholar
  9. V. Aggarwal, S. Bender, A. Feldmann, and A. Wichmann, "Methodology for Estimating Network Distances of Gnutella Neighbors," in GI Jahrestagung - Informatik 2004, 2004.Google ScholarGoogle Scholar
  10. T. Karagiannis, P. Rodriguez, and K. Papagiannaki, "Should ISPs fear Peer-Assisted Content Distribution?," in IMC, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Akella, S. Seshan, and A. Shaikh, "An Empirical Evaluation of Wide-Area Internet Bottlenecks," in ACM IMC, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Rasti, D. Stutzbach, and R. Rejaie, "On the Long-term Evolution of the Two-Tier Gnutella Overlay," in Global Internet, 2006.Google ScholarGoogle Scholar
  13. S. Halabi, Internet Routing Architectures, Cisco Press, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Andersen, H. Balakrishnan, M. Kaashoek, and R. Morris, "Resilient Overlay Networks," in SOSP, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. "Gnutella v0.6 RFC," http://www.the-gdf.org/.Google ScholarGoogle Scholar
  16. S. Savage, A. Collins, and E. Hoffman, "The End-to-End Effects of Internet Path Selection," in SIGCOMM, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. S. Seetharaman and M. Ammar, "On the Interaction between Dynamic Routing in the Native and Overlay Layers," in INFOCOM, 2006.Google ScholarGoogle Scholar
  18. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologically aware overlay construction and server selection," in INFOCOM, 2002.Google ScholarGoogle Scholar
  19. K. Shanahan and M. Freedman, "Locality Prediction for Oblivious Clients," in IPTPS, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. Adler, R. Kumar, K. Ross, D. Rubenstein, T. Suel, and D. Yao, "Optimal Selection of Peers for P2P Downloading and Streaming," in INFOCOM, 2005.Google ScholarGoogle Scholar
  21. Bindal et. al., "Improving Traffic Locality in BitTorrent via Biased Neighbor Selection," in IEEE ICDCS, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. B. Zhao, Y. Duan, L. Huang, A. Joseph, and J. Kubiatowicz, "Brocade: Landmark Routing on Overlay Networks," in IPTPS, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP Topologies with Rocketfuel," in SIGCOMM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. "pWhoIs," http://pwhois.org.Google ScholarGoogle Scholar
  25. "Cymru Whois," http://www.cymru.com/BGP/asnlookup.html.Google ScholarGoogle Scholar
  26. M. Naor and U. Wieder, "Novel architectures for P2P applications: the continuous-discrete approach," in SPAA, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. G. Plaxton, R. Rajaraman, and A. Richa, "Accessing nearby copies of replicated objects in a distributed environment," in SPAA, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. I. Abraham, D. Malkhi, and O. Dobzinski, "LAND: stretch (1 + e) locality-aware networks for DHTs," in SODA, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. S. Arora, S. Rao, and U. Vazirani, "Expander flows, geometric embeddings and graph partitioning," in STOC, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. P. Kolman and C. Scheideler, "Improved bounds for the unsplittable flow problem," in SODA, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. W. Muehlbauer, A. Feldmann, O. Maennel, M. Roughan, and S. Uhlig, "Building an AS-Topology Model that Captures Route Diversity," in SIGCOMM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat, "Systematic Topology Analysis and Generation Using Degree Correlations," in SIGCOMM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. L. Li, D. Alderson, W. Willinger, and J. Doyle, "A First-Principles Approach to Understanding the Internet's Router-level Topology," in SIGCOMM, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. H. Chang, S. Jamin, Z. Mao, and W. Willinger, "An Empirical Approach to Modeling Inter-AS Traffic Matrices," in IMC, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. C. Scheideler, "Towards a paradigm for robust distributed algorithms and data structures," in HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.Google ScholarGoogle Scholar
  36. "SSFNet," http://www.ssfnet.org.Google ScholarGoogle Scholar
  37. D. Stutzbach, R. Rejaie, and S. Sen, "Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems," in ACM IMC, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. A. Gish, Y. Shavitt, and T. Tankel, "Geographical Statistics and Characteristics of P2P Query Strings," in IPTPS, 2007.Google ScholarGoogle Scholar
  39. D. Stutzbach and R. Rejaie, "Understanding Churn in P2P Networks," in IMC, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. V. Aggarwal, A. Feldmann, and S. Mohrs, "Implementation of a P2P system within a network simulation framework," in ECCS P2P-Complex Workshop, 2005.Google ScholarGoogle Scholar
  41. R. Tashev, "Experimenting with Neighbour Discovery Schemes for P2P Networks in a Simulation Framework," in Master thesis, Dept of CS, TU Munich, 2006.Google ScholarGoogle Scholar
  42. "Gnutella Hostcache," http://www.the-gdf.org/index.php?title=The_Local_Hostcache.Google ScholarGoogle Scholar
  43. P. Linga, I. Gupta, and K. Birman, "A Churn-Resistant P2P Web Caching System," in SSRS, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. "yWorks," http://www.yworks.com/.Google ScholarGoogle Scholar
  45. "GTK-Gnutella," http://www.gtk-gnutella.com/.Google ScholarGoogle Scholar

Index Terms

  1. Can ISPS and P2P users cooperate for improved performance?

        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

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader