![](/images/graphics-bg.png)
Simulation study of a heuristic near-maximum ant-based dynamic routing
Joint Authors
Source
The International Arab Journal of Information Technology
Issue
Vol. 5, Issue 3 (31 Jul. 2008), pp.230-233, 4 p.
Publisher
Publication Date
2008-07-31
Country of Publication
Jordan
No. of Pages
4
Main Subjects
Information Technology and Computer Science
Abstract EN
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.
American Psychological Association (APA)
Chin, Tan& Abbou, Fuad& Tat, Ewe. 2008. Simulation study of a heuristic near-maximum ant-based dynamic routing. The International Arab Journal of Information Technology،Vol. 5, no. 3, pp.230-233.
https://search.emarefa.net/detail/BIM-11438
Modern Language Association (MLA)
Tat, Ewe…[et al.]. Simulation study of a heuristic near-maximum ant-based dynamic routing. The International Arab Journal of Information Technology Vol. 5, no. 3 (Jul. 2008), pp.230-233.
https://search.emarefa.net/detail/BIM-11438
American Medical Association (AMA)
Chin, Tan& Abbou, Fuad& Tat, Ewe. Simulation study of a heuristic near-maximum ant-based dynamic routing. The International Arab Journal of Information Technology. 2008. Vol. 5, no. 3, pp.230-233.
https://search.emarefa.net/detail/BIM-11438
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 232-333
Record ID
BIM-11438