Distributed E2E QoS-Based Path Computation Algorithm Over Multiple Inter-Domain Routes

1 Telecommunication operators are looking for more revenues and efficient utilization of their network infrastructure resources, while satisfying consumer needs. Nevertheless, current value-added services that require the involvement of several operators are deployed without any assurance on the delivery quality of traffic, mostly due to limitations of the used interdomain routing protocol. In addition, this routing protocol provides only one route for a given destination, which limits the potential uses (e.g. inter-domain shared route protection, inter-domain load balancing, etc.). At short notice, these services could be improved by provisioning of end-to-end inter-domain connections that obey to constraints such as bandwidth, delay, jitter, and packet loss. One key solution is to compute e2e paths subject to the requested QoS constraints and over multiple interdomain routes in order to establish, thereafter, the associated inter-domain connections. Taking on these challenges, we propose an efficient distributed inter-domain algorithm that computes such constrained paths among a set of domains and exploring multiple inter-domain routes. By doing this, our algorithm not only increases success rate in delivering feasible paths, but also admits more connections and keeps a reasonable runtime.