A Bio-Inspired Quality of Service (QoS) Routing Algorithm

We propose in this letter a bio-inspired Quality of Service (QoS) routing algorithm that is based on the trial/error paradigm combined with a continuous adaptive function to optimize three QoS criteria: static cumulative cost path and dynamic end-to-end delay and residual bandwidth. Our proposed approach uses a model that combines a stochastic planned pre-navigation for the exploration phase and a deterministic approach for the backward phase. We adopt a unified framework of online learning to develop a cost function. We evaluated the performance of our QoS-routing algorithm and the simulation results demonstrate substantial performance improvements for networks with dynamically changing traffic.

[1]  Piet Van Mieghem,et al.  Conditions that impact the complexity of QoS routing , 2005, IEEE/ACM Transactions on Networking.

[2]  Richard G. Baraniuk,et al.  pathChirp: Efficient available bandwidth estimation for network paths , 2003 .

[3]  Andrew G. Barto,et al.  Reinforcement learning , 1998 .

[4]  Richard S. Sutton,et al.  Reinforcement Learning , 1992, Handbook of Machine Learning.

[5]  Özgür B. Akan,et al.  A survey on bio-inspired networking , 2010, Comput. Networks.

[6]  M. I. Henig.  Vector-Valued Dynamic Programming , 1983 .

[7]  Muddassar Farooq,et al.  Swarm intelligence based routing protocol for wireless sensor networks: Survey and future directions , 2011, Inf. Sci..

[8]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[9]  Roberto Montemanni,et al.  Design patterns from biology for distributed computing , 2006, TAAS.

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

[11]  Ruppa K. Thulasiram,et al.  HOPNET: A hybrid ant colony optimization routing algorithm for mobile ad hoc network , 2009, Ad Hoc Networks.

[12]  Sherali Zeadally,et al.  Design and performance analysis of an inductive QoS routing algorithm , 2009, Comput. Commun..

[13]  I︠a︡. Z. T︠S︡ypkin,et al.  Foundations of the theory of learning systems , 1973 .

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Léon Bottou,et al.  Stochastic Learning , 2003, Advanced Lectures on Machine Learning.

[16]  Walter Willinger,et al.  Mathematics and the Internet: A Source of Enormous Confusion and Great Potential , 2009, The Best Writing on Mathematics 2010.

[17]  Horst F. Wedde,et al.  BeeAdHoc: an energy efficient routing algorithm for mobile ad hoc networks inspired by bee behavior , 2005, GECCO '05.

[18]  Sartaj Sahni,et al.  Data Structures, Algorithms, and Applications in C++ , 1997 .