This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
42nd IEEE symposium on Foundations of Computer Science (FOCS?01)
Traveling with a Pez Dispenser (Or, Routing Issues in MPLS)
Las Vegas, Nevada
October 14-October 17
ISBN: 0-7695-1390-5
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.
Citation:
A. Gupta, A. Kumar, R. Rastogi, "Traveling with a Pez Dispenser (Or, Routing Issues in MPLS)," focs, pp.148, 42nd IEEE symposium on Foundations of Computer Science (FOCS?01), 2001
Usage of this product signifies your acceptance of the Terms of Use.