Achieving proportional delay differentiation efficiently
Hoon-Tong Ngin, Chen‐Khong Tham · 2003
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.