A Label space reduction algorithm for P2MP LSPs using asymmetric tunnels

Abstract

The aim of traffic engineering is to optimise network resource utilization. Although several works on minimizing network resource utilization have been published, few works have focused on LSR label space. This paper proposes an algorithm that uses MPLS label stack features in order to reduce the number of labels used in LSPs forwarding. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The algorithm described sets up the NHLFE tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the algorithm achieves a large reduction factor in the label space. The work presented here applies for both types of connections: P2MP and P2P.

Original document

The different versions of the original document can be found in:

• http://dx.doi.org/10.1109/ISCC.2005.13 under the license https://creativecommons.org/share-your-work/public-domain/cc0/

• https://dugi-doc.udg.edu/bitstream/10256/2329/1/78.pdf

• http://xplorestaging.ieee.org/ielx5/10000/32117/01493808.pdf?arnumber=1493808,

http://dx.doi.org/10.1109/iscc.2005.13 under the license cc0

• https://dblp.uni-trier.de/db/conf/iscc/iscc2005.html#SolanoFDM05,

https://dugi-doc.udg.edu/bitstream/handle/10256/2329/78.pdf;sequence=1,

https://dugi-doc.udg.edu/handle/10256/2329,

https://ieeexplore.ieee.org/document/1493808,

https://dl.acm.org/citation.cfm?id=1078034.1079639,

https://academic.microsoft.com/#/detail/2121495837