Routing and wavelength assignment with power considerations in optical networks

Maher Ali, Byrav Ramamurthy, Jitender S. Deogun

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

Previous studies have solved may variations of the routing and wavelength assignment (RWA) problem in optical networks under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate the RWA problem while allowing for degradation of routed signals by optical components. The problem is formulated as a mixed-integer non-linear program. We propose a two-phase approach. In the first phase, we solve the pure RWA problem using fixed routes for every connection. In the second phase, power assignment is accomplished by either using a heuristic or using a genetic algorithm. This paper demonstrates that: (i) connections do interact affecting the power of each other, and (ii) global search meta-heuristics provide better solutions.

Original languageEnglish (US)
Pages (from-to)539-555
Number of pages17
JournalComputer Networks
Volume32
Issue number5
DOIs
StatePublished - May 15 2000

Fingerprint

Fiber optic networks
Wavelength
Genetic algorithms
Degradation

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Routing and wavelength assignment with power considerations in optical networks. / Ali, Maher; Ramamurthy, Byrav; Deogun, Jitender S.

In: Computer Networks, Vol. 32, No. 5, 15.05.2000, p. 539-555.

Research output: Contribution to journalArticle

@article{b27795be4b6b443cbe4a77471c273755,
title = "Routing and wavelength assignment with power considerations in optical networks",
abstract = "Previous studies have solved may variations of the routing and wavelength assignment (RWA) problem in optical networks under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate the RWA problem while allowing for degradation of routed signals by optical components. The problem is formulated as a mixed-integer non-linear program. We propose a two-phase approach. In the first phase, we solve the pure RWA problem using fixed routes for every connection. In the second phase, power assignment is accomplished by either using a heuristic or using a genetic algorithm. This paper demonstrates that: (i) connections do interact affecting the power of each other, and (ii) global search meta-heuristics provide better solutions.",
author = "Maher Ali and Byrav Ramamurthy and Deogun, {Jitender S.}",
year = "2000",
month = "5",
day = "15",
doi = "10.1016/S1389-1286(00)00015-3",
language = "English (US)",
volume = "32",
pages = "539--555",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "5",

}

TY - JOUR

T1 - Routing and wavelength assignment with power considerations in optical networks

AU - Ali, Maher

AU - Ramamurthy, Byrav

AU - Deogun, Jitender S.

PY - 2000/5/15

Y1 - 2000/5/15

N2 - Previous studies have solved may variations of the routing and wavelength assignment (RWA) problem in optical networks under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate the RWA problem while allowing for degradation of routed signals by optical components. The problem is formulated as a mixed-integer non-linear program. We propose a two-phase approach. In the first phase, we solve the pure RWA problem using fixed routes for every connection. In the second phase, power assignment is accomplished by either using a heuristic or using a genetic algorithm. This paper demonstrates that: (i) connections do interact affecting the power of each other, and (ii) global search meta-heuristics provide better solutions.

AB - Previous studies have solved may variations of the routing and wavelength assignment (RWA) problem in optical networks under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate the RWA problem while allowing for degradation of routed signals by optical components. The problem is formulated as a mixed-integer non-linear program. We propose a two-phase approach. In the first phase, we solve the pure RWA problem using fixed routes for every connection. In the second phase, power assignment is accomplished by either using a heuristic or using a genetic algorithm. This paper demonstrates that: (i) connections do interact affecting the power of each other, and (ii) global search meta-heuristics provide better solutions.

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

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

U2 - 10.1016/S1389-1286(00)00015-3

DO - 10.1016/S1389-1286(00)00015-3

M3 - Article

AN - SCOPUS:0033683379

VL - 32

SP - 539

EP - 555

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 5

ER -