Genetic algorithms for multiple multicast on WDM ring network

Authors:
Der-Rong Din
Affiliations:
Department of Computer Science and Information Engineering, National Changhua University of Education, 1, Jin De Road, Paisha Village, Changhua 500, Taiwan, R.O.C.
Venue:
Computer Communications
Year:
2004

Citing 4
Cited 7

Optical networks: a practical perspective

Optical networks: a practical perspective
On the wavelength assignment problem in multifiber WDM star and ring networks

IEEE/ACM Transactions on Networking (TON)
Optical path cross-connect system scale evaluation using path accommodation design for restricted wavelength multiplexing

IEEE Journal on Selected Areas in Communications
Optimal routing and wavelength assignment in WDM ring networks

IEEE Journal on Selected Areas in Communications

A hybrid method for solving ARWA problem on WDM network

Computer Communications
Computational intelligence in photonics technology and optical networks: A survey and future perspectives

Information Sciences: an International Journal
Genetic algorithm for finding minimal cost light forest of multicast routing on WDM networks

Journal of Artificial Evolution and Applications - Regular issue
A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

Applied Soft Computing
Genetic algorithm for finding minimal cost light-forest of multicast routing on WDM networks

Artificial Intelligence Review
A Tabu Search algorithm for dynamic routing in ATM cell-switching networks

Applied Soft Computing
Optical multicast over wavelength-routed WDM networks: A survey

Optical Switching and Networking

Quantified Score

Hi-index	0.24

Visualization

Abstract

The optimal multiple multicast problem (OMMP) on wavelength division multiplexing ring networks without wavelength conversion is considered in this paper. When the physical network and the set of multicast requests are given, OMMP is the problem that selects a suitable path or (paths) and wavelength (or wavelengths) among the many possible choices for each multicast request under the constraint that not any paths using the same wavelength pass through the same link such that the number of used wavelengths is minimized. This problem can be proven to be NP-hard. In the paper, a formulation of OMMP is given and several genetic algorithms (GAs) are proposed to solve it. Experimental results indicate that the proposed GAs are robust for this problem.