Antnet Routing Algorithm with Link Evaporation and Multiple Ant Colonies to Overcome Stagnation Problem

Antnet is a software agent-based routing algorithm that is influenced by the unsophisticated and individual ant’s emergent behaviour. The aim of this chapter is twofold, firstly to introduce improvements to the antnet routing algorithm and then to critically review the work that is done around antnet and reinforcement learning in routing applications. In this chapter a modified antnet algorithm for packet-based networks has been proposed, which offers improvement in the throughput and the average delay by detecting and dropping packets routed through the non-optimal routes. The effect of traffic fluctuations has been limited by applying boundaries to the reinforcement parameter. The round trip feedback information supplied by the software agents is reinforced by updated probability entries in the distance vector table. In addition, link usage information is also used to prevent stagnation problems. Also discussed is antnet with multiple ant colonies applied to packet switched networks. Simulation results show that the average delay experienced by data packets is reduced for evaporation for all cases when non-uniform traffic model traffic is used. However, there is no performance gain on the uniform traffic models. In addition, multiple ant colonies are applied to the packet switched networks, and results are compared with the other approaches. Results show that the throughput could be increased when compared to other schemes, but with no gain in the average packet delay time.

[1]  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.

[2]  Yue Zhang,et al.  BeeHive: An Efficient Fault-Tolerant Routing Algorithm Inspired by Honey Bee Behavior , 2004, ANTS Workshop.

[3]  Fernando M. L. Tavares,et al.  Evolution of Cognitive Networks and Self-Adaptive Communication Systems , 2013 .

[4]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[5]  Malcolm I. Heywood,et al.  Adding more intelligence to the network routing problem: AntNet and Ga-agents , 2006, Appl. Soft Comput..

[6]  D. Pham,et al.  THE BEES ALGORITHM, A NOVEL TOOL FOR COMPLEX OPTIMISATION PROBLEMS , 2006 .

[7]  Konstantinos S. Kotsopoulos.  The Adoption of Service-Oriented Architecture (SOA) in Managing Next Generation Networks (NGNs) , 2009 .

[8]  Maria Manuela Cunha,et al.  Market of Resources for Virtual Enterprise Integration , 2008 .

[9]  Youngyong Kim,et al.  Performance analysis of AntNet routing scheme with queueing approach , 2007, 2007 Asia-Pacific Conference on Communications.

[10]  Kiam Cheng How,et al.  QoS Support in the Cognitive Radio Networks , 2013 .

[11]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[12]  Muddassar Farooq,et al.  From the wisdom of the hive to intelligent routing in telecommunication networks: a step towards intelligent network management through natural engineering , 2006 .

[13]  Kaizar Amin,et al.  Agent-based distance vector routing: a resource efficient and scalable approach to routing in large communication networks , 2004, J. Syst. Softw..

[14]  Katia Passerini,et al.  E-Learning with the Network: The Importance of 'Always On' Connectivity , 2009, Int. J. Virtual Communities Soc. Netw..

[15]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[16]  Pattarasinee Bhattarakosol.  Intelligent Quality of Service Technologies and Network Management: Models for Enhancing Communication , 2010 .

[17]  Mohammad Reza Meybodi,et al.  Technological Advancements and Applications in Mobile Ad-Hoc Networks : Research Trends , 2012 .

[18]  Hussein Al-Bahadili,et al.  Simulation of a Dynamic-Noise-Dependent Probabilistic Algorithm in MANETs , 2012 .

[19]  A.N. Zincir-Heywood,et al.  Agent-based routing algorithms on a LAN , 2002, IEEE CCECE2002. Canadian Conference on Electrical and Computer Engineering. Conference Proceedings (Cat. No.02CH37373).

[20]  Ana Belén Barragáns-Martínez,et al.  Adding Personalization and Social Features to a Context-Aware Application for Mobile Tourism , 2015 .

[21]  Guy Theraulaz,et al.  Routing in Telecommunications Networks with Ant-Like Agents , 1999, IATA.

[22]  Stavros Kotsopoulos,et al.  Handbook of Research on Heterogeneous Next Generation Networking: Innovations and Platforms , 2008 .

[23]  Raul Aquino-Santos,et al.  Analyzing IEEE 802.11g and IEEE 802.16e Technologies for Single-Hop Inter-Vehicle Communication , 2010 .

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

