Can ISPS and P2P users cooperate for improved performance?

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: Akihiro Nakao , Larry Peterson , Andy Bavier, A routing underlay for overlay networks, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, August 25-29, 2003, Karlsruhe, Germany [doi>10.1145/863955.863958]
• 2: "Slyck," http://www.slyck.com/.
• 3: T. Karagiannis, A. Broido, N. Brownlee, kc claffy, and M. Faloutsos, "Is P2P dying or just hiding?," in GLOBECOM, 2004.
• 4: Light Reading, "Controlling P2P Traffic," http://www.lightreading.com/document.asp?site=lightreading&doc_id=44435&page_number=3.
• 5: R. Steinmetz and K. Wehrle, P2P Systems and Applications, Springer Lecture Notes in CS, 2005.
• 6: T. Mennecke, "DSL Broadband Providers Perform Balancing Act," http://www.slyck.com/news.php?story=973.
• 7: R. Keralapura, N. Taft, C. Chuah, and G. Iannaccone, "Can ISPs Take the Heat from Overlay Networks?," in HotNets, 2004.
• 8: G. Shen, Y. Wang, Y. Xiong, B. Zhao, and Z. Zhang, "HPTP: Relieving the Tension between ISPs and P2P," in IPTPS, 2007.
• 9: V. Aggarwal, S. Bender, A. Feldmann, and A. Wichmann, "Methodology for Estimating Network Distances of Gnutella Neighbors," in GI Jahrestagung - Informatik 2004, 2004.
• 10: Thomas Karagiannis , Pablo Rodriguez , Konstantina Papagiannaki, Should internet service providers fear peer-assisted content distribution?, Proceedings of the Internet Measurement Conference 2005 on Internet Measurement Conference, p.6-6, October 19-21, 2005, Berkeley, CA
• 11: Aditya Akella , Srinivasan Seshan , Anees Shaikh, An empirical evaluation of wide-area internet bottlenecks, Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, October 27-29, 2003, Miami Beach, FL, USA [doi>10.1145/948205.948219]
• 12: A. Rasti, D. Stutzbach, and R. Rejaie, "On the Long-term Evolution of the Two-Tier Gnutella Overlay," in Global Internet, 2006.
• 13: Sam Halabi , Danny McPherson, Internet Routing Architectures, Second Edition, Cisco Systems, 2000
• 14: David Andersen , Hari Balakrishnan , Frans Kaashoek , Robert Morris, Resilient overlay networks, Proceedings of the eighteenth ACM symposium on Operating systems principles, October 21-24, 2001, Banff, Alberta, Canada
• 15: "Gnutella v0.6 RFC," http://www.the-gdf.org/.
• 16: Stefan Savage , Andy Collins , Eric Hoffman , John Snell , Thomas Anderson, The end-to-end effects of Internet path selection, Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, p.289-299, August 30-September 03, 1999, Cambridge, Massachusetts, United States
• 17: S. Seetharaman and M. Ammar, "On the Interaction between Dynamic Routing in the Native and Overlay Layers," in INFOCOM, 2006.
• 18: S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologically aware overlay construction and server selection," in INFOCOM, 2002.
• 19: K. Shanahan and M. Freedman, "Locality Prediction for Oblivious Clients," in IPTPS, 2005.
• 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.
• 21: Ruchir Bindal , Pei Cao , William Chan , Jan Medved , George Suwala , Tony Bates , Amy Zhang, Improving Traffic Locality in BitTorrent via Biased Neighbor Selection, Proceedings of the 26th IEEE International Conference on Distributed Computing Systems, p.66, July 04-07, 2006 [doi>10.1109/ICDCS.2006.48]
• 22: Ben Y. Zhao , Yitao Duan , Ling Huang , Anthony D. Joseph , John Kubiatowicz, Brocade: Landmark Routing on Overlay Networks, Revised Papers from the First International Workshop on Peer-to-Peer Systems, p.34-44, March 07-08, 2002
• 23: Neil Spring , Ratul Mahajan , David Wetherall, Measuring ISP topologies with rocketfuel, Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, August 19-23, 2002, Pittsburgh, Pennsylvania, USA
• 24: "pWhoIs," http://pwhois.org.
• 25: "Cymru Whois," http://www.cymru.com/BGP/asnlookup.html.
• 26: Moni Naor , Udi Wieder, Novel architectures for P2P applications: the continuous-discrete approach, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, June 07-09, 2003, San Diego, California, USA [doi>10.1145/777412.777421]
• 27: C. Greg Plaxton , Rajmohan Rajaraman , Andréa W. Richa, Accessing nearby copies of replicated objects in a distributed environment, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.311-320, June 23-25, 1997, Newport, Rhode Island, United States [doi>10.1145/258492.258523]
• 28: Ittai Abraham , Dahlia Malkhi , Oren Dobzinski, LAND: stretch (1 + ε) locality-aware networks for DHTs, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, January 11-14, 2004, New Orleans, Louisiana
• 29: Sanjeev Arora , Satish Rao , Umesh Vazirani, Expander flows, geometric embeddings and graph partitioning, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, p.222-231, June 13-16, 2004, Chicago, IL, USA [doi>10.1145/1007352.1007355]
• 30: Petr Kolman , Christian Scheideler, Improved bounds for the unsplittable flow problem, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.184-193, January 06-08, 2002, San Francisco, California
• 31: Wolfgang Mühlbauer , Anja Feldmann , Olaf Maennel , Matthew Roughan , Steve Uhlig, Building an AS-topology model that captures route diversity, Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, September 11-15, 2006, Pisa, Italy
• 32: Priya Mahadevan , Dmitri Krioukov , Kevin Fall , Amin Vahdat, Systematic topology analysis and generation using degree correlations, Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, September 11-15, 2006, Pisa, Italy
• 33: Lun Li , David Alderson , Walter Willinger , John Doyle, A first-principles approach to understanding the internet's router-level topology, Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, August 30-September 03, 2004, Portland, Oregon, USA
• 34: Hyunseok Chang , Sugih Jamin , Z. Morley Mao , Walter Willinger, An empirical approach to modeling inter-AS traffic matrices, Proceedings of the Internet Measurement Conference 2005 on Internet Measurement Conference, p.12-12, October 19-21, 2005, Berkeley, CA
• 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.
• 36: "SSFNet," http://www.ssfnet.org.
• 37: Daniel Stutzbach , Reza Rejaie , Subhabrata Sen, Characterizing unstructured overlay topologies in modern P2P file-sharing systems, Proceedings of the Internet Measurement Conference 2005 on Internet Measurement Conference, p.5-5, October 19-21, 2005, Berkeley, CA
• 38: A. Gish, Y. Shavitt, and T. Tankel, "Geographical Statistics and Characteristics of P2P Query Strings," in IPTPS, 2007.
• 39: Daniel Stutzbach , Reza Rejaie, Understanding churn in peer-to-peer networks, Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, October 25-27, 2006, Rio de Janeriro, Brazil [doi>10.1145/1177080.1177105]
• 40: V. Aggarwal, A. Feldmann, and S. Mohrs, "Implementation of a P2P system within a network simulation framework," in ECCS P2P-Complex Workshop, 2005.
• 41: R. Tashev, "Experimenting with Neighbour Discovery Schemes for P2P Networks in a Simulation Framework," in Master thesis, Dept of CS, TU Munich, 2006.
• 42: "Gnutella Hostcache," http://www.the-gdf.org/index.php?title=The_Local_Hostcache.
• 43: Prakash Linga , Indranil Gupta , Ken Birman, A churn-resistant peer-to-peer web caching system, Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems: in association with 10th ACM Conference on Computer and Communications Security, p.1-10, October 31-31, 2003, Fairfax, VA [doi>10.1145/1036921.1036922]
• 44: "yWorks," http://www.yworks.com/.
• 45: "GTK-Gnutella," http://www.gtk-gnutella.com/.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.4 Distributed Systems

General Terms:
Design, Experimentation, Management, Performance

Keywords:
ISP, P2P, biased neighbor selection, cooperation, routing