Traveling with a Pez Dispenser (Or, Routing Issues in MPLS)

Authors:
A. Gupta;A. Kumar
Affiliations:
-;-
Venue:
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Year:
2001

Citing 0
Cited 4

Tree based MPLS routing

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact oracles for reachability and approximate distances in planar digraphs

Journal of the ACM (JACM)
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Compact and low delay routing labeling scheme for Unit Disk Graphs

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

MultiProtocol Label Switching (MPLS) [6, 11] is routing model proposed by the IETF for the Internet, and is becoming widely popular. In this paper, we initiate a theoretical study of the routing model, and give routing algorithms and lower bounds in a variety of situations. We first study the routing problems on the line. We then build up our results from paths through trees to more general graphs. The basic technique to go to general graphs is that of finding a tree cover, which is a small set of subtrees of the graph such that for each pair of vertices, one of the trees contains an shortest (or near-shortest) path between them. The concept of tree covers appears to have many interesting applications.