Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Computer networks (3rd ed.)
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
IEEE/ACM Transactions on Networking (TON)
Dynamic Window-Constrained Scheduling for Multimedia Applications
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
| Hi-index | 0.00 |
Multimedia communications involving digital audio and video has rather strict delay requirements. A Palindrome Schedule (PS) can guarantee service of real and non real-time packets. The deadline monotonic priority assignment (or inverse -deadline) is achieved by the component of PS called the scheduler table (STAB). Additionally we consider strict streams deadlines. For the service of the real time packets two proposed schemes are introduced. The first is a partitioning scheme, the Upper Bound (UB) scheme and the second is the Group Sharing (GS) scheme. The idea of a successive increase of the weight enables the server meet the strict deadlines of consecutively serviced packets streams. The technique of the cooperative flows makes the scheduler able to meet the deadlines of a pair of consecutive flows (in different queues) and provides a new solution to the problem of scheduling multiple tight delay constraints streams. To this direction two algorithms are provided: the Increasing Weight Algorithm (IWA) and the Cooperative Flows Algorithm (CFA). The framework of PS, including the Compound Round Robin (CRR) for large size non real time packets and the IWA with CFA for real-time packets, with the two schemata, will overcome the service difficulties of the streams with (m,k)-firm deadlines and will provide a new dimension for servicing real-time packets under tight deadlines (multimedia applications). Simulation results are provided.