We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Modified Fast Bandwidth-Constrained Shortest Path Algorithm for MACO

by Amol Parikh, Nidhi Sharma, J Jeris Alan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 69 - Number 23
Year of Publication: 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 },
issue_date = { May 2013 },
volume = { 69 },
number = { 23 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 41-44 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume69/number23/12115-8512/ },
doi = { 10.5120/12115-8512 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:31:09.608073+05:30
%A Amol Parikh
%A Nidhi Sharma
%A J Jeris Alan
%T Modified Fast Bandwidth-Constrained Shortest Path Algorithm for MACO
%J International Journal of Computer Applications
%@ 0975-8887
%V 69
%N 23
%P 41-44
%D 2013
%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
  1. 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
  2. B. Zhang, Z. Zhao ,H. T. Mouftah, Fast bandwidth-constrained quality of service routing via bidirectional search, The Institution of Engineering and Technology 2007
  3. B. Zhang, H. T. Mouftah , Fast bandwidth-constrained shortest path routing algorithm, The Institution of Engineering and Technology 2006
  4. Kwang Mong Sim and Weng Hong Sun, Ant Colony Optimization for Routing and Load-Balancing: Survey and New Directions, 2003 IEEE
  5. E. Bonabeau, M. Dorigo, and G. Theraulaz, "Inspiration for optimization from social insect behavior," Nature, vol. 406, pp. 39–42, July 2000.
  6. Dorigo, M. ; Birattari, M. ; Stutzle, T. , "Ant colony optimization," Computational Intelligence Magazine, IEEE , vol. 1, no. 4, pp. 28,39, Nov. 2006
  7. Marco Dorigo, Christian Blum. , "Ant colony optimization theory : A survey ", Theoratical Computer Science, 30 May 2005
  8. 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

Computer Science
Information Sciences

Keywords

MACO - Multiple Ant Colony Optimization ACO - Ant Colony Optimization OSPF – Open Shortest Path First RIP –Routing Information Protocol

Powered by PhDFocusTM