Constraint-based path selection algorithms for minimizing blockage in multi domain networks

During recent decades new routing paradigms based on policies and quality of service provisioning have been proposed. The aim of constraint-based path selection algorithms is to satisfy a set of quality of service constraints. This can help to reduce costs and balance network load. Path computation algorithms pose new challenges in larger inter domain networks. In these cases the process of path computation is more prone to block due to the long response time of the requests. In view of this, we propose and compare an algorithm to increase the number of successful requests while minimizing the blockage in network. The proposed algorithm also considers several QoS metrics in path computation that can help to have uniform traffic load in network. In this paper we focus on restrictions of the shortest path algorithms and propose a multi constrained path selection algorithm based on PCE.