Please use this identifier to cite or link to this item:
Title: Delay bounds for a network of guaranteed rate servers with FIFO aggregation
Authors: Jiang, Y. 
Issue Date: 2002
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.
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.
Source Title: IEEE International Conference on Communications
ISSN: 05361486
Appears in Collections:Staff Publications

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

Page view(s)

checked on Jan 18, 2020

Google ScholarTM


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