Path computation with multiple constraints QoS in multi-domain

The interest for providing services with performance guarantees across different connected networks has given new technical solutions allowing the computation of constrained inter-domain paths. Thus, the present paper treats the problem of computing inter-domain paths subject to multiple constraints. We study here existing algorithms for inter-domain computations, and describe new approach approximating exact solutions. Some previous study proposed an exact solution, named pID-MCP, allowing the pre computation of path segments in the domains. We propose a novel algorithm named ID-MCPAA that treats the computational complexity of the problem, can find a feasible path not found by previous solutions and ameliorate existing techniques. Our algorithm is compatible with existing techniques and fulfills the multi constraints requirements after proving the correctness and the complexity of exact solutions, we evaluate by simulation the performance of the algorithm.