Multi-constrained path computation for inter-domain QoS-capable services

Abstract : Computing inter-domain MultiProtocol Label Switching Traffic Engineering Label Switched Path (MPLS-TE LSP) using the Path Computation Element (PCE) through a predetermined sequence of domains is quite straight. Each PCE, using the Backward Recursive PCE-based Computation (BRPC), knows who is the next to be contacted in order to continue the computation. The optimality of the inter-domain MPLS-TE LSP path depends strongly on the choice of the predetermined sequence of domains on which the calculation works. In this paper we propose a novel procedure allowing a forward discovery of multiple inter-domain sequences and the computation of constrained inter-domain paths for MPLS-TE LSPs over these domains sequences. Other issues around the inter-domain path computation, such as route discovery and inter-domain loop avoidance, are investigated. Experimental evaluation shows that our solution is effective in terms of protocol and algorithmic efficiency and provides satisfiable performance with high success rate, reasonable message overhead and runtime.
Document type :
Journal articles
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01144799
Contributor : Bernard Cousin <>
Submitted on : Tuesday, February 16, 2016 - 11:25:48 AM
Last modification on : Thursday, February 7, 2019 - 3:43:47 PM
Long-term archiving on : Tuesday, May 17, 2016 - 5:20:27 PM

File

Nabil DJARALLAH et al.pdf
Files produced by the author(s)

Identifiers

Citation

Nabil Djarallah, Hélia Pouyllau, Samer Lahoud, Bernard Cousin. Multi-constrained path computation for inter-domain QoS-capable services. International Journal of Communication Networks and Distributed Systems, 2014, Special Issue on "Multi-Constraint Algorithms for Heterogeneous Networks", 12 (4), pp.1-22. ⟨10.1504/IJCNDS.2014.062229⟩. ⟨hal-01144799⟩

Share

Metrics

Record views

670

Files downloads

183