Best-Effort Scheduling of (m, k)-Firm Real-Time Streams in Multihop Networks
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Energy-efficient dual-voltage soft real-time system with (m,k)-firm deadline guarantee
Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
Scalability and QoS guarantee for streams with (m,k)-firm deadline
Computer Standards & Interfaces
Enhanced WFQ algorithm with (m,k)-firm guarantee
ICESS'04 Proceedings of the First international conference on Embedded Software and Systems
WWIC'05 Proceedings of the Third international conference on Wired/Wireless Internet Communications
Best-effort scheduling of (m,k)-firm real-time streams in multihop networks
Computer Communications
| Hi-index | 0.00 |
A real-time message stream is said to have an \firm{m}{k} guarantee requirement if at least m out of any k consecutive messages from the stream must meet their deadlines to ensure adequate quality of service. Hamdaoui and Ramanathan recently proposed a scheduling policy %based on a dynamic priority assignment technique called Distance-based Priority Assignment (DBP) to better service multiple real-time streams, each with its own \firm{m}{k} guarantee requirement. The key assumption in the DBP technique is that all messages reach their destination in one hop. This assumption, however, is not valid in most networks because there is often no direct connection between the source and the destination nodes of a real-time stream. In this paper, the DBP scheme is extended to deal with streams in which the messages traverse more than one hop in reaching their destination. Through empirical evaluation, it is also shown that this extended DBP scheme, called DBP-M, performs better than existing policies in reducing the probability of not meeting the \firm{m}{k} guarantee requirement.