Computation of multi-constrained paths in multi-domain MPLS-TE networks

Authors:
Gilles Bertrand;Samer Lahoud;Géraldine Texier;Miklós Molnár
Affiliations:
Institut Telecom, Telecom Bretagne, RSM;IRISA, Université de Rennes 1;Institut Telecom, Telecom Bretagne, RSM;IRISA, INSA de Rennes
Venue:
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Year:
2009

Citing 8
Cited 0

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Hop-by-hop quality of service routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Simulation of large scale networks II: development of an internet backbone topology for large-scale network simulations

Proceedings of the 35th conference on Winter simulation: driving innovation
Concepts of exact QoS routing algorithms

IEEE/ACM Transactions on Networking (TON)
Interdomain routing through QoS-class planes [Quality-of-Service-Based Routing Algorithms for Heterogeneous Networks]

IEEE Communications Magazine
A service plane over the PCE architecture for automatic multidomain connection-oriented services

IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
Path-Computation-Element-Based Architecture for Interdomain MPLS/GMPLS Traffic Engineering: Overview and Performance

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The present paper proposes a novel method for computing inter-domain paths subject to multiple independent additive constraints in MPLS-TE networks. An efficient solution to this problem is a key element for providing services with guaranteed performance across domain boundaries. However, the inherent hardness of the multi-constrained path computation as well as inter-domain scalability and security constraints complicate the computation problem. We propose a novel algorithm named kID-MCP that tackles the computational complexity of the problem by reducing the number of paths included in the computation process. kID-MCP is compatible with existing techniques and fulfills the security requirements. We undergo a complexity analysis that shows that kID-MCP scales well. Moreover, a simulation study reveals that kID-MCP finds a solution in most situations. These results indicate that the computation of inter-domain multi-constrained paths is tractable in practice, which opens interesting perspectives for QoS routing and traffic engineering among multiple operators.