Please use this identifier to cite or link to this item:
Title: Relationship between guaranteed rate server and latency rate server
Authors: Jiang, Y. 
Keywords: Guaranteed Rate server
Latency Rate server
Scheduling algorithms
Scheduling model
Issue Date: 2002
Citation: Jiang, Y. (2002). Relationship between guaranteed rate server and latency rate server. Conference Record / IEEE Global Telecommunications Conference 3 : 2415-2419. ScholarBank@NUS Repository.
Abstract: To analyze scheduling algorithms in high-speed packet switching networks, two models have been proposed and widely used in the literature, namely the Guaranteed Rate (GR) server model and the Latency Rate (LR) server model. While a lot scheduling algorithms have been proved to belong to GR or LR or both, it is not clear what is the relationship between them. The purpose of this paper is to investigate this relationship. We prove that if a scheduling algorithm belongs to GR, it also belongs to LR and vice versa. In addition, we review several other models that are also used for analysis of scheduling algorithms and discuss their relationship with LR model and GR model.
Source Title: Conference Record / IEEE Global Telecommunications Conference
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.