Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/68780
DC FieldValue
dc.titleA distributed monitoring-based fairness algorithm in optical burst switching networks
dc.contributor.authorHailong, L.
dc.contributor.authorMalvin, T.W.L.
dc.contributor.authorIan, T.L.-J.
dc.date.accessioned2014-06-19T02:53:07Z
dc.date.available2014-06-19T02:53:07Z
dc.date.issued2004
dc.identifier.citationHailong, L.,Malvin, T.W.L.,Ian, T.L.-J. (2004). A distributed monitoring-based fairness algorithm in optical burst switching networks. IEEE International Conference on Communications 3 : 1564-1568. ScholarBank@NUS Repository.
dc.identifier.issn05361486
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/68780
dc.description.abstractOptical Burst Switching (OBS) is a new paradigm proposed to efficiently support the ever-growing broadband traffic over WDM networks. In this paper, we identify and study the fairness problem due to the Path Length Priority Effect in Optical Burst Switching networks. Although achieving fairness at a core node generally requires a tradeoff with performance, an algorithm called MGDP, was proposed to achieve fairness while minimizing this tradeoff.
dc.sourceScopus
dc.subjectFairness
dc.subjectPath length priority effect
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitleIEEE International Conference on Communications
dc.description.volume3
dc.description.page1564-1568
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


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