PeerWise Discovery and Negotiation of Faster Paths

Routing overlays have the potential to circumvent Internet pathologies to construct faster or more reliable paths. We suggest that overlay routing protocols have yet to become ubiquitous because they do not incorporate mechanisms for finding and negotiating with mutually advantageous peers: nodes in the overlay that can benefit equally from each other. We show that mutually advantageous peers exist in the Internet and that one-hop detour routing is sufficient for a latencyreducing overlay. We then simulate such an overlay construction process to show that it is efficient and scalable.

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

[2]  Rob Sherwood,et al.  Fair File Swarming with FOX , 2006, IPTPS.

[3]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[4]  Yuval Shavitt,et al.  Big-bang simulation for embedding network distances in Euclidean space , 2004, IEEE/ACM Transactions on Networking.

[5]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[7]  Randy H. Katz,et al.  OverQoS: An Overlay Based Architecture for Enhancing Internet QoS , 2004, NSDI.

[8]  Krishna P. Gummadi,et al.  Improving the Reliability of Internet Paths with One-hop Source Routing , 2004, OSDI.

[9]  Bo Zhang,et al.  Towards network triangle inequality violation aware distributed systems , 2007, IMC '07.

[10]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Dave Levin.  Punishment in Selfish Wireless Networks : A Game Theoretic Analysis , 2006 .

[12]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[13]  Rob Sherwood,et al.  Touring the internet in a TCP sidecar , 2006, IMC '06.

[14]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[15]  Michael Sirivianos,et al.  Dandelion: Cooperative Content Distribution with Robust Incentives , 2007, USENIX Annual Technical Conference.

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

[17]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[18]  Margo I. Seltzer,et al.  Network Coordinates in the Wild , 2007, NSDI.

[19]  Amin Vahdat,et al.  Detour: a Case for Informed Internet Routing and Transport , 2007 .

[20]  Akihiro Nakao,et al.  Scalable routing overlay networks , 2006, OPSR.

[21]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[22]  Stefan Schmid,et al.  On the topologies formed by selfish peers , 2006, PODC '06.

[23]  Emin Gün Sirer,et al.  Meridian: a lightweight network location service without virtual coordinates , 2005, SIGCOMM '05.