Anycast routing and wavelength assignment problem on WDM network

研究成果: Article

36 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)3941-3951
頁數11
期刊IEICE Transactions on Communications
E88-B
發行號10
DOIs
出版狀態Published - 2005 十月

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

指紋 深入研究「Anycast routing and wavelength assignment problem on WDM network」主題。共同形成了獨特的指紋。

  • 引用此