On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced.

[1]  Daniel O. Awduche,et al.  Applicability Statement for Extensions to RSVP for LSP-Tunnels , 2001, RFC.

[2]  Samrat Ganguly,et al.  Creating multipoint-to-point LSPs for traffic engineering , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..

[3]  Hiroyuki Saito,et al.  Traffic engineering using multiple multipoint-to-point LSPs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Ramón Fabregat,et al.  A Multi-Objective Optimization Scheme for Multicast Routing: A Multitree Approach , 2004, Telecommun. Syst..

[5]  J. Marti,et al.  IST-LASAGNE: towards all-optical label swapping employing optical logic gates and optical flip-flops , 2005, Journal of Lightwave Technology.

[6]  Mikkel Thorup,et al.  Load optimal MPLS routing with N + M labels , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[8]  Michalis Faloutsos,et al.  Power laws and the AS-level internet topology , 2003, TNET.

[9]  Amit Kumar,et al.  Exploring the trade-off between label size and stack depth in MPLS routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Adrian Farrel,et al.  Supporting Multipoint-to-Point Label Switched Paths in Multiprotocol Label Switching Traffic Engineering , 2009 .

[11]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[12]  Ramón Fabregat,et al.  Full label space reduction in MPLS networks: asymmetric merged tunneling , 2005, IEEE Communications Letters.