By Topic

An ant algorithm for single-hop wavelength assignment in WDM mesh network

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

1 Author(s)
Tan Saw Chin ; Fac. of Inf. Technol., Multimedia Univ., Selangor DarulEhsan

A RWA linear programming formulation was formulated and ILP solver was used along with good approximation techniques (heuristic) to solve the static RWA problem The objective was to maximize the one hop traffic, given a set of lightpath requests/traffic demand. However, the proposed heuristic has the limitation of stagnation. Thus we applied ant colony optimization (ACO) combined with heuristic algorithm to solve the assignment problem to obtain best assignment with highest objective value. The ACO based algorithm can outperform the comparison scheme and provide a better performance and more reliable than the proposed heuristic and ILP solver. The claim made in the paper for the proposed new heuristic and ACO are supported by experimental results

Published in:

Tools with Artificial Intelligence, 2005. ICTAI 05. 17th IEEE International Conference on

Date of Conference:

16-16 Nov. 2005