Genetic algorithms for multiple multicast on WDM ring network

Research output: Contribution to journalArticle

20 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)840-856
Number of pages17
JournalComputer Communications
Volume27
Issue number9
DOIs
Publication statusPublished - 2004 Jun 1

Fingerprint

Wavelength division multiplexing
Genetic algorithms
Wavelength
Optical frequency conversion

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{af103ff3affb46c08d2fc904d0d2943d,
title = "Genetic algorithms for multiple multicast on WDM ring network",
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.",
author = "Din, {Der Rong}",
year = "2004",
month = "6",
day = "1",
doi = "10.1016/j.comcom.2004.01.016",
language = "English",
volume = "27",
pages = "840--856",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "9",

}

Genetic algorithms for multiple multicast on WDM ring network. / Din, Der Rong.

In: Computer Communications, Vol. 27, No. 9, 01.06.2004, p. 840-856.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Genetic algorithms for multiple multicast on WDM ring network

AU - Din, Der Rong

PY - 2004/6/1

Y1 - 2004/6/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=1842731983&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1842731983&partnerID=8YFLogxK

U2 - 10.1016/j.comcom.2004.01.016

DO - 10.1016/j.comcom.2004.01.016

M3 - Article

AN - SCOPUS:1842731983

VL - 27

SP - 840

EP - 856

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 9

ER -