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

扫码查看

原文链接

NETL
NSTL

外文摘要：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.

外文关键词：

constrained pathmulti-constrained optimal pathMCOPquality of serviceQoSpath computation elementPCEbackward recursive PCE-based computationBRPCmultiprotocol label switching traffic engineering label switched pathMPLS-TE LSPinter-domain loop avoidanceinter-domain route

作者：

Nabil Bachir Djarallah、Helia Pouyllau、Samer Lahoud、Bernard Cousin

展开 >

作者单位：

Alcatel-Lucent Bell Labs France, Centre de Villarceaux, 91620 Nozay, France

IRISA, University of Rennes 1, Campus de Beaulieu, 35042 Rennes, France

出版年：

2014

International journal of communication networks and distributed systems: IJCNDS

EIESCI

ISSN：1754-3916

年,卷(期)：2014.12(4)