Article thumbnail

On Optimal Computation of MPLS Label Binding for MultiPoint-to-Point Connections

By O Solano, Student Member, Ramon Fabregat and Jose Luis Marzo

Abstract

Abstract—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 treeshapes 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-theMERGING PROBLEM- cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a harddecision 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. Index Terms—Label space reduction, MP2P, label merging

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.206.1043
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://bcds.udg.es/papers/on_o... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.