Conference paper
D. A. Hayes, M. Rumsewicz, L. Andrew
Proceedings of the IEEE Conference on Computer Communications (INFOCOM), 1999 Mar, pp. 405--412
Proceedings of the IEEE Conference on Computer Communications (INFOCOM), 1999 Mar, pp. 405--412
View PDF
Semantic Scholar
DBLP
DOI
Cite
Cite
APA
Click to copy
Hayes, D. A., Rumsewicz, M., & Andrew, L. (1999). Quality of service driven packet scheduling disciplines for real-time applications: looking beyond fairness. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM) (pp. 405–412). https://doi.org/10.1109/INFCOM.1999.749308
Chicago/Turabian
Click to copy
Hayes, D. A., M. Rumsewicz, and L. Andrew. “Quality of Service Driven Packet Scheduling Disciplines for Real-Time Applications: Looking beyond Fairness.” In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), 405–412, 1999.
MLA
Click to copy
Hayes, D. A., et al. “Quality of Service Driven Packet Scheduling Disciplines for Real-Time Applications: Looking beyond Fairness.” Proceedings of the IEEE Conference on Computer Communications (INFOCOM), 1999, pp. 405–12, doi:10.1109/INFCOM.1999.749308.
BibTeX Click to copy
@inproceedings{d1999a,
title = {Quality of service driven packet scheduling disciplines for real-time applications: looking beyond fairness},
year = {1999},
month = mar,
pages = {405--412},
doi = {10.1109/INFCOM.1999.749308},
author = {Hayes, D. A. and Rumsewicz, M. and Andrew, L.},
booktitle = {Proceedings of the IEEE Conference on Computer Communications (INFOCOM)},
month_numeric = {3}
}
Abstract
In this paper we focus on real-time scheduling of "soft" real-time data services such as multimedia data, MPEG video streaming and IP telephony, which can tolerate a small degree of loss or delay. We argue that network operators and service providers should be able to select from a range of quality of service objectives, including maximizing the number of customers receiving good service. Further, we argue that scheduling disciplines such as fair queueing are unable to achieve such goals and hence there is a need for alternative approaches. We propose a new scheduling scheme, which we call the dual queue discipline. We show that the dual queue has the flexibility to satisfy a variety of QoS objectives, ranging from existing notions of fairness through to maximizing the number of customers receiving good service. In addition, even the simplest dual queue implementation outperforms fair queueing, is scalable in the number of active sessions, and can be made fair, if desired, over moderate to long time scales.
