N-Best Optimal Path Ant Routing Algorithm for State-Dependent N Best Quality of service Routes in

As routing mechanism is a key to success of future communication networking, computing constrained shortest paths is fundamental to some important network functions such as QoS routing or traffic engineering. The problem is to And feasible paths satisfying QoS requirements and optimizing resource usage and degrading gracefully during periods of heavy load. This paper introduces a Quality of Service (QoS) routing protocol aimed to offload congested links while optimizing end-to-end delay. The proposed algorithm, called NOPAR "N-best Optimal Paths Ant Routing", extends the earlier N best Optimal path Q Routing Algorithm (NOQRA) by integrating the exploration and reinforcement function inspired by Ant Colony Optimization approaches. NOPAR uses a model combining both a stochastic planned pre-navigation for the exploration phase (forward ant) and a deterministic approach for the backward phase (backward ant). The introduced algorithm is compared with earlier version of NOQRA and the well-known routing algorithms such as SPF or OSPF. The performance analysis under simulation environment using OPNET demonstrates that NOPAR performs better than the classical approach especially over load high networks or link failures conditions.

[1]  Andrzej Jajszczyk,et al.  Grade-of-service-based routing in optical networks [Quality-of-Service-Based Routing Algorithms for Heterogeneous Networks] , 2007, IEEE Communications Magazine.

[2]  Chris Greenhalgh,et al.  The DiveBone—an application-level network architecture for Internet-based CVEs , 1999, VRST '99.

[3]  Charles L. Hedrick,et al.  Routing Information Protocol , 1988, RFC.

[4]  Naiming Shen,et al.  Calculating Interior Gateway Protocol (IGP) Routes Over Traffic Engineering Tunnels , 2004, RFC.

[5]  Guillermo Barrenetxea,et al.  Distributed routing algorithms for sensor networks , 2006 .

[6]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[7]  Gianni A. Di Caro,et al.  AntNet: A Mobile Agents Approach to Adaptive Routing , 1999 .

[8]  Michael L. Littman,et al.  Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach , 1993, NIPS.

[9]  Mario Gerla,et al.  Internet QoS Routing Using the Bellman-Ford Algorithm , 1998, HPN.

[10]  M. Gopal,et al.  Topology distribution cost vs. efficient routing in large networks , 1990, SIGCOMM 1990.

[11]  Said Hoceini,et al.  Adaptive quality of service-based routing approaches: development of neuro-dynamic state-dependent reinforcement learning algorithms , 2007, Int. J. Commun. Syst..

[12]  Marco Dorigo,et al.  Ant colony optimization and its application to adaptive routing in telecommunication networks , 2004 .

[13]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[14]  J. Moy,et al.  Open Shortest Path First version 2 , 1998 .

[15]  Risto Miikkulainen,et al.  Confidence Based Dual Reinforcement Q-Routing: An adaptive online network routing algorithm , 1999, IJCAI.

[16]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[17]  Leonid Peshkin,et al.  Reinforcement learning for adaptive routing , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).

[18]  A. Mellouk,et al.  Reinforcing State-Dependent N Best Quality of Service Routes in Communication Networks , 2007, 2007 Workshop on High Performance Switching and Routing.

[19]  Kwang Mong Sim,et al.  Ant colony optimization for routing and load-balancing: survey and new directions , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[20]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[21]  Said Hoceini,et al.  K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks , 2005, ICN.

[22]  Azzedine Boukerche,et al.  Analysis of a Randomized Congestion Control Scheme with DSDV Routing in ad Hoc Wireless Networks , 2001, J. Parallel Distributed Comput..

[23]  Azzedine Boukerche,et al.  Quality of service based routing algorithms for heterogeneous networks [Guest editorial] , 2007, IEEE Communications Magazine.

[24]  Bilhanan Silverajan,et al.  A Service Discovery Model for Wireless and Mobile Terminals in IPv6 , 2003, PWC.

[25]  Stephen B. Wicker,et al.  Termite: a swarm intelligent routing algorithm for mobile wireless ad-hoc networks , 2005 .