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

Author

Chin, Tan Saw

Author_Institution

Fac. of Inf. Technol., Multimedia Univ., Selangor DarulEhsan

fYear

2005

fDate

16-16 Nov. 2005

Lastpage

117

Abstract

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

Keywords

artificial life; integer programming; linear programming; telecommunication traffic; wavelength division multiplexing; ant colony optimization; approximation techniques; heuristic algorithm; integer linear programming solver; routing and wavelength assignment linear programming; single-hop wavelength assignment; wavelength division multiplexing mesh network; Heuristic algorithms; Information technology; Intelligent networks; Mesh networks; Optical fiber networks; Optimization methods; WDM networks; Wavelength assignment; Wavelength division multiplexing; Wavelength routing;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Hong Kong

ISSN

1082-3409

Print_ISBN

0-7695-2488-5

Type

conf

DOI

10.1109/ICTAI.2005.33

Filename

1562924