Proportional delay differentiation service based on weighted fair queuing
Chin-Chang Li, Shiao‐Li Tsao, Meng Cheng Chen, Yeali S. Sun, Yueh‐Min Huang
Abstract
Chin-Chang Li, Shiao‐Li Tsao, Meng Cheng Chen, Yeali S. Sun, Yueh‐Min Huang
Abstract
Differentiation service (Diffserv) is regarded as one of the practical architectures to realize quality of service (QoS) on the Internet. Relative differentiated service, which achieves relative QoS differentiation between traffic classes, is a simple and easily-deployed service model. Based on the concept of relative differentiated service, Dovrolis et al. (ACM SIGMETRICS Performance Evaluation Review vol.27, no.1, pp.204-5, 1999; IEEE Network, September 1999; ACM SIGCOMM-99, September 1999) proposed a proportional differentiation service model which guarantees the ratios of service differences between classes. They claimed that weighted fair queuing (WFQ) is not suitable for implementing relative differentiation service and employed priority-based scheduling algorithms in their model. In this paper, we extend WFQ and apply it to proportional delay differentiation service. The extended WFQ algorithm adjusts the weighting of each class dynamically so that the delay differences between classes can be well controlled. Simulations show that the proposed methods can realize proportional delay differentiation service effectively and efficiently.
OpenAlex reports 58 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Differentiation service (Diffserv) is regarded as one of the practical architectures to realize quality of service (QoS) on the Internet. Relative differentiated service, which achieves relative QoS differentiation between traffic classes, is a simple and easily-deployed service model. Based on the concept of relative differentiated service, Dovrolis et al. (ACM SIGMETRICS Performance Evaluation Review vol.27, no.1, pp.204-5, 1999; IEEE Network, September 1999; ACM SIGCOMM-99, September 1999) proposed a proportional differentiation service model which guarantees the ratios of service differences between classes. They claimed that weighted fair queuing (WFQ) is not suitable for implementing relative differentiation service and employed priority-based scheduling algorithms in their model. In this paper, we extend WFQ and apply it to proportional delay differentiation service. The extended WFQ algorithm adjusts the weighting of each class dynamically so that the delay differences between classes can be well controlled. Simulations show that the proposed methods can realize proportional delay differentiation service effectively and efficiently.
Key concepts: Weighted fair queueing, Differentiated services, Computer science, Quality of service, Differentiated service, Queueing theory, Computer network, Scheduling (production processes)