Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0140-3664(03)00211-1
Title: Achieving proportional delay differentiation efficiently
Authors: Ngin, H.-T.
Tham, C.-K. 
Keywords: Differentiated services
Proportional delay
Quality of service
Issue Date: 1-Feb-2004
Source: 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
URI: http://scholarbank.nus.edu.sg/handle/10635/69149
ISSN: 01403664
DOI: 10.1016/S0140-3664(03)00211-1
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

3
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

1
checked on Nov 20, 2017

Page view(s)

12
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


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