表紙画像

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

詳細記述

保存先:
書誌詳細
主要な著者: Cheah, Cheng Lai, Mohd Ali, Borhanuddin, Mukerjee, Malay R., Prakash, Veeraraghavan, Selvadurai, Selvakennedy
フォーマット: 論文
言語:English
出版事項: Faculty of Computer Science and Information Technology, University of Malaya 2001
オンライン･アクセス: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
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
id my.upm.eprints.49471
record_format eprints
spelling my.upm.eprints.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
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
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.
format Article
author Cheah, Cheng Lai
Mohd Ali, Borhanuddin
Mukerjee, Malay R.
Prakash, Veeraraghavan
Selvadurai, Selvakennedy
spellingShingle Cheah, Cheng Lai
Mohd Ali, Borhanuddin
Mukerjee, Malay R.
Prakash, Veeraraghavan
Selvadurai, Selvakennedy
A scheduling algorithm for WDM optical networks
author_facet Cheah, Cheng Lai
Mohd Ali, Borhanuddin
Mukerjee, Malay R.
Prakash, Veeraraghavan
Selvadurai, Selvakennedy
author_sort Cheah, Cheng Lai
title A scheduling algorithm for WDM optical networks
title_short 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_sort scheduling algorithm for wdm optical networks
publisher Faculty of Computer Science and Information Technology, University of Malaya
publishDate 2001
url 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
_version_ 1643834376780251136
score 13.250246

類似資料