Aperiodic servers in a deadline scheduling environment
Real-Time Systems
Fundamental limits and tradeoffs of providing deterministic guarantees to VBR video traffic
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Efficient Admission Control for EDF Schedulers
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Schedulability Analysis and Utilization Bounds for Highly Scalable Real-Time Services
RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
Aperiodic task scheduling for real-time systems
Aperiodic task scheduling for real-time systems
| Hi-index | 0.00 |
Real-time packet schedulers have been studied extensively to support end-to-end bounded delay for multimedia traffic. Even though real-time flows are guaranteed by admission control scheme in the packet scheduler, their schedulability can be violated by arrival of non-real-time traffic. In this paper, we propose a new packet scheduler scheme to provide real-time traffic with predictability. Proposed scheme also provides non-real-time traffic with fast service time. We present the schedulability condition considering two packet schedulers and give the admission control algorithm.