出版社：University of Malaya * Faculty of Computer Science and Information Technology
摘要：This paper proposes a scheduling algorithm for timeslotted WDM broadcastandselect 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.
