Integrating Priority with Share in the Priority-Based Weighted Fair Queuing Scheduler for Real-Time Networks

Authors:
Song Wang;Yu-Chung Wang;Kwei-Jay Lin
Affiliations:
Department of Electrical and Computer Engineering, University of California, Irvine, CA 92697-2625 wsong@ece.uci.edu;Department of Electrical and Computer Engineering, University of California, Irvine, CA 92697-2625 wangy@ece.uci.edu;Department of Electrical and Computer Engineering, University of California, Irvine, CA 92697-2625 klin@ece.uci.edu
Venue:
Real-Time Systems - Flexible Scheduling on Real-Time Systems
Year:
2002

Citing 13
Cited 2

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A Window Protocol for Transmission of Time-Constrained Messages

IEEE Transactions on Computers
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Link-sharing and resource management models for packet networks

IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network

An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
A hierarchical fair service curve algorithm for link-sharing, real-time and priority services

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Controlling window protocols for time-constrained communication in a multiple access environment

SIGCOMM '83 Proceedings of the eighth symposium on Data communications
Non-preemptive scheduling of messages on controller area network for real-time control applications

RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Generalized Guaranteed Rate Scheduling Algorithms: A Framework

Generalized Guaranteed Rate Scheduling Algorithms: A Framework
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1

Adaptive load control algorithms for 3rd generation mobile networks

MSWiM '02 Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Graceful degradation of loss-tolerant QoS using (m,k)-firm constraints in guaranteed rate networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Weighted Fair Queuing (WFQ) scheduler has been closely studied due to its desirable properties of bandwidth guarantee and bounded delay. However, the queuing delay bound of a communication session is tightly coupled with the session’s allocated service share. To receive a low queuing delay, a session must reserve a high share. In this paper, we study a new fair queuing algorithm called Priority-based Weighted Fair Queuing (PWFQ). PWFQ combines a session’s allocated share to achieve the bandwidth guarantee and the session’s priority to adjust the delay bound inside a sliding window. The new algorithm decouples the delay from the service share so that a session with a low share but a high priority may still receive a small delay. We analyze the worst-case delay bound of PWFQ and propose a simple algorithm to assign session priorities.