This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Evaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines
December 1997 (vol. 46 no. 12)
pp. 1325-1337

Abstract—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] C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne, “Real-Time Communication in Packet-Switched Networks,” Proc. IEEE, vol. 82, no. 1, pp. 122-139, Jan. 1994.
[2] J.J. Bae and T. Suda,“Survey of traffic control schemes and protocols in ATM networks,” IEEE Proc., vol. 79, pp. 170-189, Feb. 1991.
[3] R. Chipalkatti,J.F. Kurose,, and D. Towsley,“Scheduling policies for real-time and non-real-time traffic in a statistical multiplexer,” IEEE INFOCOM, pp. 774-783, Apr. 1989.
[4] J.Y. Chung,J.W.S. Liu,, and K.J. Lin,“Scheduling Periodic Jobs That Allows Imprecise Results,” IEEE Transactions on Computers, vol.19, no. 9, pp. 1156-1173, September 1990.
[5] M. Hamdaoui and P. Ramanathan, "A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines," IEEE Trans. Computers, vol. 44, no. 12, pp. 1,443-1,451, Dec. 1995.
[6] J. Hong,X. Tan,, and D. Towsley,“A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system,” IEEE Transactions on Computers, vol. 38, pp. 1,736-1,744, Dec. 1989.
[7] L. Kant and W.H. Sanders, "Loss Process Analysis of the Knockout Switch Using Stochastic Activity Networks," Proc. Int'l Conf. Computer Comm. and Network, pp. 344-349, Sept. 1995.
[8] L. Kleinrock, Queueing Systems, vols. Iand II. John Wiley and Sons, 1976.
[9] K. Kubota, M. Murata, H. Miyahara, and Y. Oie, "Congestion Control for Bursty Video Traffic in ATM Networks," Electronics and Comm. in Japan, vol. 175, pp. 13-19, Apr. 1992.
[10] J.W.S. Liu, K.-J. Lin, C.L. Liu, W.K. Shih, and J.Y. Chung, "Imprecise Computations: A Means to Provide Scheduling Flexibility and Enhance Dependability," Readings in Real-Time Systems, Y.-H. Lee and C.M. Krishna, eds., chapter 2, pp. 81-97. IEEE CS Press, 1993.
[11] J.W.S. Liu,K.J. Lin,W.K. Shih,J.Y. Chung,A. Yu,, and W. Zhao,“Algorithms for Scheduling Imprecise Computations,” IEEE Computer, pp. 58-68, May 1991.
[12] R. Nagarajan, "Quality-of-Service Issues in High-Speed Networks," PhD thesis, Univ. of Massachusetts, Amherst, Sept. 1993.
[13] L. Tierney, Lispstat: An Object-Orientated Environment for Statistical Computing and Dynamic Graphics. New York: Wiley, 1991.

Index Terms:
Real-time systems, dynamic failure, priority queues, analytic modeling, quality of service guarantees.
Citation:
Moncef Hamdaoui, Parameswaran Ramanathan, "Evaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines," IEEE Transactions on Computers, vol. 46, no. 12, pp. 1325-1337, Dec. 1997, doi:10.1109/12.641933
Usage of this product signifies your acceptance of the Terms of Use.