Evaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines

A real-time stream is said to have (m, k)-firm deadlines if at least m out of any k-consecutive customers from the stream must meet their respective deadlines. Such a stream is said to have encountered a dynamic failure if fewer than m out of any k consecutive customers meet their deadlines. Hamdaoui and Ramanathan recently proposed a scheduling policy called Distance Based Priority (DBP) in which customers are serviced with a higher priority if their streams are closer to a dynamic failure. In terms of reducing the probability of dynamic failure, Hamdaoui and Ramanathan also showed, using simulation, that the DBP policy is better than a policy in which all customers are serviced at the same priority level. In this paper, an analytic model is developed for computing the probability of dynamic failure of a real-time stream for the DBP and the single priority schemes. This model is useful for providing statistical quality of service guarantees to real-time streams. The probability of dynamic failure computed using this model is compared to the results from a discrete-event simulator. The comparison shows that the model is accurate for low and moderate loads.

[1]  Jane W.-S. Liu,et al.  Scheduling Periodic Jobs That Allow Imprecise Results , 1990, IEEE Trans. Computers.

[2]  Henning Schulzrinne,et al.  Real-time communication in packet-switched networks , 1994, Proc. IEEE.

[3]  Masayuki Murata,et al.  Congestion control for bursty video traffic in ATM networks , 1992 .

[4]  Donald F. Towsley,et al.  A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System , 1989, IEEE Trans. Computers.

[5]  Donald F. Towsley,et al.  Scheduling policies for real-time and non-real-time traffic in a statistical multiplexer , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Parameswaran Ramanathan,et al.  A service policy for real-time customers with (m,k) firm deadlines , 1994, Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing.

[7]  Tatsuya Suda,et al.  Survey of traffic control schemes and protocols in ATM networks , 1991, Proc. IEEE.

[8]  Henning Schulzrinne,et al.  Congestion control for real-time traffic in high-speed networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[9]  William H. Sanders,et al.  Loss process analysis of the knockout switch using stochastic activity networks , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[10]  Parameswaran Ramanathan,et al.  A Dynamic Priority Assignement Technique for Streams with (m, k)-Firm Deadlines , 1995, IEEE Trans. Computers.

[11]  Wei-Kuan Shih,et al.  Algorithms for scheduling imprecise computations , 1991, Computer.

[12]  Ramesh Nagarajan.  Quality-of-service issues in high-speed networks , 1993 .