A Label space reduction algorithm for P2MP LSPs using asymmetric tunnels
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 nu...
| Autores: | , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2005 |
| País: | España |
| Recursos: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10256/2329 |
| Acesso em linha: | http://hdl.handle.net/10256/2329 |
| Access Level: | acceso abierto |
| Palavra-chave: | MPLS (Norma) Telecomunicació -- Tràfic MPLS standard Telecommunication -- Traffic |
| Resumo: | 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 |
|---|