A Routing Underlay for Overlay Networks

Akihiro Nakao, Larry Lee Peterson, Andy Bavier

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

62 Citations (Scopus)

Abstract

We argue that designing overlay services to independently probe the Internet-with the goal of making informed application-specific routing decisions-is an untenable strategy. Instead, we propose a shared routing underlay that overlay services query. We posit that this underlay must adhere to two high-level principles. First, it must take cost (in terms of network probes) into account. Second, it must be layered so that specialized routing services can be built from a set of basic primitives. These principles lead to an underlay design where lower layers expose large-scale, coarse-grained static information already collected by the network, and upper layers perform more frequent probes over a narrow set of nodes. This paper proposes a set of primitive operations and three library routing services that can be built on top of them, and describes how such libraries could be useful to overlay services.

Original languageEnglish (US)
Title of host publicationComputer Communication Review
Pages11-18
Number of pages8
Volume33
Edition4
StatePublished - Oct 2003
Externally publishedYes
EventProceedings of ACM SIGCOMM 2003: Conference on Computer Communications - Karlsruhe, Germany
Duration: Aug 25 2003Aug 29 2003

Other

OtherProceedings of ACM SIGCOMM 2003: Conference on Computer Communications
CountryGermany
CityKarlsruhe
Period8/25/038/29/03

Fingerprint

Overlay networks
Internet
Costs

Keywords

  • Infrastructure
  • Overlay Networks
  • Routing

ASJC Scopus subject areas

  • Information Systems

Cite this

Nakao, A., Peterson, L. L., & Bavier, A. (2003). A Routing Underlay for Overlay Networks. In Computer Communication Review (4 ed., Vol. 33, pp. 11-18)

A Routing Underlay for Overlay Networks. / Nakao, Akihiro; Peterson, Larry Lee; Bavier, Andy.

Computer Communication Review. Vol. 33 4. ed. 2003. p. 11-18.

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

Nakao, A, Peterson, LL & Bavier, A 2003, A Routing Underlay for Overlay Networks. in Computer Communication Review. 4 edn, vol. 33, pp. 11-18, Proceedings of ACM SIGCOMM 2003: Conference on Computer Communications, Karlsruhe, Germany, 8/25/03.
Nakao A, Peterson LL, Bavier A. A Routing Underlay for Overlay Networks. In Computer Communication Review. 4 ed. Vol. 33. 2003. p. 11-18
Nakao, Akihiro ; Peterson, Larry Lee ; Bavier, Andy. / A Routing Underlay for Overlay Networks. Computer Communication Review. Vol. 33 4. ed. 2003. pp. 11-18
@inproceedings{62e8a994698a41d39e7bc13cb2618ba4,
title = "A Routing Underlay for Overlay Networks",
abstract = "We argue that designing overlay services to independently probe the Internet-with the goal of making informed application-specific routing decisions-is an untenable strategy. Instead, we propose a shared routing underlay that overlay services query. We posit that this underlay must adhere to two high-level principles. First, it must take cost (in terms of network probes) into account. Second, it must be layered so that specialized routing services can be built from a set of basic primitives. These principles lead to an underlay design where lower layers expose large-scale, coarse-grained static information already collected by the network, and upper layers perform more frequent probes over a narrow set of nodes. This paper proposes a set of primitive operations and three library routing services that can be built on top of them, and describes how such libraries could be useful to overlay services.",
keywords = "Infrastructure, Overlay Networks, Routing",
author = "Akihiro Nakao and Peterson, {Larry Lee} and Andy Bavier",
year = "2003",
month = "10",
language = "English (US)",
volume = "33",
pages = "11--18",
booktitle = "Computer Communication Review",
edition = "4",

}

TY - GEN

T1 - A Routing Underlay for Overlay Networks

AU - Nakao, Akihiro

AU - Peterson, Larry Lee

AU - Bavier, Andy

PY - 2003/10

Y1 - 2003/10

N2 - We argue that designing overlay services to independently probe the Internet-with the goal of making informed application-specific routing decisions-is an untenable strategy. Instead, we propose a shared routing underlay that overlay services query. We posit that this underlay must adhere to two high-level principles. First, it must take cost (in terms of network probes) into account. Second, it must be layered so that specialized routing services can be built from a set of basic primitives. These principles lead to an underlay design where lower layers expose large-scale, coarse-grained static information already collected by the network, and upper layers perform more frequent probes over a narrow set of nodes. This paper proposes a set of primitive operations and three library routing services that can be built on top of them, and describes how such libraries could be useful to overlay services.

AB - We argue that designing overlay services to independently probe the Internet-with the goal of making informed application-specific routing decisions-is an untenable strategy. Instead, we propose a shared routing underlay that overlay services query. We posit that this underlay must adhere to two high-level principles. First, it must take cost (in terms of network probes) into account. Second, it must be layered so that specialized routing services can be built from a set of basic primitives. These principles lead to an underlay design where lower layers expose large-scale, coarse-grained static information already collected by the network, and upper layers perform more frequent probes over a narrow set of nodes. This paper proposes a set of primitive operations and three library routing services that can be built on top of them, and describes how such libraries could be useful to overlay services.

KW - Infrastructure

KW - Overlay Networks

KW - Routing

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

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

M3 - Conference contribution

AN - SCOPUS:1242287734

VL - 33

SP - 11

EP - 18

BT - Computer Communication Review

ER -