Design and performance analysis of an inductive QoS routing algorithm

  • Authors:

  • Abdelhamid Mellouk;Saïd Hoceïni;Sherali Zeadally

  • Affiliations:

  • LISSI Laboratory, University of Paris 12-Val de Marne, Paris-Est University, 122 rue Paul Armangot, Vitry sur Seine 94400, France;LISSI Laboratory, University of Paris 12-Val de Marne, Paris-Est University, 122 rue Paul Armangot, Vitry sur Seine 94400, France;Dept. of Comp. Sci. and Inf. Tech., University of The District of Columbia, Washington, DC 20008, USA

  • Venue:
  • Computer Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.24

Visualization

Abstract

Routing mechanism is key to the success of large-scale, distributed communication and heterogeneous networks. Consequently, computing constrained shortest paths is fundamental to some important network functions such as QoS routing and traffic engineering. The problem of QoS routing with multiple additive constraints is known to be NP-complete but researchers have been designing heuristics and approximation algorithms for multi-constrained paths algorithms to propose pseudo-polynomial time algorithms. This paper introduces a polynomial time approximation quality of service (QoS) routing algorithm and constructs dynamic state-dependent routing policies. The proposed algorithm uses an inductive approach based on trial/error paradigm combined with swarm adaptive approaches to optimize lexicographically various QoS criteria. The originality of our approach is based on the fact that our system is capable to take into account the dynamics of the network where no model of the network dynamics is assumed initially. Our approach samples, estimates, and builds the model of pertinent aspects of the environment which is very important in heterogeneous networks. The algorithm uses a model that combines both a stochastic planned pre-navigation for the exploration phase and a deterministic approach for the backward phase. Multiple paths are searched in parallel to find the K best qualified ones. To improve the overall network performance, a load adaptive balancing policy is defined and depends on a dynamic traffic path probability distribution function. We conducted a performance analysis of the proposed QoS routing algorithm using OPNET based on a platform simulated network. The obtained results demonstrate substantial performance improvements as well as the benefits of learning approaches over networks with dynamically changing traffic.