A scheduling algorithm for WDM optical networks

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

Research output: Contribution to journalArticle

Abstract

This paper proposes a scheduling algorithm for time-slotted WDM broadcast-and-select optical networks. The algorithm is free from collision and supports a particular class of quality of service (QoS), namely constant bit rate (CBR). The running time complexity of the algorithm is O(Mlog2N)1, where M and N are the number of packets used for scheduling and the number of nodes, respectively. This running time can be improved to O(log3N) by parallel processing.

Original languageEnglish
Pages (from-to)46-57
Number of pages12
JournalMalaysian Journal of Computer Science
Volume14
Issue number1
Publication statusPublished - 01 Dec 2001

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Cheah, C. L., Ali, B. M., Mukerjee, M. R., Prakash, V., & Selvakennedy, S. (2001). A scheduling algorithm for WDM optical networks. Malaysian Journal of Computer Science, 14(1), 46-57.