Please use this identifier to cite or link to this item: http://dspace2020.uniten.edu.my:8080/handle/123456789/8722
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCheah, C.L.
dc.contributor.authorAli, B.M.
dc.contributor.authorMukerjee, M.R.
dc.contributor.authorPrakash, V.
dc.contributor.authorSelvakennedy, S.
dc.date.accessioned2018-02-20T06:01:48Z-
dc.date.available2018-02-20T06:01:48Z-
dc.date.issued2001
dc.identifier.urihttp://dspace.uniten.edu.my/jspui/handle/123456789/8722-
dc.description.abstractThis 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.titleA scheduling algorithm for WDM optical networks
item.fulltextNo Fulltext-
item.grantfulltextnone-
Appears in Collections:COE Scholarly Publication
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.