A Scheduling Algorithm for WDM Optical Networks
Cheah, Cheng Lai and Borhanuddin Mohd. Ali, and Mukerjee, Malay R. and Prakash, V. and Selvakennedy, S. (2001) A Scheduling Algorithm for WDM Optical Networks. Malaysian Journal of Computer Science, 14 (1). pp. 46-57. ISSN 0127-9084
Full text not available from this repository.
Official URL: http://mjcs.fsktm.um.edu.my/detail.asp?AID=113
Universiti Putra Malaysia
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.
|Keywords:||WDM optical networks, Scheduling algorithm|
Repository Staff Only: item control page