Best-effort scheduling of (m,k)-firm real-time streams in multihop networks
In this paper, we address the problem of best-effort scheduling of (m,k)-firm real-time streams in multihop networks. The existing solutions for the problem ignore scalability considerations because the solutions maintain a separate queue for each stream and maintain per-stream state information. In this context, we propose a scheduling algorithm, Enhanced Distance Based Priority (EDBP), which is scalable (fixed scheduling cost) while offering performance close to that of the existing solutions. The proposed EDBP algorithm achieves this by allowing multiplexing of streams into a fixed number of queues and by using the notion of a look-ahead window. In the EDBP algorithm, at any point of time, the best packet for transmission is selected based on the state of the stream combined with the laxity of the packet, We have conducted extensive simulation studies to evaluate the effectiveness of thr proposed EDBP algorithm by comparing it with existing algorithms fur the problem. The simulation studies reveal that the dynamic failure performance of the EDBP algorithm is very close to that of the existing algorithms with a significant reduction in scheduling cost. (C) 2000 Elsevier Science B.V. All rights reserved.
best-effort scheduling real-time streams multihop networks dynamic failure