Anycast Routing and Wavelength Assignment Problem on WDM Network

Der-Rong DIN

doi:10.1093/ietcom/e88-b.10.3941

Anycast Routing and Wavelength Assignment Problem on WDM Network

Der-Rong DIN

Full Text Views

0

Share
Cite this

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E88-B No.10 pp.3941-3951

Publication Date: 2005/10/01

Publicized

Online ISSN

DOI: 10.1093/ietcom/e88-b.10.3941

Type of Manuscript: Special Section PAPER (Special Section on Next Generation Photonic Network Technologies)

Category

Cite this

Copy

Der-Rong DIN, "Anycast Routing and Wavelength Assignment Problem on WDM Network" in IEICE TRANSACTIONS on Communications, vol. E88-B, no. 10, pp. 3941-3951, October 2005, doi: 10.1093/ietcom/e88-b.10.3941.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.10.3941/_p

Copy

@ARTICLE{e88-b_10_3941,
author={Der-Rong DIN, },
journal={IEICE TRANSACTIONS on Communications},
title={Anycast Routing and Wavelength Assignment Problem on WDM Network},
year={2005},
volume={E88-B},
number={10},
pages={3941-3951},
abstract={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.},
keywords={},
doi={10.1093/ietcom/e88-b.10.3941},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - Anycast Routing and Wavelength Assignment Problem on WDM Network
T2 - IEICE TRANSACTIONS on Communications
SP - 3941
EP - 3951
AU - Der-Rong DIN
PY - 2005
DO - 10.1093/ietcom/e88-b.10.3941
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2005
AB - 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.
ER -