Citation
Cheah, Cheng Lai and Mohd Ali, Borhanuddin and Mukerjee, Malay R. and Prakash, Veeraraghavan and Selvadurai, Selvakennedy
(2001)
A scheduling algorithm for WDM optical networks.
Malaysian Journal of Computer Science, 14 (1).
pp. 46-57.
ISSN 0127-9084
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.
Download File
Official URL or Download Paper: http://e-journal.um.edu.my/publish/MJCS/140-154
|
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Engineering |
| Publisher: | Faculty of Computer Science and Information Technology, University of Malaya |
| Keywords: | WDM optical networks; Scheduling algorithm |
| Depositing User: | Nabilah Mustapa |
| Date Deposited: | 30 Dec 2016 02:52 |
| Last Modified: | 30 Dec 2016 02:52 |
| URI: | http://psasir.upm.edu.my/id/eprint/49471 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |