Please use this identifier to cite or link to this item:
Title: Fast scheduling algorithm for WDM optical networks
Authors: Cheah, Cheng Lai 
Ali, Borhanuddin Mohd 
Mukerjee, Malay R. 
Prakash, V. 
Selvakennedy, S. 
Issue Date: 2000
Abstract: This paper proposes a fast scheduling algorithm for time-slotted wavelength division multiplexing (WDM) broadcast-and-select optical networks. The algorithm is free from collision and supports bandwidth reservation to the nodes up to a node's fair share of the network capacity. Besides, the non-reserved bandwidth can be used for best effort transmission. The time complexity of the algorithm is O(Mlog2N)1, where M is the number of packets used for scheduling and N is the number of nodes. This running time complexity can be improved to O(log3N) with O(M) processors 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.