Please use this identifier to cite or link to this item:
http://dspace.uniten.edu.my/jspui/handle/123456789/8722| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Cheah, C.L. | |
| dc.contributor.author | Ali, B.M. | |
| dc.contributor.author | Mukerjee, M.R. | |
| dc.contributor.author | Prakash, V. | |
| dc.contributor.author | Selvakennedy, S. | |
| dc.date.accessioned | 2018-02-20T06:01:48Z | - |
| dc.date.available | 2018-02-20T06:01:48Z | - |
| dc.date.issued | 2001 | |
| dc.identifier.uri | http://dspace.uniten.edu.my/jspui/handle/123456789/8722 | - |
| dc.description.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. | |
| dc.title | A scheduling algorithm for WDM optical networks | |
| item.grantfulltext | none | - |
| item.fulltext | No Fulltext | - |
| Appears in Collections: | COE Scholarly Publication | |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.