Latest revision as of 22:22, 28 January 2021

Abstract

The conventional approaches to routing and bandwidth allocation, the two major components of traffic engineering, have proved insufficient to address QoS requirements of flows while optimizing utilization for complex communication networks. In this paper we consider ant colony algorithms to address this problem. Our studies show that the ant-based routing models are sensitive to initial parameters settings. Only careful adjustments of these initial parameters results in an acceptable convergence behavior. The robust behavior of the real ant compared to the routing algorithms derived from it inspires us to investigate the reasons behind the shortcomings of these algorithms. We present results from an in-depth study of ant behavior in a quest for a robust algorithm. In this work we consider a realistic environment in which multiple source-destination flows compete for resources. We study the routing and load balancing behavior that emerges and show how the behavior relates to analytical approaches. We show the results using simulations in OPNET and derive recommendations on the improvement of the ant-like algorithm

Original document

The different versions of the original document can be found in:

• http://individual.utoronto.ca/ali_tizghadam/ccece.pdf

• http://individual.utoronto.ca/ali_tizghadam/ccece.pdf,

http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000001557146,

https://www.researchgate.net/profile/Ali_Tizghadam/publication/224624579_Investigation_ofant_colonyalgorithm_in_multiple_traffic_flow_environments/links/00b495215529fa54d0000000.pdf?disableCoverPage=true,

https://ieeexplore.ieee.org/document/1557146,

http://ieeexplore.ieee.org/document/1557146,

https://academic.microsoft.com/#/detail/2172222455

• http://xplorestaging.ieee.org/ielx5/10384/33117/01557146.pdf?arnumber=1557146,

http://dx.doi.org/10.1109/ccece.2005.1557146