Scaling all-pairs overlay routing
Name
Karger_Scaling all-pairs.pdf
Size
369.78 KB
Format
Adobe PDF
Checksum (MD5)
db73e3f1864f2bb06bc019d535d27b4f
Author(s)
Sontag, David Alexander
Zhang, Yang
Phanishayee, Amar
Andersen, David G.
Karger, David R.
Date Issued
December 2009
Journal
Proceedings of the 5th international conference on Emerging networking experiments and technologies (CoNEXT '09)
Publisher
Association for Computing Machinery (ACM)
Citation
David Sontag, Yang Zhang, Amar Phanishayee, David G. Andersen, and David Karger. 2009. Scaling all-pairs overlay routing. In Proceedings of the 5th international conference on Emerging networking experiments and technologies (CoNEXT '09). ACM, New York, NY, USA, 145-156.
Version
Author's final manuscript
Abstract
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 (n[superscript 2]) 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 n[superscript 1.5] per-node communication. Our algorithm can also be used to find the optimal shortest path of arbitrary length using only n[superscript 1.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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/1658939.1658956
