Routing algorithms for all-optical networks with power considerations: The unicast case

Maher Ali, Byrav Ramamurthy, Jitender S. Deogun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

In this paper, we investigate the problem of routing connections in ail-optical networks while allowing for degradation of routed signals by different optical components. To overcome the complexity of the problem, we divide it into two parts. First, we solve the pure RWA problem using fixed routes for every connection. Second, power assignment is accomplished by either using the smallest-gain first (SGF) heuristic or using a genetic algorithm. Numerical examples on a wide variety of networks show that: (a) the number of connections established without considering the signal attenuation was most of the time greater than that achievable considering attenuation; and (b) the genetic solution quality was much better than that of SGF, especially when the conflict graph of the connections generated by the linear solver is denser.

Original languageEnglish (US)
Title of host publicationProceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999
EditorsArun Somani, EK Park, Sudhir Dixit
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages237-241
Number of pages5
ISBN (Print)0780357949, 9780780357945
DOIs
StatePublished - Jan 1 1999
Event8th International Conference on Computer Communications and Networks, ICCCN 1999 - Boston, United States
Duration: Oct 11 1999Oct 13 1999

Publication series

NameProceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999

Other

Other8th International Conference on Computer Communications and Networks, ICCCN 1999
CountryUnited States
CityBoston
Period10/11/9910/13/99

Fingerprint

Routing algorithms
Fiber optic networks
Genetic algorithms
Degradation
Routing
Assignment
Graph
Heuristics
Genetic algorithm

ASJC Scopus subject areas

  • Information Systems and Management
  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Ali, M., Ramamurthy, B., & Deogun, J. S. (1999). Routing algorithms for all-optical networks with power considerations: The unicast case. In A. Somani, EK. Park, & S. Dixit (Eds.), Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999 (pp. 237-241). [805525] (Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCCN.1999.805525

Routing algorithms for all-optical networks with power considerations : The unicast case. / Ali, Maher; Ramamurthy, Byrav; Deogun, Jitender S.

Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999. ed. / Arun Somani; EK Park; Sudhir Dixit. Institute of Electrical and Electronics Engineers Inc., 1999. p. 237-241 805525 (Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ali, M, Ramamurthy, B & Deogun, JS 1999, Routing algorithms for all-optical networks with power considerations: The unicast case. in A Somani, EK Park & S Dixit (eds), Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999., 805525, Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999, Institute of Electrical and Electronics Engineers Inc., pp. 237-241, 8th International Conference on Computer Communications and Networks, ICCCN 1999, Boston, United States, 10/11/99. https://doi.org/10.1109/ICCCN.1999.805525
Ali M, Ramamurthy B, Deogun JS. Routing algorithms for all-optical networks with power considerations: The unicast case. In Somani A, Park EK, Dixit S, editors, Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999. Institute of Electrical and Electronics Engineers Inc. 1999. p. 237-241. 805525. (Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999). https://doi.org/10.1109/ICCCN.1999.805525
Ali, Maher ; Ramamurthy, Byrav ; Deogun, Jitender S. / Routing algorithms for all-optical networks with power considerations : The unicast case. Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999. editor / Arun Somani ; EK Park ; Sudhir Dixit. Institute of Electrical and Electronics Engineers Inc., 1999. pp. 237-241 (Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999).
@inproceedings{8e57ca105f8f4bc9ab5752bf95d71873,
title = "Routing algorithms for all-optical networks with power considerations: The unicast case",
abstract = "In this paper, we investigate the problem of routing connections in ail-optical networks while allowing for degradation of routed signals by different optical components. To overcome the complexity of the problem, we divide it into two parts. First, we solve the pure RWA problem using fixed routes for every connection. Second, power assignment is accomplished by either using the smallest-gain first (SGF) heuristic or using a genetic algorithm. Numerical examples on a wide variety of networks show that: (a) the number of connections established without considering the signal attenuation was most of the time greater than that achievable considering attenuation; and (b) the genetic solution quality was much better than that of SGF, especially when the conflict graph of the connections generated by the linear solver is denser.",
author = "Maher Ali and Byrav Ramamurthy and Deogun, {Jitender S.}",
year = "1999",
month = "1",
day = "1",
doi = "10.1109/ICCCN.1999.805525",
language = "English (US)",
isbn = "0780357949",
series = "Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "237--241",
editor = "Arun Somani and EK Park and Sudhir Dixit",
booktitle = "Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999",

}

TY - GEN

T1 - Routing algorithms for all-optical networks with power considerations

T2 - The unicast case

AU - Ali, Maher

AU - Ramamurthy, Byrav

AU - Deogun, Jitender S.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - In this paper, we investigate the problem of routing connections in ail-optical networks while allowing for degradation of routed signals by different optical components. To overcome the complexity of the problem, we divide it into two parts. First, we solve the pure RWA problem using fixed routes for every connection. Second, power assignment is accomplished by either using the smallest-gain first (SGF) heuristic or using a genetic algorithm. Numerical examples on a wide variety of networks show that: (a) the number of connections established without considering the signal attenuation was most of the time greater than that achievable considering attenuation; and (b) the genetic solution quality was much better than that of SGF, especially when the conflict graph of the connections generated by the linear solver is denser.

AB - In this paper, we investigate the problem of routing connections in ail-optical networks while allowing for degradation of routed signals by different optical components. To overcome the complexity of the problem, we divide it into two parts. First, we solve the pure RWA problem using fixed routes for every connection. Second, power assignment is accomplished by either using the smallest-gain first (SGF) heuristic or using a genetic algorithm. Numerical examples on a wide variety of networks show that: (a) the number of connections established without considering the signal attenuation was most of the time greater than that achievable considering attenuation; and (b) the genetic solution quality was much better than that of SGF, especially when the conflict graph of the connections generated by the linear solver is denser.

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

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

U2 - 10.1109/ICCCN.1999.805525

DO - 10.1109/ICCCN.1999.805525

M3 - Conference contribution

AN - SCOPUS:84888790933

SN - 0780357949

SN - 9780780357945

T3 - Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999

SP - 237

EP - 241

BT - Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999

A2 - Somani, Arun

A2 - Park, EK

A2 - Dixit, Sudhir

PB - Institute of Electrical and Electronics Engineers Inc.

ER -