Las Vegas, Nevada
Oct. 14, 2001 to Oct. 17, 2001
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.
A. Gupta, A. Kumar, R. Rastogi, "Traveling with a Pez Dispenser (Or, Routing Issues in MPLS)", FOCS, 2001, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2001, pp. 148, doi:10.1109/SFCS.2001.959889