Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/68780
DC Field | Value | |
---|---|---|
dc.title | A distributed monitoring-based fairness algorithm in optical burst switching networks | |
dc.contributor.author | Hailong, L. | |
dc.contributor.author | Malvin, T.W.L. | |
dc.contributor.author | Ian, T.L.-J. | |
dc.date.accessioned | 2014-06-19T02:53:07Z | |
dc.date.available | 2014-06-19T02:53:07Z | |
dc.date.issued | 2004 | |
dc.identifier.citation | Hailong, 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.issn | 05361486 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/68780 | |
dc.description.abstract | Optical 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.source | Scopus | |
dc.subject | Fairness | |
dc.subject | Path length priority effect | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.sourcetitle | IEEE International Conference on Communications | |
dc.description.volume | 3 | |
dc.description.page | 1564-1568 | |
dc.identifier.isiut | NOT_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.