Load balancing using hybrid ACO - Random walk approach

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

Cite

CITATION STYLE

APA

Bhatia, N., Kundra, R., Chaurasia, A., & Chandra, S. (2012). Load balancing using hybrid ACO - Random walk approach. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 87 LNICST, pp. 402–412). https://doi.org/10.1007/978-3-642-32615-8_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free