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

Gilles Bertrand (1) , Samer Lahoud (2) , Géraldine Texier (1) , Miklos Molnar (2)

1 RSM - Département Réseaux, Sécurité et Multimédia
2 IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires

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.

Mots clés: Routing; Inter-domain; Quality of service; Multi-Constrained Path

Domaines: Réseaux et télécommunications [cs.NI]

Gilles Bertrand, Samer Lahoud, Géraldine Texier, Miklos Molnar. A distributed exact solution to compute inter-domain multi-constrained paths. EUNICE - 15th Open European Summer School, Sep 2009, Barcelona, Espagne. pp.21-30, ⟨10.1007/978-3-642-03700-9⟩. ⟨hal-00433368⟩