QoS-Aware Fair Queuing: A Low Overhead Packet Scheduling Discipline for Networked Multimedia Environments

Authors:
Michael S. Boykin;Taieb F. Znati
Affiliations:
Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA. boykin1@cs.pitt.edu;Department of Computer Science and Telecommunications Program, University of Pittsburgh, Pittsburgh, PA 15260, USA. znati@cs.pitt.edu
Venue:
Multimedia Tools and Applications
Year:
2002

Citing 15
Cited 0

Local and metropolitan area networks (4th ed.)

Local and metropolitan area networks (4th ed.)
Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors

ACM Transactions on Computer Systems (TOCS)
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
On per-session end-to-end delay distributions and the call admission problem for real-time applications with QOS requirements

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Multimedia: computing, communications and applications

Multimedia: computing, communications and applications
Design and analysis of frame-based fair queueing: a new traffic scheduling algorithm for packet-switched networks

Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Generalized guaranteed rate scheduling algorithms: a framework

IEEE/ACM Transactions on Networking (TON)
The handbook of multimedia information management

The handbook of multimedia information management
SCED: a generalized scheduling policy for guaranteeing quality-of-service

IEEE/ACM Transactions on Networking (TON)
Burst Scheduling Networks: Flow Specification and Performance Guarantees

NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
An Efficient Adaptive Search Algorithm for Scheduling Real-Time Traffic

ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
A network framework for qos-aware traffic scheduling and management in integrated services networks

A network framework for qos-aware traffic scheduling and management in integrated services networks
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Discrete service disciplines have been shown capable of emulating the ideal Generalized Processor Sharing (GPS) discipline within one maximum-sized packet's transmission time. As a result, the accuracy of such schemes increases with improvements in link speed due to the corresponding reduction in packet transmission delay. However, the merits of such accuracy diminish with improvements in link speed as the impact on call admission decisions decreases. Meanwhile, overhead, in terms of the number of scheduling decisions to be made per unit time, increases with the number of packets transmitted. In response, this paper will present the QoS-Aware Fair Queuing (QFQ) service discipline which enables emulation servers to dynamically “tune” their service quanta based upon the QoS requirements of their currently supported applications rather than the network's maximum packet size. The paper will also demonstrate how the overhead of a GPS emulation server can be reduced in high speed networks without jeopardizing QoS guarantees or adversely impacting fairness.