Research Article
Modified Fast Bandwidth-Constrained Shortest Path Algorithm for MACO
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 69 - Issue 23 |
| Published: May 2013 |
| Authors: Amol Parikh, Nidhi Sharma, J Jeris Alan |
10.5120/12115-8512
|
Amol Parikh, Nidhi Sharma, J Jeris Alan . Modified Fast Bandwidth-Constrained Shortest Path Algorithm for MACO. International Journal of Computer Applications. 69, 23 (May 2013), 41-44. DOI=10.5120/12115-8512
@article{ 10.5120/12115-8512,
author = { Amol Parikh,Nidhi Sharma,J Jeris Alan },
title = { Modified Fast Bandwidth-Constrained Shortest Path Algorithm for MACO },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 69 },
number = { 23 },
pages = { 41-44 },
doi = { 10.5120/12115-8512 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A Amol Parikh
%A Nidhi Sharma
%A J Jeris Alan
%T Modified Fast Bandwidth-Constrained Shortest Path Algorithm for MACO%T
%J International Journal of Computer Applications
%V 69
%N 23
%P 41-44
%R 10.5120/12115-8512
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Ant Colony Optimization is a probabilistic technique for finding the optimal path for reaching a destination using graphs. This algorithm was further developed to introduce the concept of Multiple Ant Colony Optimization technique in which ants were classified into various families that worked to provide optimal path solutions to the destination for their own family. This paper aims at proposing an algorithm for reducing the congestion in a network using a modified Fast Bandwidth-Constrained shortest path routing algorithm.
References
- Kwang Mong Sim, Weng Hong Sun, Multiple Ant-Colony Optimization for Network Routing, Proceedings of the First International Symposium on Cyber Worlds (CWí02), IEEE CSE 2002
- B. Zhang, Z. Zhao ,H. T. Mouftah, Fast bandwidth-constrained quality of service routing via bidirectional search, The Institution of Engineering and Technology 2007
- B. Zhang, H. T. Mouftah , Fast bandwidth-constrained shortest path routing algorithm, The Institution of Engineering and Technology 2006
- Kwang Mong Sim and Weng Hong Sun, Ant Colony Optimization for Routing and Load-Balancing: Survey and New Directions, 2003 IEEE
- E. Bonabeau, M. Dorigo, and G. Theraulaz, "Inspiration for optimization from social insect behavior," Nature, vol. 406, pp. 39–42, July 2000.
- Dorigo, M. ; Birattari, M. ; Stutzle, T. , "Ant colony optimization," Computational Intelligence Magazine, IEEE , vol. 1, no. 4, pp. 28,39, Nov. 2006
- Marco Dorigo, Christian Blum. , "Ant colony optimization theory : A survey ", Theoratical Computer Science, 30 May 2005
- Saad Ghaleb Yaseen, Nada M. A. AL-Slamy, "Ant colony optimization", International Journal of Computer Science and Network Security, VOL. 8No 6. June 2008
Index Terms
Keywords