DMCA
A routing underlay for overlay networks (2003)
Cached
Download Links
- [nsg.cs.princeton.edu]
- [www.utdallas.edu]
- [www.utdallas.edu]
- [www.planet-lab.org]
- [pl-service-01.cs.princeton.edu]
- [www.cs.princeton.edu]
- [www.planet-lab.org]
- DBLP
Other Repositories/Bibliography
| Venue: | In SIGCOMM |
| Citations: | 153 - 5 self |
BibTeX
@INPROCEEDINGS{Nakao03arouting,
author = {Akihiro Nakao and Larry Peterson and Andy Bavier},
title = {A routing underlay for overlay networks},
booktitle = {In SIGCOMM},
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
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. 1.
Keyphrases
routing underlay overlay network upper layer underlay design untenable strategy narrow set informed application-specific routing decision high-level principle overlay service library routing service primitive operation frequent probe network probe basic primitive coarse-grained static information
