Browse > Article

Modified AntNet Algorithm for Network Routing  

Kang, Duk-Hee (전북대학교 전자정보공학부)
Lee, Mal-Rey (전북대학교 공업기술연구소 컴퓨터공학과)
Publication Information
Journal of KIISE:Software and Applications / v.36, no.5, 2009 , pp. 396-400 More about this Journal
Abstract
During periods of large data transmission, routing selection methods are used to efficiently manage data traffic and improve the speed of transmission. One approach in routing selection is AntNet that applies the Ant algorithm in transmissions with uniform probability. However, this approach uses random selection, which can cause excessive data transmission rates and fail to optimize data This paper presents the use of the Genetic Algorithm (GA) to efficiently route and disperse data transmissions, during periods with "unnecessary weight increases for random selection". This new algorithm for improved performance provides highly accurate estimates of the transmission time and the transmission error rate.
Keywords
Antnet; Genetic Algorithm; Routing Algorithm; Load Balancing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 G. Di Caro and T. Vasilakos. Ant-SELA: Antagents and stochastic automata learn adaptive routing tables for QoS routing in ATM networks. ANTS'2000 -From Ant Colonies to Articial Ants: Second International Workshop on Ant Colony Optimization, Brussels (Belgium), September 8-9, 2000
2 Yongkyu Park. 'A Genetic Approach for Routing Problems in Optical Meshes,' Korea IITA. 1999
3 A.V. Vasilakos and G.A. Papadimitriou. A new approach to the design of reinforcement scheme for learning automata: Stochastic Estimator Learning Algorithms. Neurocomputing, 7(275), 1995
4 L. Bianchi, L. M. Gambardella, and M. Dorigo. An ant colony optimization approach to the probabilistic traveling salesman problem. In Proceedings of PPSN-VII, Seventh International Conference on Parallel Problem Solving from Nature, volume 2439 of Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany, 2002
5 G. Di Caro and M. Dorigo. Two ant colony algorithms for best-effort routing in datagram networks. In Proceedings of the Tenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS'98), pages 541. 546. IASTED/ACTA Press, 1998
6 G. Di Caro. A society of ant-like agents for adaptive routing in networks. DEA thesis in Applied Sciences, Polytechnic School, Universit´e Libre de Bruxelles, Brussels (Belgium), May 2001
7 B. Baran and R. Sosa. A new approach for AntNet routing. In Proceedings of the 9th International Conference on Computer Communications Networks, Las Vegas, USA, 2000