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...

Full description

Saved in:
Bibliographic Details
Main Authors: Cheah, Cheng Lai, Mohd Ali, Borhanuddin, Mukerjee, Malay R., Prakash, Veeraraghavan, Selvadurai, Selvakennedy
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/1/A%20scheduling%20algorithm%20for%20WDM%20optical%20networks.pdf
http://psasir.upm.edu.my/id/eprint/49471/
http://e-journal.um.edu.my/publish/MJCS/140-154
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.