Anycast Routing and Wavelength Assignment Problem on WDM Network(<Special Section>Next Generation Photonic Network Technologies)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 一般社団法人電子情報通信学会の論文
• 2005-10-01

著者

• Din Der-rong

  Department Of Computer Science And Information Engineering Changhua University Of Education

関連論文

• Hybrid Method for Solving Dual-Homing Cell Assignment Problem on Two-Level Wireless ATM Network(Network Theory)(Multi-dimensional Mobile Information Networks)
• A Solution Model of Integrating Cells of PCS to Switches in Wireless ATM Network
• Anycast Routing and Wavelength Assignment Problem on WDM Network(Next Generation Photonic Network Technologies)

スポンサーリンク