Dynamic priority strategies for wavelength assignment in WDM rings

Author

Waldman, H. ; Campelo, D.R. ; Camelo, R.

Author_Institution

Univ. Estadual de Campinas, Sao Paulo, Brazil

Volume

2

fYear

2000

fDate

2000

Firstpage

1288

Abstract

The performance improvements imparted by first-fit wavelength assignment algorithms on blocking WDM rings without wavelength conversions are investigated. Computationally inexpensive algorithms are derived for the minimization of: (a) the blocking probability immediately after each assignment; and (b) the increment of the channel blocking probability at the assigned wavelength. Their performance is evaluated by simulation and compared with the basic random and priority algorithms

Keywords

minimisation; network topology; optical fibre networks; probability; wavelength division multiplexing; WDM rings; blocking WDM rings; blocking probability minimization; channel blocking probability; computationally inexpensive algorithms; dynamic priority strategies; first-fit wavelength assignment algorithms; linear topology; optical path networks; performance evaluation; priority algorithm; random algorithm; ring topology; simulation; Computational modeling; Law; Legal factors; Minimization methods; Network topology; Optical fiber networks; Optical wavelength conversion; Telecommunication traffic; Wavelength assignment; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE

Conference_Location

San Francisco, CA

Print_ISBN

0-7803-6451-1

Type

conf

DOI

10.1109/GLOCOM.2000.891343

Filename

891343