Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks

Johannes Hamonangan SIREGAR; Yongbing ZHANG; Hideaki TAKAGI

doi:10.1093/ietcom/e88-b.1.219

Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks

Johannes Hamonangan SIREGAR, Yongbing ZHANG, Hideaki TAKAGI

Full Text Views

0

Share
Cite this

Summary :

We consider the multicast routing problem for large-scale wavelength division multiplexing (WDM) optical networks where transmission requests are established by point-to-multipoint connections. To realize multicast routing in WDM optical networks, some nodes need to have light (optical) splitting capability. A node with splitting capability can forward an incoming message to more than one output link. We consider the problem of minimizing the number of split-capable nodes in the network for a given set of multicast requests. The number of wavelengths is fixed and given a priori. We propose a genetic algorithm that exploits the combination of alternative shortest paths for the given multicast requests in order to minimize the number of required split-capable nodes. This algorithm is examined for two realistic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan. Our experimental results show that the proposed algorithm can reduce more than 10% of split-capable nodes compared with other routing algorithms whereby the optimization for the split-capable node placement is not taken into account.

Publication: IEICE TRANSACTIONS on Communications Vol.E88-B No.1 pp.219-226

Publication Date: 2005/01/01

Publicized

Online ISSN

DOI: 10.1093/ietcom/e88-b.1.219

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Johannes Hamonangan SIREGAR, Yongbing ZHANG, Hideaki TAKAGI, "Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks" in IEICE TRANSACTIONS on Communications, vol. E88-B, no. 1, pp. 219-226, January 2005, doi: 10.1093/ietcom/e88-b.1.219.
Abstract: We consider the multicast routing problem for large-scale wavelength division multiplexing (WDM) optical networks where transmission requests are established by point-to-multipoint connections. To realize multicast routing in WDM optical networks, some nodes need to have light (optical) splitting capability. A node with splitting capability can forward an incoming message to more than one output link. We consider the problem of minimizing the number of split-capable nodes in the network for a given set of multicast requests. The number of wavelengths is fixed and given a priori. We propose a genetic algorithm that exploits the combination of alternative shortest paths for the given multicast requests in order to minimize the number of required split-capable nodes. This algorithm is examined for two realistic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan. Our experimental results show that the proposed algorithm can reduce more than 10% of split-capable nodes compared with other routing algorithms whereby the optimization for the split-capable node placement is not taken into account.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.1.219/_p

Copy

@ARTICLE{e88-b_1_219,
author={Johannes Hamonangan SIREGAR, Yongbing ZHANG, Hideaki TAKAGI, },
journal={IEICE TRANSACTIONS on Communications},
title={Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks},
year={2005},
volume={E88-B},
number={1},
pages={219-226},
abstract={We consider the multicast routing problem for large-scale wavelength division multiplexing (WDM) optical networks where transmission requests are established by point-to-multipoint connections. To realize multicast routing in WDM optical networks, some nodes need to have light (optical) splitting capability. A node with splitting capability can forward an incoming message to more than one output link. We consider the problem of minimizing the number of split-capable nodes in the network for a given set of multicast requests. The number of wavelengths is fixed and given a priori. We propose a genetic algorithm that exploits the combination of alternative shortest paths for the given multicast requests in order to minimize the number of required split-capable nodes. This algorithm is examined for two realistic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan. Our experimental results show that the proposed algorithm can reduce more than 10% of split-capable nodes compared with other routing algorithms whereby the optimization for the split-capable node placement is not taken into account.},
keywords={},
doi={10.1093/ietcom/e88-b.1.219},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 219
EP - 226
AU - Johannes Hamonangan SIREGAR
AU - Yongbing ZHANG
AU - Hideaki TAKAGI
PY - 2005
DO - 10.1093/ietcom/e88-b.1.219
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2005
AB - We consider the multicast routing problem for large-scale wavelength division multiplexing (WDM) optical networks where transmission requests are established by point-to-multipoint connections. To realize multicast routing in WDM optical networks, some nodes need to have light (optical) splitting capability. A node with splitting capability can forward an incoming message to more than one output link. We consider the problem of minimizing the number of split-capable nodes in the network for a given set of multicast requests. The number of wavelengths is fixed and given a priori. We propose a genetic algorithm that exploits the combination of alternative shortest paths for the given multicast requests in order to minimize the number of required split-capable nodes. This algorithm is examined for two realistic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan. Our experimental results show that the proposed algorithm can reduce more than 10% of split-capable nodes compared with other routing algorithms whereby the optimization for the split-capable node placement is not taken into account.
ER -