Dynamic routing and wavelength assignment in WDM networks with ant-based agents

12Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose an ant-based algorithm for dynamic routing and wavelength assignment (RWA) in WDM optical networks under the wavelength continuity constraint. By adopting a new routing table structure and keeping a number of ants in the network to cooperatively explore the network states and continuously update the routing tables, our new ant algorithm can efficiently support the ants' foraging tasks of route selection and wavelength assignment in WDM networks, and allow a connection to be setup promptly on arrival with a small setup time. Extensive simulation results based on the ns-2 network simulator indicate that the proposed algorithm can adapt well to traffic variations and achieves a lower blocking probability than the fixed routing algorithm. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Ngo, S. H., Jiang, X., Horiguchi, S., & Guo, M. (2004). Dynamic routing and wavelength assignment in WDM networks with ant-based agents. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3207, 829–838. https://doi.org/10.1007/978-3-540-30121-9_79

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free