Please use this identifier to cite or link to this item:
|Title:||Achieving proportional delay differentiation efficiently|
Quality of service
|Citation:||Ngin, H.-T., Tham, C.-K. (2004-02-01). Achieving proportional delay differentiation efficiently. Computer Communications 27 (2) : 153-161. ScholarBank@NUS Repository. https://doi.org/10.1016/S0140-3664(03)00211-1|
|Abstract:||In this paper, we focus on efficiently achieving Proportional Delay Differentiation (PDD), an instance of the Proportional Differentiation Model first proposed under the DiffServ framework [IEEE Network (1999)]. PDD can be achieved using a few algorithms, one of the most well-known being Waiting Time Priority(WTP). Using WTP [Proc. ACM SIGCOMM (1999)] as a reference, we show that our proposed Scaled Time Priority (STP) algorithm is able to provide near proportional delay at a complexity of O(1), which is lower than the O(N) complexity of WTP, where N is the number of service classes in the system. Simulation results also show that STP is able to emulate the performance of WTP. © 2003 Elsevier B.V. All rights reserved.|
|Source Title:||Computer Communications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2018
WEB OF SCIENCETM
checked on Nov 27, 2018
checked on Dec 15, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.