학술논문

A label space reduction algorithm for P2MP LSPs using asymmetric tunnels
Document Type
Conference
Source
10th IEEE Symposium on Computers and Communications (ISCC'05) Computers and communications Computers and Communications, 2005. ISCC 2005. Proceedings. 10th IEEE Symposium on. :746-751 2005
Subject
Computing and Processing
Communication, Networking and Broadcast Technologies
Signal Processing and Analysis
Multiprotocol label switching
Telecommunication traffic
Resource management
Informatics
Application software
Quality of service
Virtual private networks
Tellurium
Protocols
Delay
Asymmetric tunnels
label space
label stack
label space reduction
longest segment first
NHLFE
traffic engineering
MPLS
Language
ISSN
1530-1346
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.