DSpaceCRIS@UNITENhttp://dspace.uniten.edu.my/jspuiThe DSpace digital repository system captures, stores, indexes, preserves, and distributes digital research material.Fri, 03 Jul 2020 15:38:58 GMT2020-07-03T15:38:58Z5021Fast scheduling algorithm for WDM optical networkshttp://dspace.uniten.edu.my/jspui/handle/123456789/8723Title: Fast scheduling algorithm for WDM optical networks
Authors: Cheah, Cheng Lai; Ali, Borhanuddin Mohd; Mukerjee, Malay R.; Prakash, V.; Selvakennedy, S.
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.
Sat, 01 Jan 2000 00:00:00 GMThttp://dspace.uniten.edu.my/jspui/handle/123456789/87232000-01-01T00:00:00ZA scheduling algorithm for WDM optical networkshttp://dspace.uniten.edu.my/jspui/handle/123456789/8722Title: A scheduling algorithm for WDM optical networks
Authors: Cheah, C.L.; Ali, B.M.; Mukerjee, M.R.; Prakash, V.; Selvakennedy, S.
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.
Mon, 01 Jan 2001 00:00:00 GMThttp://dspace.uniten.edu.my/jspui/handle/123456789/87222001-01-01T00:00:00Z