Exploring the trade-off between label size and stack depth in MPLS routing

Multiprotocol label switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineering and to offer IP services like virtual private networks (VPNs). In MPLS, the analysis of the packet (network layer) header is performed just once, and each packet is assigned a stack of labels, which is examined by subsequent routers when making forwarding decisions. Despite the fact that MPLS is becoming widespread on the Internet, we know essentially very little about the performance one can achieve with it, and about the intrinsic trade-offs in its use of resources. In this paper, we undertake a comprehensive study of the label size versus stack depth trade-off for MPLS routing protocols on lines and trees. We show that in addition to LSP tunneling, label stacks can also be used to dramatically reduce the number of labels required for setting up MPLS LSPs in a network. Based on this observation, we develop routing algorithms and prove lower bounds for two basic problems: (1) fixed label routing: given a fixed number of labels, we want to minimize the stack depth, and (2) fixed stack routing: given a bound on the stack depth, we want to minimize the number of labels used. Our simulation results validate our approach, demonstrating that our novel protocols enable MPLS routing on large trees with few labels and small stack sizes. Thus, our MPLS routing algorithms are applicable to a number of practical scenarios involving the provisioning of VPNs and multicast trees.

[1]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture" RFC 3031 , 2001 .

[2]  Albert G. Greenberg,et al.  Resource management with hoses: point-to-cloud services for virtual private networks , 2002, TNET.

[3]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.

[4]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[5]  Ran Raz,et al.  Distance labeling in graphs , 2001, SODA '01.

[6]  David P. Dobkin,et al.  On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[7]  Lenore Cowen,et al.  Compact routing with minimum stretch , 1999, SODA '99.

[8]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[9]  J. M. Sek.  On embedding trees into uniformly convex Banach spaces , 1999 .

[10]  Dino Farinacci,et al.  MPLS Label Stack Encoding , 2001, RFC.

[11]  Cyril Gavoille,et al.  Routing in distributed networks: overview and open problems , 2001, SIGA.

[12]  Giri Narasimhan,et al.  New sparseness results on graph spanners , 1992, SCG '92.

[13]  David Peleg,et al.  Proximity-Preserving Labeling Schemes and Their Applications , 1999, WG.

[14]  J. Matousek,et al.  On embedding trees into uniformly convex Banach spaces , 1999 .

[15]  Amit Kumar,et al.  Traveling with a Pez dispenser (or, routing issues in MPLS) , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[16]  Yakov Rekhter,et al.  Mpls: Technology and Applications , 2000 .

[17]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2001, SIGCOMM.

[18]  Greg N. Frederickson,et al.  Designing networks with compact routing tables , 1988, Algorithmica.

[19]  Eli Upfal,et al.  A trade-off between space and efficiency for routing tables , 1989, JACM.

[20]  Greg N. Frederickson,et al.  Efficient Message Routing in Planar Networks , 1989, SIAM J. Comput..

[21]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[22]  Albert G. Greenberg,et al.  A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.

[23]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

[24]  Michael E. Saks,et al.  Trees and Euclidean metrics , 1998, STOC '98.

[25]  Peter Winkler,et al.  Proof of the squashed cube conjecture , 1983, Comb..