Scaling all-pairs overlay routing

David Sontag, Yang Zhang, Amar Phanishayee, David G. Andersen, David Karger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 (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.

Original languageEnglish (US)
Title of host publicationCoNEXT'09 - Proceedings of the 2009 ACM Conference on Emerging Networking Experiments and Technologies
Pages145-156
Number of pages12
DOIs
StatePublished - Dec 1 2009
Event2009 ACM Conference on Emerging Networking Experiments and Technologies, CoNEXT'09 - Rome, Italy
Duration: Dec 1 2009Dec 4 2009

Publication series

NameCoNEXT'09 - Proceedings of the 2009 ACM Conference on Emerging Networking Experiments and Technologies

Other

Other2009 ACM Conference on Emerging Networking Experiments and Technologies, CoNEXT'09
CountryItaly
CityRome
Period12/1/0912/4/09

Keywords

  • Availability
  • Distributed shortest path
  • Networks
  • Overlay networks
  • RON
  • Routing
  • Scalability

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Scaling all-pairs overlay routing'. Together they form a unique fingerprint.

  • Cite this

    Sontag, D., Zhang, Y., Phanishayee, A., Andersen, D. G., & Karger, D. (2009). Scaling all-pairs overlay routing. In CoNEXT'09 - Proceedings of the 2009 ACM Conference on Emerging Networking Experiments and Technologies (pp. 145-156). (CoNEXT'09 - Proceedings of the 2009 ACM Conference on Emerging Networking Experiments and Technologies). https://doi.org/10.1145/1658939.1658956