A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths

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:
EUNICE '09 Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future
Year:
2009

Citing 6
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Heuristic algorithms for multiconstrained quality-of-service routing

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Concepts of exact QoS routing algorithms

IEEE/ACM Transactions on Networking (TON)
Finding a path subject to many additive QoS constraints

IEEE/ACM Transactions on Networking (TON)
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Hybrid inter-domain QoS routing with crankback mechanisms

NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The fundamental Quality of Service (QoS) routing problem, which consists in determining paths subject to multiple QoS constraints, has been extensively investigated in the intra-domain context. However, few solutions exist for the inter-domain case, despite the importance of this problem to enable the delivery of services with QoS across domain boundaries. We propose a method that distributes the operations to compute inter-domain constrained paths. This method relies on a per-domain formulation that is compatible with the path computation element framework. It enables us to propose the first algorithm that guarantees to find optimal paths subject to an arbitrary number of constraints. These paths ensure the best QoS performance with respect to the constraints.