QoS Swarm State Dependent Routing for Irregular Traffic in Telecommunication Networks

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 the end-to-end delay packet transmission. The algorithm presented here is based on our earlier adaptive routing system and uses a model combining both a stochastic planned pre-navigation for the exploration phase and a deterministic approach for the backward phase. Numerical results obtained with OPNET simulator for different levels of traffic´s load show good performances of our approach compared the classical non adaptive algorithms in a high dynamic environment.