Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Modeling and analysis of a variable bit rate video multiplexer
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
A traffic for MPEG-coded VBR streams
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Packet loss effects on MPEG video sent over the public Internet
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
IEEE Transactions on Computers
Real-Time Systems - Flexible Scheduling on Real-Time Systems
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Analysis of Audio Packet Loss in the Internet
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Dynamic class-based queue management for scalable media servers
Journal of Systems and Software
Firm Real-Time System Scheduling Based on a Novel QoS Constraint
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
The Weighted Fair Queueing (WFQ) scheduling algorithm and its variants can be used to provide real-time guarantees by making bandwidth reservation. However, while hard guarantees are based on a peak workload model that leads to underutilize network resources, soft guarantees, based on average workload model, are not always sufficient to maintain acceptable Quality-of-Service (QoS) since consecutive packet losses or deadline misses may occur, which are not suitable for real-time applications. In this paper, we propose a trade-off between hard and soft real-time guarantees to maintain an acceptable QoS in overload conditions and efficiently maximize the utilization of network resources. The key to our solution is based on the fact that many real-time applications, such as voice and video, are loss-tolerant. The loss profile must be well defined, and such a profile can be easily specified using the (m,k)-firm model. Therefore, we propose the (m,k)-WFQ algorithm to take into account (m,k)-firm timing constraints to provide delay guarantees of at least m packets out of any k consecutive packets without violating bandwidth fairness or misusing network resources. Using the Network Calculus theory, an analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. We extend our analytic results for guaranteed-rate networks, such as the IntServ QoS model and ATM networks, and the DiffServ QoS model. Analytic results and simulations show a noticeable improvement in delay guarantee made by (m,k)-WFQ compared to WFQ without much degradation of bandwidth fairness.