[25]  D.T. Pham,et al.  Optimising Neural Networks for Identification of Wood Defects Using the Bees Algorithm , 2006, 2006 4th IEEE International Conference on Industrial Informatics.

[26]  R.A. Arnous,et al.  Improving the load balancing within the data network via modified AntNet algorithm , 2007, 2007 ITI 5th International Conference on Information and Communications Technology.

[27]  Dusˇan Teodorovic,et al.  MODELING BY MULTI-AGENT SYSTEMS : A SWARM INTELLIGENCE APPROACH , 2003 .

[28]  Benjamín Barán,et al.  A new approach for AntNet routing , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[29]  Dulal C. Kar,et al.  Applied Cryptography for Security and Privacy in Wireless Sensor Networks , 2009, Int. J. Inf. Secur. Priv..

[30]  Nikos Parlavantzas,et al.  Niche : A Platform for Self-Managing Distributed Applications , 2011 .

[31]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[32]  Piet Van Mieghem,et al.  Responsible Editor: A. Kshemkalyani , 2006 .

[33]  Philippe Roose,et al.  A Semantic Generic Profile for Multimedia Document Adaptation , 2013 .

[34]  Alfred Wai-Sing Loo,et al.  Distributed Computing Innovations for Business, Engineering, and Science , 2012 .

[35]  Benjamín Barán.  Improved AntNet routing , 2001, SIGCOMM LA '01.

[36]  Ramesh Subramanian,et al.  Peer to Peer Computing: The Evolution of a Disruptive Technology , 2005 .

[37]  Phan Cong-vinh.  Formal and Practical Aspects of Autonomic Computing and Networking: Specification, Development, and Verification , 2011 .

[38]  Masaharu Munetomo,et al.  Empirical investigations on the genetic adaptive routing algorithm in the Internet , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[39]  Li-Pei Wong,et al.  Bee Colony Optimization with local search for traveling salesman problem , 2008, INDIN 2008.

[40]  Devika Subramanian,et al.  Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks , 1997, IJCAI.

[41]  U. Lee,et al.  Advances in Vehicular Ad-Hoc Networks : Developments and Challenges , 2010 .

[42]  Mario Pickavet,et al.  Implementation and evaluation of AntNet, a distributed shortest-path algorithm , 2005, Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop (AICT/SAPIR/ELETE'05).

[43]  Malcolm I. Heywood,et al.  Intelligent Packets For Dynamic Network Routing Using Distributed Genetic Algorithm , 2002, GECCO.

[44]  Michael Bursell.  Security and Trust in P2P Systems , 2005 .

[45]  Xi Cheng,et al.  A study of genetic ant routing algorithm , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[46]  J. Deneubourg,et al.  Trails and U-turns in the Selection of a Path by the Ant Lasius niger , 1992 .

[47]  S. Appleby,et al.  Mobile Software Agents for Control in Telecommunications Networks , 2000 .

[48]  Horst F. Wedde,et al.  A comprehensive review of nature inspired routing algorithms for fixed telecommunication networks , 2006, J. Syst. Archit..

[49]  Zabih Ghassemlooy,et al.  Comparison of the Q-routing and shortest path routing algorithm , 2004 .

[50]  Horst F. Wedde,et al.  BeeHive: New Ideas for Developing Routing Algorithms Inspired by Honey Bee Behavior , 2005 .

[51]  Zabih Ghassemlooy,et al.  Improved antnet routing algorithm for packet switching , 2005 .

[52]  Marco Dorigo,et al.  Two Ant Colony Algorithms for Best-Effort Routing in Datagram Networks , 1998 .

[53]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[54]  Mahmoud Naghibzadeh,et al.  A novel approach to distributed routing by super-AntNet , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[55]  K. Ganesh,et al.  Genetic Algorithm to Solve Multi-Period, Multi-Product, Bi-Echelon Supply Chain Network Design Problem , 2009, Int. J. Inf. Syst. Supply Chain Manag..

[56]  David Evans,et al.  When Ants Attack: Security Issues for Stigmergic Systems , 2002 .

[57]  Ashok Kumar Turuk,et al.  Energy Conservation Issues and Challenges in MANETs , 2012 .

[58]  K. M. Sim,et al.  Multiple ant-colony optimization for network routing , 2002, First International Symposium on Cyber Worlds, 2002. Proceedings..

[59]  Horst F. Wedde,et al.  A Performance Evaluation Framework for Nature Inspired Routing Algorithms , 2005, EvoWorkshops.