A distributed exact solution to compute inter-domain multi-constrained paths

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00433368
Contributor : Bibliothèque Télécom Bretagne <>
Submitted on : Thursday, November 19, 2009 - 9:39:10 AM
Last modification on : Thursday, October 17, 2019 - 12:34:48 PM
Long-term archiving on : Thursday, June 17, 2010 - 6:16:50 PM

File

fulltext.pdf
Files produced by the author(s)

Identifiers

Citation

Gilles Bertrand, Samer Lahoud, Géraldine Texier, Miklos Molnar. A distributed exact solution to compute inter-domain multi-constrained paths. EUNICE - The Internet of the Future, Sep 2009, Barcelona, Espagne. pp.21-30, ⟨10.1007/978-3-642-03700-9⟩. ⟨hal-00433368⟩

Share

Metrics

Record views

415

Files downloads

188