A Scheduling Algorithm for WDM Optical Networks

Authors

  • Cheng Lai Cheah Faculty of Engineering, University Putra Malaysia
  • Borhanuddin Mohd Ali Faculty of Engineering University Putra Malaysia
  • Malay R. Mukerjee Faculty of Engineering, University Putra Malaysia
  • V. Prakash Faculty of Engineering, University Putra Malaysia
  • S. Selvakennedy Taylor’s College Sdn. Bhd

Keywords:

WDM optical networks, Scheduling algorithm

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) , 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.

Downloads

Download data is not yet available.

Downloads

Published

2001-06-01

How to Cite

Cheah, C. L., Mohd Ali, B., R. Mukerjee, M., Prakash, V., & Selvakennedy, S. (2001). A Scheduling Algorithm for WDM Optical Networks. Malaysian Journal of Computer Science, 14(1), 46–57. Retrieved from https://jupidi.um.edu.my/index.php/MJCS/article/view/5851

Issue

Vol. 14 No. 1 (2001): Malaysian Journal of Computer Science

Section

Articles