Fast scheduling algorithm for WDM optical networks

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

Research output: Contribution to conferencePaper


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(Mlog2N)1, 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(log3N) with O(M) processors by parallel processing.

Original languageEnglish
Publication statusPublished - 01 Dec 2000
Event2000 TENCON Proceedings - Kuala Lumpur, Malaysia
Duration: 24 Sep 200027 Sep 2000


Other2000 TENCON Proceedings
CityKuala Lumpur, Malaysia

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Fast scheduling algorithm for WDM optical networks'. Together they form a unique fingerprint.

  • Cite this

    Cheah, C. L., Ali, B. M., Mukerjee, M. R., Prakash, V., & Selvakennedy, S. (2000). Fast scheduling algorithm for WDM optical networks. Paper presented at 2000 TENCON Proceedings, Kuala Lumpur, Malaysia, .