Distributed Inter-Domain Multi-Constrained Routing

Abstract

With recent advances in the communication technologies (e.g. LTE and 5G), we are witnessing a deployment of a wide range of network real-time applications like telemedicine, VoIP, remote control applications for drones and cars, e-health, etc. These applications often require the verification or optimization of various quality of service (QoS) parameters, such as the delay, the error rate, the failure probability, the energy, etc. Though several algorithms have been developed to provide QoS in intra-domain networks, there are few works which are devoted to the inter-domain multi-constrained (or multi-criteria) routing. This is essentially due to the difficulty to deal with the two inter-domain major issues which are: scalability and confidentiality.In this paper, we propose an efficient and distributed multi-constrained routing algorithm for multi-operator or inter-domain networks. Our algorithm guarantees the determination of paths ϵ-close to the optimums. It is fully polynomial time and it respects the inter-domain constraints. Besides, it reduces the message exchanges by aggregating the path weights.