Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks

Johannes Hamonangan SIREGAR  Yongbing ZHANG  Hideaki TAKAGI  

IEICE TRANSACTIONS on Communications   Vol.E88-B   No.1   pp.219-226
Publication Date: 2005/01/01
Online ISSN: 
DOI: 10.1093/ietcom/e88-b.1.219
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
wavelength-division multiplexing,  optical multicast routing,  split node,  genetic algorithm,  

Full Text: PDF(451.4KB)>>
Buy this Article

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.