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

Authors: Nabil Bachir Djarallah; Hélia Pouyllau; Samer Lahoud; Bernard Cousin

Addresses: Alcatel-Lucent Bell Labs France, Centre de Villarceaux, 91620 Nozay, France ' Alcatel-Lucent Bell Labs France, Centre de Villarceaux, 91620 Nozay, France ' IRISA, University of Rennes 1, Campus de Beaulieu, 35042 Rennes, France ' IRISA, University of Rennes 1, Campus de Beaulieu, 35042 Rennes, France

Abstract: Computing inter-domain multiprotocol label switching traffic engineering label switched path (MPLS-TE LSP) through a pre-determined sequence of domains is quite straight as each path computation element (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 pre-determined 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.

Keywords: constrained paths; multi-constrained optimal paths; MCOP; quality of service; QoS; path computation element; backward recursive PCE; BRPC; multiprotocol label switching; traffic engineering; label switched path; MPLS-TE LSP; inter-domain loop avoidance; inter-domain route; domain sequences; route discovery.

DOI: 10.1504/IJCNDS.2014.062229

International Journal of Communication Networks and Distributed Systems, 2014 Vol.12 No.4, pp.420 - 441

Received: 08 May 2021
Accepted: 12 May 2021

Published online: 02 Jun 2014 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article