A scheduling algorithm for WDM optical networks
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...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Computer Science and Information Technology, University of Malaya
2001
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/49471/ http://psasir.upm.edu.my/id/eprint/49471/1/A%20scheduling%20algorithm%20for%20WDM%20optical%20networks.pdf |
| _version_ | 1848851277279133696 |
|---|---|
| author | Cheah, Cheng Lai Mohd Ali, Borhanuddin Mukerjee, Malay R. Prakash, Veeraraghavan Selvadurai, Selvakennedy |
| author_facet | Cheah, Cheng Lai Mohd Ali, Borhanuddin Mukerjee, Malay R. Prakash, Veeraraghavan Selvadurai, Selvakennedy |
| author_sort | Cheah, Cheng Lai |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T10:19:37Z |
| format | Article |
| id | upm-49471 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:19:37Z |
| publishDate | 2001 |
| publisher | Faculty of Computer Science and Information Technology, University of Malaya |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-494712016-12-30T02:52:15Z http://psasir.upm.edu.my/id/eprint/49471/ A scheduling algorithm for WDM optical networks Cheah, Cheng Lai Mohd Ali, Borhanuddin Mukerjee, Malay R. Prakash, Veeraraghavan Selvadurai, Selvakennedy 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. Faculty of Computer Science and Information Technology, University of Malaya 2001 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/49471/1/A%20scheduling%20algorithm%20for%20WDM%20optical%20networks.pdf 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 http://e-journal.um.edu.my/publish/MJCS/140-154 |
| spellingShingle | Cheah, Cheng Lai Mohd Ali, Borhanuddin Mukerjee, Malay R. Prakash, Veeraraghavan Selvadurai, Selvakennedy A scheduling algorithm for WDM optical networks |
| title | A scheduling algorithm for WDM optical networks |
| title_full | A scheduling algorithm for WDM optical networks |
| title_fullStr | A scheduling algorithm for WDM optical networks |
| title_full_unstemmed | A scheduling algorithm for WDM optical networks |
| title_short | A scheduling algorithm for WDM optical networks |
| title_sort | scheduling algorithm for wdm optical networks |
| url | http://psasir.upm.edu.my/id/eprint/49471/ http://psasir.upm.edu.my/id/eprint/49471/ http://psasir.upm.edu.my/id/eprint/49471/1/A%20scheduling%20algorithm%20for%20WDM%20optical%20networks.pdf |