Lightweight kernel/user communication for real-time and multimedia applications
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Adaptive feedback scheduling of incremental and design-to-time tasks
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Coordinated CPU and event scheduling for distributed multimedia applications
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Cooperative run-time management of adaptive applications and distributed resources
Proceedings of the tenth ACM international conference on Multimedia
Algorithms for Switch-Scheduling in the Multimedia Router for LANs
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
MMNS '02 Proceedings of the 5th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
Rate-Based Resource Allocation Models for Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Dynamic class-based queue management for scalable media servers
Journal of Systems and Software
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
IEEE Transactions on Computers
Opportunistic channels: mobility-aware event delivery
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Analysis of a window-constrained scheduler for real-time and best-effort packet streams
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Proceedings of the 2011 International Conference on Communication, Computing & Security
| Hi-index | 0.00 |
Real-time media servers need to service hundreds and, possibly, thousands of clients, each with their own quality of service (QoS) requirements. To guarantee such diverse QoS requires fast and efficient scheduling support at the server. This paper describes the practical issues concerned with the implementation of a scalable real-time packet scheduler resident on a server, designed to meet service constraints on information transferred across a network to many clients. Specifically, we describe the implementation issues and performance achieved by Dynamic Window-Constrained Scheduling (DWCS), which is designed to meet the delay and loss constraints on packets from multiple streams with different performance objectives. In fact, DWCS is designed to limit the number of late packets over finite numbers of consecutive packets in loss-tolerant and/or delay-constrained, heterogeneous traffic streams. We show how DWCS can be efficiently implemented to provide service guarantees to hundreds of streams. We compare the costs of different implementations, including an approximation algorithm, which trades service quality for speed of execution.