Evaluating dynamic failure probability for streams with (m, k)-firm deadlines
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 46 (12) , 1325-1337
- https://doi.org/10.1109/12.641933
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Congestion control for real-time traffic in high-speed networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Loss process analysis of the knockout switch using stochastic activity networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A dynamic priority assignment technique for streams with (m, k)-firm deadlinesIEEE Transactions on Computers, 1995
- Real-time communication in packet-switched networksProceedings of the IEEE, 1994
- Congestion control for bursty video traffic in ATM networksElectronics and Communications in Japan (Part I: Communications), 1992
- Algorithms for scheduling imprecise computationsComputer, 1991
- Survey of traffic control schemes and protocols in ATM networksProceedings of the IEEE, 1991
- Scheduling periodic jobs that allow imprecise resultsIEEE Transactions on Computers, 1990
- A performance analysis of minimum laxity and earliest deadline scheduling in a real-time systemIEEE Transactions on Computers, 1989