Gupta, A. ; Kumar, A. ; Rastogi, R. (2001) Traveling with a Pez dispenser (or, routing issues in MPLS) In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 8-11 Oct. 2001, Newport Beach, CA, USA.
Full text not available from this repository.
Official URL: http://doi.org/10.1109/SFCS.2001.959889
Related URL: http://dx.doi.org/10.1109/SFCS.2001.959889
Abstract
MultiProtocol Label Switching (MPLS) is a 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 a shortest (or near-shortest) path between them. The concept of tree covers appears to have many interesting applications.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 123564 |
| Deposited On: | 30 Sep 2021 11:03 |
| Last Modified: | 30 Sep 2021 11:03 |
Repository Staff Only: item control page
