Please use this identifier to cite or link to this item: http://dspace2020.uniten.edu.my:8080/handle/123456789/8723
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCheah, Cheng Lai
dc.contributor.authorAli, Borhanuddin Mohd
dc.contributor.authorMukerjee, Malay 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.issued2000
dc.identifier.urihttp://dspace.uniten.edu.my/jspui/handle/123456789/8723-
dc.description.abstractThis paper proposes a fast scheduling algorithm for time-slotted wavelength division multiplexing (WDM) broadcast-and-select optical networks. The algorithm is free from collision and supports bandwidth reservation to the nodes up to a node's fair share of the network capacity. Besides, the non-reserved bandwidth can be used for best effort transmission. The time complexity of the algorithm is O(Mlog2N)1, where M is the number of packets used for scheduling and N is the number of nodes. This running time complexity can be improved to O(log3N) with O(M) processors by parallel processing.
dc.titleFast 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.