A blocking probability reduction method in path computation schemes for inter domain networks

Path computation algorithms pose new challenges when extending them to larger inter domain networks. The process of path computation in these complex cases could be delivered to the external nodes like PCEs. Path Computation Element(PCE) architecture has been proposed for calculating end-to-end routes with computational constraints in multi domain network. In interdomain cases, path computation schemes are more prone to blocking due to the long response time of the requests. To address this issue, we propose a novel algorithm for path computation to increase the number of successful requests while minimizing the blockage in network. This will significantly improve the network utilization. The main advantage of the proposed algorithm is to reduce the overhead of message flooding, so by this method the network load could be decreased notably, which can be seen in simulation results.