Please use this identifier to cite or link to this item:
|Title:||Achieving proportional delay differentiation efficiently|
|Citation:||Ngin, H.-T., Tham, C.-K. (2002). Achieving proportional delay differentiation efficiently. IEEE International Conference on Networks, ICON : 169-174. ScholarBank@NUS Repository. https://doi.org/10.1109/ICON.2002.1033306|
|Abstract:||In this paper, we focus on efficiently achieving proportional delay differentiation (PDD), an instance of the proportional differentiation model (PDM) first proposed under the DiffServ framework (see Dovrolis, C. and Ramanathan, P., IEEE Network, Oct. 1999). Waiting time priority (WTP) has been found to be a suitable algorithm to achieve PDD. Using WTP (see Dovrolis et al., 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. © 2002 IEEE.|
|Source Title:||IEEE International Conference on Networks, ICON|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 23, 2018
WEB OF SCIENCETM
checked on Oct 8, 2018
checked on Jun 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.