Distributed Ant Algorithm for Inter-Carrier Service Composition

Pouyllau, Helia; Djarallah, Nabil Bachir

doi:10.1109/ngi.2009.5175759

Cited by 2 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we are interested on solving the problem through different inter-domain routes instead of only one pre-determined route. Therefore, we propose a distributed algorithm that computes constrained end-to-end paths over multiple inter-domain routes and takes into account the architecture we proposed in (Djarallah et al (2009) 3 Definitions, problem, and algorithm…”

Section: Related Workmentioning

confidence: 99%

“…The discovery of routes could be done either before the constrained path computation phase or simultaneously. In previous work (Pouyllau et al (2009)), we proposed some solutions to identify different inter-domain routes based on technical and economic constraints at the level of the Service Plan. However, a domain may, in practice, contain multiple PCEs (for the path computation load balancing, purpose of redundancy, PCE's dedicated functions, etc.).…”

Section: Challengesmentioning

confidence: 99%

“…In addition to this limitation, BRPC does not manage business issues. Thus, to investigate the potential business issues that could be associated to the PCE, we presented a bottomup approach (Djarallah et al (2009)) that aims to accommodate business objectives and network resource usage within a business-driven PCE. Therefore, to improve the chances of finding such end-to-end constrained paths, multiple sequences of domains should be explored.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Djarallah¹,

Pouyllau²,

Lahoud

et al. 2014

IJCNDS

Self Cite

View full text Add to dashboard Cite

Computing inter-domain MultiProtocol Label Switching Traffic EngineeringLabel 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 interdomain 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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Challengesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation