Scalable routing overlay networks

Akihiro Nakao, Larry Lee Peterson, Andy Bavier

Research output: Chapter in Book/Report/Conference proceedingChapter

41 Citations (Scopus)

Abstract

Routing overlays have become a viable approach to working around slow BGP convergence and sub-optimal path selection, as well as to deploy novel forwarding architectures. A common sub-component of a routing overlay is a routing mesh: the route-selection algorithm considers only those virtual links inter-node links in an overlay - in the routing mesh rather than all N 2 virtual links connecting an N-node overlay. Doing so reduces routing overhead, thereby improving the scalability of the overlay, as long as the process of constructing the mesh doesn't itself introduce overhead. This paper proposes and evaluates a low-cost approach to building a topology-aware routing mesh that eliminates virtual links that contain duplicate physical segments in the underlying network. An evaluation of our method on PlanetLab shows that a conservative link pruning algorithm reduces routing overhead by a factor of two without negatively impacting route selection. Additional analysis quanties the impact on route selection of defining an even sparser mesh on top of the topology-aware routing mesh, documenting the cost/benefit tradeoff that is intrinsic to routing. It also shows that constructing a sparser routing mesh on the topology-aware routing mesh - rather than directly on the Internet - itself benefits from having the reduced number of duplicate physical segments in the underlying network, which improves the resilience of the resulting routing mesh.

Original languageEnglish (US)
Title of host publicationOperating Systems Review (ACM)
Pages49-61
Number of pages13
Volume40
Edition1
DOIs
StatePublished - 2006
Externally publishedYes

Fingerprint

Overlay networks
Topology
Routing algorithms
Scalability
Costs
Internet

Keywords

  • Infrastructure
  • Overlay networks
  • Routing

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Nakao, A., Peterson, L. L., & Bavier, A. (2006). Scalable routing overlay networks. In Operating Systems Review (ACM) (1 ed., Vol. 40, pp. 49-61) https://doi.org/10.1145/1113361.1113372

Scalable routing overlay networks. / Nakao, Akihiro; Peterson, Larry Lee; Bavier, Andy.

Operating Systems Review (ACM). Vol. 40 1. ed. 2006. p. 49-61.

Research output: Chapter in Book/Report/Conference proceedingChapter

Nakao, A, Peterson, LL & Bavier, A 2006, Scalable routing overlay networks. in Operating Systems Review (ACM). 1 edn, vol. 40, pp. 49-61. https://doi.org/10.1145/1113361.1113372
Nakao A, Peterson LL, Bavier A. Scalable routing overlay networks. In Operating Systems Review (ACM). 1 ed. Vol. 40. 2006. p. 49-61 https://doi.org/10.1145/1113361.1113372
Nakao, Akihiro ; Peterson, Larry Lee ; Bavier, Andy. / Scalable routing overlay networks. Operating Systems Review (ACM). Vol. 40 1. ed. 2006. pp. 49-61
@inbook{65da4ea9c7244e39aeccd58b80f6882f,
title = "Scalable routing overlay networks",
abstract = "Routing overlays have become a viable approach to working around slow BGP convergence and sub-optimal path selection, as well as to deploy novel forwarding architectures. A common sub-component of a routing overlay is a routing mesh: the route-selection algorithm considers only those virtual links inter-node links in an overlay - in the routing mesh rather than all N 2 virtual links connecting an N-node overlay. Doing so reduces routing overhead, thereby improving the scalability of the overlay, as long as the process of constructing the mesh doesn't itself introduce overhead. This paper proposes and evaluates a low-cost approach to building a topology-aware routing mesh that eliminates virtual links that contain duplicate physical segments in the underlying network. An evaluation of our method on PlanetLab shows that a conservative link pruning algorithm reduces routing overhead by a factor of two without negatively impacting route selection. Additional analysis quanties the impact on route selection of defining an even sparser mesh on top of the topology-aware routing mesh, documenting the cost/benefit tradeoff that is intrinsic to routing. It also shows that constructing a sparser routing mesh on the topology-aware routing mesh - rather than directly on the Internet - itself benefits from having the reduced number of duplicate physical segments in the underlying network, which improves the resilience of the resulting routing mesh.",
keywords = "Infrastructure, Overlay networks, Routing",
author = "Akihiro Nakao and Peterson, {Larry Lee} and Andy Bavier",
year = "2006",
doi = "10.1145/1113361.1113372",
language = "English (US)",
volume = "40",
pages = "49--61",
booktitle = "Operating Systems Review (ACM)",
edition = "1",

}

TY - CHAP

T1 - Scalable routing overlay networks

AU - Nakao, Akihiro

AU - Peterson, Larry Lee

AU - Bavier, Andy

PY - 2006

Y1 - 2006

N2 - Routing overlays have become a viable approach to working around slow BGP convergence and sub-optimal path selection, as well as to deploy novel forwarding architectures. A common sub-component of a routing overlay is a routing mesh: the route-selection algorithm considers only those virtual links inter-node links in an overlay - in the routing mesh rather than all N 2 virtual links connecting an N-node overlay. Doing so reduces routing overhead, thereby improving the scalability of the overlay, as long as the process of constructing the mesh doesn't itself introduce overhead. This paper proposes and evaluates a low-cost approach to building a topology-aware routing mesh that eliminates virtual links that contain duplicate physical segments in the underlying network. An evaluation of our method on PlanetLab shows that a conservative link pruning algorithm reduces routing overhead by a factor of two without negatively impacting route selection. Additional analysis quanties the impact on route selection of defining an even sparser mesh on top of the topology-aware routing mesh, documenting the cost/benefit tradeoff that is intrinsic to routing. It also shows that constructing a sparser routing mesh on the topology-aware routing mesh - rather than directly on the Internet - itself benefits from having the reduced number of duplicate physical segments in the underlying network, which improves the resilience of the resulting routing mesh.

AB - Routing overlays have become a viable approach to working around slow BGP convergence and sub-optimal path selection, as well as to deploy novel forwarding architectures. A common sub-component of a routing overlay is a routing mesh: the route-selection algorithm considers only those virtual links inter-node links in an overlay - in the routing mesh rather than all N 2 virtual links connecting an N-node overlay. Doing so reduces routing overhead, thereby improving the scalability of the overlay, as long as the process of constructing the mesh doesn't itself introduce overhead. This paper proposes and evaluates a low-cost approach to building a topology-aware routing mesh that eliminates virtual links that contain duplicate physical segments in the underlying network. An evaluation of our method on PlanetLab shows that a conservative link pruning algorithm reduces routing overhead by a factor of two without negatively impacting route selection. Additional analysis quanties the impact on route selection of defining an even sparser mesh on top of the topology-aware routing mesh, documenting the cost/benefit tradeoff that is intrinsic to routing. It also shows that constructing a sparser routing mesh on the topology-aware routing mesh - rather than directly on the Internet - itself benefits from having the reduced number of duplicate physical segments in the underlying network, which improves the resilience of the resulting routing mesh.

KW - Infrastructure

KW - Overlay networks

KW - Routing

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

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

U2 - 10.1145/1113361.1113372

DO - 10.1145/1113361.1113372

M3 - Chapter

AN - SCOPUS:33845188587

VL - 40

SP - 49

EP - 61

BT - Operating Systems Review (ACM)

ER -