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

Published

2001-06-01

Issue

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

Section

Articles

How to Cite

A Scheduling Algorithm for WDM Optical Networks. (2001). Malaysian Journal of Computer Science, 14(1), 46-57. http://mojem.um.edu.my/index.php/MJCS/article/view/5851

Similar Articles

1-10 of 243

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)