Abstract
Telecommunication and network systems have become more complex in recent years. Routing and optimal path finding are some of the important network problems. Traditional routing methods are not capable to satisfy new routing demands. Swarm intelligence is a relatively new approach to problem solving which provides a basis with which it explores problem solving without providing a global model. A Random Walk approach is similar to a drunkard moving along a sidewalk from one lamp post to another where each step is either backwards or forwards based on some probability. In this paper a hybrid algorithm is proposed that combines Ant Colony Optimization algorithm and Random Walk. The overall time complexity of the proposed model is compared with the existing approaches like distance vector routing and Link State Routing. The new method is found to be better than the existing routing methods in terms of complexity and consistency.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Sim, K.M., Sun, W.H.: Ant colony optimization for routing and load-balancing: survey and new directions. IEEE Transactions on Systems Man, and Cybernetics, Part A 33(5), 560–572 (2003)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A cooperative learning approach to the traveling salesman problem. Journal of IEEE Transactions on Evolutionary Computation (1997)
Randall, M., Lewis, A.: A Parallel Implementation of Ant Colony Optimization. Journal of Parallel and Distributed Computing 62(9), 1421–1432 (2002)
Dorigo, M., Birattari, M., Stutzle, T.: Ant Colony Optimization. IEEE Computational Intelligence Magazine (2009)
Mukherjee, D., Sriyank: Ant Colony Optimization Technique Applied in netwrk Routing Problem. International Journal of Computer Application 15, Article 13 (2010)
Hung, K.-S., Su, S.-F., Lee, Z.-J.: Improving Ant Colony Optimization Algorithms for Solving Traveling Salesman Problems. Journal of Advanced Computational Intelligence and Intelligent informatics 11(4) (2007)
Liu, H., Li, P., Wen, Y.: Parallel Ant colony Optimization Algorithm. In: Proceedings of the 6th World Congress on Intelligent Control and Automation, China (2006)
Zhao, D., Luo, L., Zhang, K.: An Improved Ant Colony Optimization for communication network routing problem. In: Bio-Inspired Computing, BIC-TA (2009)
Burioni, R., Cassi, D.: Random walks on graphs: ideas, techniques and results. Journal of Physics A: Mathematical and General 38(8) (2005)
Lawrence, R.: A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proceedings of the IEEE 77 (1989)
Aldous, D.: An introduction to covering problems for random walks on graphs. Journal of Theorotical Probability 2(1), 87–89 (1989)
Hildebrand, M.V.: A survey of results on random random walks on finite groups. Probability Surveys 2, 33–63 (2005)
Tian, H., Shen, H., Matsuzawa, T.: Random Walk Routing for Wireless Sensor networks. In: Proceedings of the Sixth International Conference on Parallel Computing, Applications and Technologies (2005)
Kim, S.-S., Smith, A.E., Hong, S.-J.: Dynamic Load Balancing Using Ant Colony Approach in Micro-cellular Mobile Communication Systems. In: Advances in Metaheuristics for Hard Optimization, pp. 137–152 (2008)
Schoonderwoerd, R., Holland, O., Bruten, J., Rothkrantz, L.: Ant-Based Load Balancing in Telecommunications Networks. Adaptive Behaviour 5(2), 169–207 (1996)
Blum, C.: Ant Colony Optimization:Introduction and Hybridizations. In: 7th International conference on Hybrid Intelligent Systems, HIS 2007, pp. 24–29 (2007)
Gutjahr, W.J.: First steps to the runtime complexity analysis of ant colony optimization. Computers and Operations Research 35(9), 2711–2727 (2008)
Huang, H., Wu, C.-G., Hao, Z.-F.: A Pheromone-Rate-Based Analysis on the convergence Time of ACO Algorithm. IEEE Transactions on Systems,Man and Cybernetics-Part B:Cybernetics 39(4) (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Bhatia, N., Kundra, R., Chaurasia, A., Chandra, S. (2012). Load Balancing Using Hybrid ACO - Random Walk Approach. In: Suzuki, J., Nakano, T. (eds) Bio-Inspired Models of Network, Information, and Computing Systems. BIONETICS 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32615-8_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-32615-8_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32614-1
Online ISBN: 978-3-642-32615-8
eBook Packages: Computer ScienceComputer Science (R0)