Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/111700
DC Field | Value | |
---|---|---|
dc.title | Delay bounds for a network of guaranteed rate servers with FIFO aggregation | |
dc.contributor.author | Jiang, Y. | |
dc.date.accessioned | 2014-11-28T02:12:29Z | |
dc.date.available | 2014-11-28T02:12:29Z | |
dc.date.issued | 2002 | |
dc.identifier.citation | Jiang, Y. (2002). Delay bounds for a network of guaranteed rate servers with FIFO aggregation. IEEE International Conference on Communications 2 : 1149-1153. ScholarBank@NUS Repository. | |
dc.identifier.issn | 05361486 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/111700 | |
dc.description.abstract | To support quality of service guarantees in a scalable manner, aggregate scheduling has attracted a lot of attention in the networking community. However, while there are a large number of results available for flow-based scheduling algorithms, few such results are available for aggregate-based scheduling. In this paper, we study a network implementing Guaranteed Rate (GR) scheduling with First-In-First-Out (FIFO) aggregation. We derive an upper bound on the worst case end-to-end delay for the network. We show that while for a specific network configuration, the derived delay bound is not restricted by the utilization level on the guaranteed rate, it is so for a general network configuration. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | INSTITUTE FOR COMMUNICATIONS RESEARCH | |
dc.description.sourcetitle | IEEE International Conference on Communications | |
dc.description.volume | 2 | |
dc.description.page | 1149-1153 | |
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.