Scaling all-pairs overlay routing

This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as each node incurs quadratic (n2) communication overhead to broadcast its link state to all other nodes. In contrast, in our algorithm each node exchanges routing state with only a small subset of overlay nodes determined by using a quorum system. Using a two round protocol, each node can find an optimal one-hop path to any other node using only n1.5 per-node communication. Our algorithm can also be used to find the optimal shortest path of arbitrary length using only n1.5 logn per-node communication. The algorithm is designed to be resilient to both node and link failures. We apply this algorithm to a Resilient Overlay Network (RON) system, and evaluate the results using a large-scale, globally distributed set of Internet hosts. The reduced communication overhead from using our improved full-mesh algorithm allows the creation of all-pairs routing overlays that scale to hundreds of nodes, without reducing the system's ability to rapidly find optimal routes.

[1]  Mostafa H. Ammar,et al.  The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data , 1992, IEEE Trans. Knowl. Data Eng..

[2]  Michael K. Reiter,et al.  Probabilistic quorum systems , 1997, PODC '97.

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

[4]  Yin Zhang,et al.  On the constancy of internet path properties , 2001, IMW '01.

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

[6]  Randy H. Katz,et al.  Backup path allocation based on a correlated link failure probability model in overlay networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[7]  Nitin H. Vaidya,et al.  Location tracking using quorums in mobile ad hoc networks , 2003, Ad Hoc Networks.

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

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

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

[11]  Himabindu Pucha,et al.  Performance comparison of scalable location services for geographic ad hoc routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[12]  Suresh Jagannathan,et al.  Search with probabilistic guarantees in unstructured peer-to-peer networks , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[13]  Ittai Abraham,et al.  Practical Locality-Awareness for Large Scale Information Sharing , 2005, IPTPS.

[14]  Roch Guérin,et al.  How to Select a Good Alternate Path in Large Peer-to-Peer Systems? , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[16]  Thomas E. Anderson,et al.  One Hop Reputations for Peer to Peer File Sharing Workloads , 2008, NSDI.

[17]  Bobby Bhattacharjee,et al.  Symbiotic Relationships in Internet Routing Overlays , 2009, NSDI.

[18]  Dan R. K. Ports,et al.  Census: Location-Aware Membership Management for Large-Scale Distributed Systems , 2009, USENIX Annual Technical Conference.