Anycast Routing and Wavelength Assignment Problem on WDM Network

Der-Rong DIN  

Publication
IEICE TRANSACTIONS on Communications   Vol.E88-B   No.10   pp.3941-3951
Publication Date: 2005/10/01
Online ISSN: 
DOI: 10.1093/ietcom/e88-b.10.3941
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Section on Next Generation Photonic Network Technologies)
Category: 
Keyword: 
anycast,  routing and wavelength assignment,  NP-hard,  WDM,  genetic algorithm,  

Full Text: PDF>>
Buy this Article




Summary: 
Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network. When the physical network and the set of anycast requests are given, the Anycast Routing and Wavelength Assignment (ARWA) problem is to find a set of light-paths, one for each source, for anycasting messages to any one of the member in the anycast destination group such that not any path using the same wavelength passes through the same link. The goal of the ARWA problem is to minimize the number of used wavelengths. In this paper, the ARWA problem is formulated and studied; since ARWA problem is NP-hard, a three-phase genetic algorithm is proposed to solve it. This algorithm is used to find the close-to-optimal solution. Simulated results show that the proposed algorithm is able to achieve good performance.