Reinforcing probabilistic selective Quality of Service routes in dynamic irregular networks

Authors:
Abdelhamid Mellouk;Saïd Hoceïni;Mustapha Cheurfa
Affiliations:
LISSI/SCTIC Laboratory, IUT Creteil-Vitry, University Paris XII, 122, rue Paul Armangot, Vitry sur Seine 94400, France;LISSI/SCTIC Laboratory, IUT Creteil-Vitry, University Paris XII, 122, rue Paul Armangot, Vitry sur Seine 94400, France;LISSI/SCTIC Laboratory, IUT Creteil-Vitry, University Paris XII, 122, rue Paul Armangot, Vitry sur Seine 94400, France
Venue:
Computer Communications
Year:
2008

Citing 11
Cited 3

Finding the k Shortest Paths

SIAM Journal on Computing
Reinforcement Learning

Reinforcement Learning
Networking with Cognitive Packets

ICANN '02 Proceedings of the International Conference on Artificial Neural Networks
Confidence Based Dual Reinforcement Q-Routing: An adaptive online network routing algorithm

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Scalable Performance Signalling and Congestion Avoidance

Scalable Performance Signalling and Congestion Avoidance
Reinforcing reachable routes

Computer Networks: The International Journal of Computer and Telecommunications Networking
Ant Colony Optimization

Ant Colony Optimization
Policy-Based Network Management: Solutions for the Next Generation (The Morgan Kaufmann Series in Networking)

Policy-Based Network Management: Solutions for the Next Generation (The Morgan Kaufmann Series in Networking)
Adaptive quality of service-based routing approaches: development of neuro-dynamic state-dependent reinforcement learning algorithms: Research Articles

International Journal of Communication Systems
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
QRON: QoS-aware routing in overlay networks

IEEE Journal on Selected Areas in Communications

Reinforcement learning in multi-agent environment and ant colony for packet scheduling in routers

Proceedings of the 5th ACM international workshop on Mobility management and wireless access
A reinforcement learning-based lightpath establishment for service differentiation in all-optical WDM networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Inductive routing based on energy and delay metrics in wireless sensor networks

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference

Quantified Score

Hi-index	0.26

Visualization

Abstract

In the context of modern high-speed internet network, routing is often complicated by the notion of guaranteed Quality of Service (QoS), which can either be related to time, packet loss or bandwidth requirements: constraints related to various types of QoS make some routing unacceptable. Due to emerging real-time and multimedia applications, efficient routing of information packets in dynamically changing communication network requires that as the load levels, traffic patterns and topology of the network change, the routing policy also adapts. We focused in this paper on QoS based routing by developing a neuro-dynamic programming to construct dynamic state-dependent routing policies. We propose an approach based on adaptive algorithm for packet routing using reinforcement learning called N best optimal path Q-routing algorithm (NOQRA) which optimizes two criteria: cumulative cost path (or hop count if each link cost=1) and end-to-end delay. A load balancing policy depending on a dynamical traffic path probability distribution function is also defined and embodied in NOQRA to characterize the distribution of the traffic over the N best paths. Numerical results obtained with OPNET simulator for different packet interarrival times statistical distributions with different levels of traffic's load show that NOQRA gives better results compared to standard optimal path routing algorithms.