Distributed E2E QoS-Based Path Computation Algorithm over Multiple Inter-domain Routes

Abstract

Abstract-1 Internet usages have changed with the emergence of value added services relying on a higher interactivity and needs for a better quality of experience (QoE). Telecommunication operators have to face a continuing growth of new types of Internet traffic (video, games, telepresence, etc.) imposing not only a more efficient utilization of their network infrastructure resources, but also the generation of new revenues to pursue investments and sustain the increasing demand. Such services generally cross multiple domains, but inter-domain routing protocols still have some limitations in terms of service assurance. For example, BGP's single route announce for a destination limits potential traffic engineering features (e.g. no quality of service price/efficiency optimisation, inter-domain shared route protection, inter-domain load balancing, etc.). In order to provision endto-end inter-domain connections that obey to constraints such as bandwidth, delay, jitter, and packet loss for these services, an interesting approach is to compute end-to-end (e2e) paths over multiple inter-domain routes. This will allow establishing more efficiently the inter-domain connections with respect to requested QoS constraints and sharing these constraints (and associated revenues) among multiple operators to globally accept more demands in the system, while keep satisfying the customer QoE. To address these challenges, we propose an efficient distributed inter-domain algorithm that computes such constrained paths among a set of domains, exploring multiple inter-domain routes. We demonstrate that our algorithm not only increases success rate in delivering feasible paths, but also admits more connections and keeps a reasonable runtime.

An Overview on Inter-Domain Routing with Quality of Service*

“…This section presents a distributed inter-domain end-to-end QoS based algorithm (Djarallah et al, 2011)…”

Maximum size of the pareto cost sets for multi-constrained optimal routing

“…Finding the multiple metric-constrained paths is known as the multi-constrained path problem (MCPP) in the literature. It can also be turned into an optimality problem [5,6]. Several methods have been proposed to solve the MCPP.…”

“…It can also be turned into an optimality problem [5,6]. Several methods have been proposed to solve the MCPP.…”

“…Several methods have been proposed to solve the MCPP. Djarallah et al [5] represented the metrics as a vector structure of the weight parameters. Using this vector, they treated the metrics as noncomposite numbers, which require discrete computation for each metric.…”