Can ISPS and P2P users cooperate for improved performance?

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.

[1]  Rakesh Kumar,et al.  Optimal peer selection for P2P downloading and streaming , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Indranil Gupta,et al.  A churn-resistant peer-to-peer web caching system , 2003, SSRS '03.

[3]  Mischa Schwartz,et al.  ACM SIGCOMM computer communication review , 2001, CCRV.

[4]  Daniel Stutzbach,et al.  Understanding churn in peer-to-peer networks , 2006, IMC '06.

[5]  Walter Willinger,et al.  An empirical approach to modeling inter-AS traffic matrices , 2005, IMC '05.

[6]  Ram Keralapura,et al.  Can ISPs Take the Heat from Overlay Networks ? , 2004 .

[7]  Michael J. Freedman,et al.  Locality Prediction for Oblivious Clients , 2005, IPTPS.

[8]  Mostafa H. Ammar,et al.  On the Interaction Between Dynamic Routing in Native and Overlay Layers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Bassam Halabi,et al.  Internet Routing Architectures , 1997 .

[10]  A. Feldmann,et al.  Implementation of a P 2 P system within a network simulation framework , .

[11]  William Chan,et al.  Improving Traffic Locality in BitTorrent via Biased Neighbor Selection , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[12]  Daniel Tabak.  Risc Systems and Applications , 1996 .

[13]  Michalis Faloutsos,et al.  Is P2P dying or just hiding? [P2P traffic measurement] , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[14]  Priya Mahadevan,et al.  Systematic topology analysis and generation using degree correlations , 2006, SIGCOMM.

[15]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[16]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[17]  Danny McPherson,et al.  Internet Routing Architectures, Second Edition , 2000 .

[18]  Walter Willinger,et al.  A first-principles approach to understanding the internet's router-level topology , 2004, SIGCOMM '04.

[19]  Don Towsley,et al.  On the Interaction Between Overlay Routing and Traffic Engineering , 2004 .

[20]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[21]  Ben Y. Zhao,et al.  Brocade: Landmark Routing on Overlay Networks , 2002, IPTPS.

[22]  Yuval Shavitt,et al.  Geographical Statistics and Characteristics of P2P Query Strings , 2007, IPTPS.

[23]  David Watson,et al.  Topology aware overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[24]  Anja Feldmann,et al.  Methodology for Estimating Network Distances of Gnutella Neighbors , 2004, GI Jahrestagung.

[25]  Daniel Stutzbach,et al.  Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems , 2005, IEEE/ACM Transactions on Networking.

[26]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1997, SPAA '97.

[27]  Anees Shaikh,et al.  An empirical evaluation of wide-area internet bottlenecks , 2003, SIGMETRICS '03.

[28]  Ben Y. Zhao,et al.  HPTP: Relieving the Tension between ISPs and P2P , 2007, IPTPS.

[29]  Pablo Rodriguez,et al.  Should internet service providers fear peer-assisted content distribution? , 2005, IMC '05.

[30]  K. K. Ramakrishnan,et al.  Two-way TCP traffic over ATM: effects and analysis , 1997, Proceedings of INFOCOM '97.

[31]  Christian Scheideler.  Towards a paradigm for robust distributed algorithms and data structures , 2006 .

[32]  Christian Scheideler,et al.  Improved bounds for the unsplittable flow problem , 2002, SODA '02.

[33]  D. Malkhi,et al.  LAND: stretch (1 + ε) locality-aware networks for DHTs , 2004, SODA '04.

[34]  Anja Feldmann,et al.  Building an AS-topology model that captures route diversity , 2006, SIGCOMM 2006.

[35]  Donald F. Towsley,et al.  Can an Overlay Compensate for a Careless Underlay? , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[36]  Anja Feldmann,et al.  Building an AS-topology model that captures route diversity , 2006, SIGCOMM.

[37]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[38]  Moni Naor,et al.  Novel architectures for P2P applications: the continuous-discrete approach , 2003, SPAA '03.

[39]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[40]  Baruch Awerbuch,et al.  Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.

[41]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[42]  FeldmannAnja,et al.  Can ISPS and P2P users cooperate for improved performance , 2007 .

[43]  Akihiro Nakao,et al.  A routing underlay for overlay networks , 2003, SIGCOMM '03.

[44]  Chen-Nee Chuah,et al.  Can ISPs and Overlay Networks Form a Synergistic Co-existence? , 2004, DSOM.

[45]  Daniel Stutzbach,et al.  On the Long-term Evolution of the Two-Tier Gnutella Overlay , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[46]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.