Anycast Routing Problem on WDM Ring Network

Der-Rong DIN

doi:10.1093/ietcom/e88-b.4.1347

Anycast Routing Problem on WDM Ring 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 WDM anycast routing problem (WARP) is to find a set of light-paths, one for each source, for anycasting messages to 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 WARP is to minimize the number of used wavelengths. In this paper, the WARP is formulated and studied, since WARP is NP-hard, several heuristic algorithms and a hybrid method which combines heuristic and simulated annealing techniques are proposed to solve it. These algorithms are used to find the close-to-optimal solution. Simulated results show that the proposed algorithms are able to achieve good performance.

Publication: IEICE TRANSACTIONS on Communications Vol.E88-B No.4 pp.1347-1354

Publication Date: 2005/04/01

Publicized

Online ISSN

DOI: 10.1093/ietcom/e88-b.4.1347

Type of Manuscript: Special Section PAPER (Special Section on Internet Technology V)

Category

Cite this

Copy

Der-Rong DIN, "Anycast Routing Problem on WDM Ring Network" in IEICE TRANSACTIONS on Communications, vol. E88-B, no. 4, pp. 1347-1354, April 2005, doi: 10.1093/ietcom/e88-b.4.1347.
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 WDM anycast routing problem (WARP) is to find a set of light-paths, one for each source, for anycasting messages to 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 WARP is to minimize the number of used wavelengths. In this paper, the WARP is formulated and studied, since WARP is NP-hard, several heuristic algorithms and a hybrid method which combines heuristic and simulated annealing techniques are proposed to solve it. These algorithms are used to find the close-to-optimal solution. Simulated results show that the proposed algorithms are able to achieve good performance.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.4.1347/_p

Copy

@ARTICLE{e88-b_4_1347,
author={Der-Rong DIN, },
journal={IEICE TRANSACTIONS on Communications},
title={Anycast Routing Problem on WDM Ring Network},
year={2005},
volume={E88-B},
number={4},
pages={1347-1354},
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 WDM anycast routing problem (WARP) is to find a set of light-paths, one for each source, for anycasting messages to 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 WARP is to minimize the number of used wavelengths. In this paper, the WARP is formulated and studied, since WARP is NP-hard, several heuristic algorithms and a hybrid method which combines heuristic and simulated annealing techniques are proposed to solve it. These algorithms are used to find the close-to-optimal solution. Simulated results show that the proposed algorithms are able to achieve good performance.},
keywords={},
doi={10.1093/ietcom/e88-b.4.1347},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - Anycast Routing Problem on WDM Ring Network
T2 - IEICE TRANSACTIONS on Communications
SP - 1347
EP - 1354
AU - Der-Rong DIN
PY - 2005
DO - 10.1093/ietcom/e88-b.4.1347
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 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 WDM anycast routing problem (WARP) is to find a set of light-paths, one for each source, for anycasting messages to 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 WARP is to minimize the number of used wavelengths. In this paper, the WARP is formulated and studied, since WARP is NP-hard, several heuristic algorithms and a hybrid method which combines heuristic and simulated annealing techniques are proposed to solve it. These algorithms are used to find the close-to-optimal solution. Simulated results show that the proposed algorithms are able to achieve good performance.
ER -