Please use this identifier to cite or link to this item:
Title: A scheduling algorithm for WDM optical networks
Authors: Cheah, C.L. 
Ali, B.M. 
Mukerjee, M.R. 
Prakash, V. 
Selvakennedy, S. 
Issue Date: 2001
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.
Appears in Collections:COE Scholarly Publication

Show full item record

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.