Simulation study of a heuristic near-maximum ant-based dynamic routing


Tan, Chin and Fouad, Abbou and Ewe, Tat (2008) Simulation study of a heuristic near-maximum ant-based dynamic routing. INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 5 (3). pp. 230-233.

Full text not available from this repository.


A new ant-based routing is proposed for solving dynamic routing and wavelength assignment in mesh WDM network under the wavelength continuity constraint. The ant algorithm favors paths with maximum number of available wavelengths between two nodes, resulting in improved load balancing and less congested shortest path. The simulation results showed that the proposed ant-based routing algorithm is highly reliable in the sense that the number of ants used is predictable to achieve a steady performance in terms of blocking probability.

Item Type: Article
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 08 Sep 2011 03:16
Last Modified: 08 Sep 2011 03:16


Downloads per month over past year

View ItemEdit (login required)