ACO a Metaheuristic Technique for solving Network Problems and a Precise of Network Models

Manila Pahwa, Dharminder Kumar

Abstract


With the growing importance of telecommunication and internet, more complex networked systems are being designed and developed. The challenges of dealing with vast complexity of networking problems such as load balancing, routing and network congestion accentuate the need of more sophisticated technique to solve these problems. Ant colony optimisation (ACO) is one of the best and efficient solutions to cope up with these problems. This paper presents the following:- Theoretical study of Metaheuristic technique commonly named as Ant Colony Optimisation (ACO) and how it is better than conventional algorithms, An Overview of ACO models and the reason behind being ACO better than other  Conventional algorithms?


Keywords


ACO, Congestion, Combinatorial problems. Load balancing, Metaheuristic

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Subscribe to Print Journals

 IJAIKD is currently Indexed By   


 http://rgjournals.com/public/site/images/mittalberi/scholar_logo_lg_2011.gif  Journal Seek