A fast scheduling algorithm for WDM optical networks

Author

Lai, Cheah Cheng ; Ali, Borhanuddin Mohd ; Mukerjee, Malay R. ; Prakash, V. ; Selvakennedy, S.

Author_Institution

Fac. of Eng., Univ. Putra Malaysia, Serdang, Malaysia

Volume

2

fYear

2000

fDate

2000

Firstpage

487

Abstract

This paper proposes a fast scheduling algorithm for time-slotted wavelength division multiplexing (WDM) broadcast-and-select optical networks. The algorithm is free from collision and supports bandwidth reservation to the nodes up to a node´s fair share of the network capacity. Besides, the non-reserved bandwidth can be used for best effort transmission. The time complexity of the algorithm is O(Mlog²N), where M is the number of packets used for scheduling and N is the number of nodes. This running time complexity can be improved to O(log³N) with O(M) processors by parallel processing

Keywords

broadcasting; computational complexity; network topology; optical fibre networks; packet switching; wavelength division multiplexing; WDM optical networks; bandwidth reservation; best effort transmission; broadcast-and-select optical networks; fast scheduling algorithm; network capacity; packet transmission; parallel processing; running time complexity; simulation model; time complexity; time-slotted wavelength division multiplexing; Bandwidth; Broadcasting; Optical fiber networks; Optical receivers; Optical transmitters; Processor scheduling; Scheduling algorithm; Size control; WDM networks; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON 2000. Proceedings

Conference_Location

Kuala Lumpur

Print_ISBN

0-7803-6355-8

Type

conf

DOI

10.1109/TENCON.2000.888786

Filename

888786