Two schedulers to provide delay proportion and reduce queueing delay simultaneously

Authors:
Yuan-Cheng Lai
Affiliations:
National Taiwan University of Science and Technology, Department of Information Management, No. 43, Sec. 4, Keeluing Road, Taipei 106, Taiwan, ROC
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2007

Citing 7
Cited 2

Proportional differentiated services: delay differentiation and packet scheduling

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Adaptive proportional delay differentiated services: characterization and performance evaluation

IEEE/ACM Transactions on Networking (TON)
Proportional differentiated services: delay differentiation and packet scheduling

IEEE/ACM Transactions on Networking (TON)
Three remedied algorithms for Advanced Waiting Time Scheduler

ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
Proportional delay differentiation provision by bandwidth adaptation of class-based queue scheduling: Research Articles

International Journal of Communication Systems
Achieving proportional delay differentiation in wireless LAN via cross-layer scheduling: Research Articles

Wireless Communications & Mobile Computing - Special Issue: Emerging WLAN Apllications and Technologies
A case for relative differentiated services and the proportional differentiation model

IEEE Network: The Magazine of Global Internetworking

High-performance packet scheduling to provide relative delay differentiation in future high-speed networks

Computer Communications
Fair bandwidth sharing and delay differentiation: Joint packet scheduling with buffer management

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The proportional delay differentiation model provides controllable and predictable delay differentiation, that is, the packet delay proportion between two classes of services is consistent on any measured timescale. Previous studies have focused on improving the accuracy of the achieved delay proportion between classes, and have not considered reducing the packet queueing delay, since these proposed scheduling algorithms are independent of the packet service time, such that the mean queueing delay is invariant, as specified by the conservation law. This paper proposes maximum WTP (MWTP) and variance WTP (VWTP) schedulers, modified from the waiting-time priority (WTP) algorithm which is an excellent scheduler for performing proportional delay differentiation. All of the proposed schedulers account for the packet transmission time. Simulation results indicate that when the link utilization is moderate, the two schedulers not only yield more accurate delay proportions than the WTP scheduler, regardless of whether the timescale is long or short, but also reduce the mean queueing delay. The effects of load distribution, packet size, and coefficient of variation (CoV) of packet sizes, on the performance of all schedulers are also investigated. Our proposed schedulers always outperform WTP.