Nabil Djarallah, Nicolas Le Sauze, Helia Pouyllau, Samer Lahoud, and Bernard Cousin (2011)
Distributed E2E QoS-Based Path Computation Algorithm Over Multiple Inter-Domain Routes
In: Sixth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC 2011), BARCELONA, Spain, pages 169 - 176.
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 end-to-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 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.