Dynamic Routing and Wavelength Assignment in WDM Networks with AntBased Agents.pdfVIP

Dynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents 1 1 1 2 Son-Hong Ngo , Xiaohong Jiang , Susumu Horiguchi , and Minyi Guo 1 Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Japan {sonhong,jiang,hori}@jaist.ac.jp 2 School of Computer Science and Engineering, The University of Aizu, Japan minyi@u-aizu.ac.jp Abstract. In this paper, we propose an ant-based algorithm for dynamic routing and wavelength assignment (RWA) in WDM optical networks under the wave- length 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 ef- ficiently support the ants’ foraging tasks of route selection and wavelength as- signment 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 al- gorithm. 1 Introduction All optical networks that adopt wavelength-division-multiplexing (WDM) technology have a huge bandwidth capacity, and they show promise as the backbone of the next generation Internet. In all optical networks, data are routed in optical channels called lightpaths. The Routing and Wavelength Assignment (RWA) problem is how to de- termine both a route and wavelengths for a connection request. Without wavelength conversion c