By Topic

Improved-AntNet: ACO Routing Algorithm in Practice

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Chandra, S. ; Dept. of Comput. Sci. & Inf. Technol., Jaypee Univ. of Inf. Technol., Solan ; Shrivastava, U. ; Vaish, Rajan ; Dixit, S.
more authors

The objective of this paper is to introduce the Improved-Ant Colony Optimization in Virtual Circuit Networks. We discuss AntNet, an improved version of Ant Colony applied as a routing protocol. A new model is proposed that introduces the application of Ant Colony Optimization in the area of communication network. The proposed model is analyzed with the application of shortest path algorithm in Virtual Private Network. We also discuss the drawbacks of other optimization techniques that paved for the use of Ant Colony Optimization as an efficient optimization technique. In finding the optimal path, the proposed model is found to perform better than the OSPF.

Published in:

Computer Modelling and Simulation, 2009. UKSIM '09. 11th International Conference on

Date of Conference:

25-27 March 2009