Please use this identifier to cite or link to this item:
|Title:||Scaled time priority: An efficient approximation to waiting time priority|
Quality of service
|Source:||Ngin, H.-T.,Tham, C.-K. (2004-07-15). Scaled time priority: An efficient approximation to waiting time priority. Computer Networks 45 (4) : 449-462. ScholarBank@NUS Repository. https://doi.org/10.1016/j.comnet.2004.02.009|
|Abstract:||Under the framework of DiffServ, Dovrolis presented the proportional differentiation model (PDM) [IEEE Network, October 1999] and found the waiting time priority (WTP) scheme [Proc. ACM SIGCOMM, September 1999] to be a suitable scheduling algorithm to achieve proportional delay differentiation. In this paper, we propose scaled time priority (STP), which is an efficient approximation to waiting time priority (WTP). In particular, STP is able to provide near proportional delay at a complexity of O(1), which is lower than WTP's O(N) complexity, where N is the number of service classes in the system. Simulation results show that STP is able to emulate the performance of WTP. © 2004 Elsevier B.V. All rights reserved.|
|Source Title:||Computer Networks|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 15, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.