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 - 2009
Event2009 ACM Conference on Emerging Networking Experiments and Technologies, CoNEXT'09 - Rome, Italy
Duration: Dec 1 2009Dec 4 2009

Other

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

Fingerprint

Communication
Overlay networks
Internet
Network protocols

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

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) https://doi.org/10.1145/1658939.1658956

Scaling all-pairs overlay routing. / Sontag, David; Zhang, Yang; Phanishayee, Amar; Andersen, David G.; Karger, David.

CoNEXT'09 - Proceedings of the 2009 ACM Conference on Emerging Networking Experiments and Technologies. 2009. p. 145-156.

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

Sontag, D, Zhang, Y, Phanishayee, A, Andersen, DG & 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, 2009 ACM Conference on Emerging Networking Experiments and Technologies, CoNEXT'09, Rome, Italy, 12/1/09. https://doi.org/10.1145/1658939.1658956
Sontag D, Zhang Y, Phanishayee A, Andersen DG, Karger D. Scaling all-pairs overlay routing. In CoNEXT'09 - Proceedings of the 2009 ACM Conference on Emerging Networking Experiments and Technologies. 2009. p. 145-156 https://doi.org/10.1145/1658939.1658956
Sontag, David ; Zhang, Yang ; Phanishayee, Amar ; Andersen, David G. ; Karger, David. / Scaling all-pairs overlay routing. CoNEXT'09 - Proceedings of the 2009 ACM Conference on Emerging Networking Experiments and Technologies. 2009. pp. 145-156
@inproceedings{c798b8addbc24c2b9b1268fad6424a31,
title = "Scaling all-pairs overlay routing",
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.",
keywords = "Availability, Distributed shortest path, Networks, Overlay networks, RON, Routing, Scalability",
author = "David Sontag and Yang Zhang and Amar Phanishayee and Andersen, {David G.} and David Karger",
year = "2009",
doi = "10.1145/1658939.1658956",
language = "English (US)",
isbn = "9781605586366",
pages = "145--156",
booktitle = "CoNEXT'09 - Proceedings of the 2009 ACM Conference on Emerging Networking Experiments and Technologies",

}

TY - GEN

T1 - Scaling all-pairs overlay routing

AU - Sontag, David

AU - Zhang, Yang

AU - Phanishayee, Amar

AU - Andersen, David G.

AU - Karger, David

PY - 2009

Y1 - 2009

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

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

KW - Availability

KW - Distributed shortest path

KW - Networks

KW - Overlay networks

KW - RON

KW - Routing

KW - Scalability

UR - http://www.scopus.com/inward/record.url?scp=76749114865&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=76749114865&partnerID=8YFLogxK

U2 - 10.1145/1658939.1658956

DO - 10.1145/1658939.1658956

M3 - Conference contribution

SN - 9781605586366

SP - 145

EP - 156

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

ER -