G. Bernat and A. Burns, Combining (/sub m//sup n/)-hard deadlines and dual priority scheduling, Proceedings Real-Time Systems Symposium, pp.46-57, 1997.
DOI : 10.1109/REAL.1997.641268

G. Bernat and A. Burns, Weakly hard real-time systems, IEEE Transactions on Computers, vol.50, issue.4, pp.308-321, 2001.
DOI : 10.1109/12.919277

G. Bernat and R. Cayssials, Guaranteed On-line Weakly_Hard real-time systems, Proceedings of IEEE conference on real-time systems, p.12, 2001.
DOI : 10.1109/real.2001.990593
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.2177

G. Quan and X. Hu, Enhanced Fixed-priority Scheduling with (m, k)-firm Guarantee, 2000.

J. Chung, J. W. Liu, and K. Lin, Scheduling periodic jobs that allow imprecise results, IEEE Transactions on Computers, vol.39, issue.9, pp.1156-1175, 1990.
DOI : 10.1109/12.57057

M. K. Gardner and J. W. Liu, Performance of algorithms for scheduling real-time systems with overrun and overload, Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99, pp.287-296, 1999.
DOI : 10.1109/EMRTS.1999.777476

K. Gilad and S. Dennis, Dover: an optimal on-line scheduling algorithm for overloaded uni-processor realtime systems, Electronics Letters, vol.33, issue.15, pp.1301-1302, 1997.

D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1989.

F. Remeo, Simulated Annealing: Theory and Applications to Layout Problems, 1989.

M. Hamdaoui and P. Ramanathan, A dynamic priority assignment technique for streams with (m, k)-firm deadlines, IEEE Transactions on Computers, vol.44, issue.12, pp.1443-1451, 1995.
DOI : 10.1109/12.477249

M. Hamdaoui and P. Ramanathan, Evaluating dynamic failure probability for streams with (m, k)-firm deadlines, IEEE Transactions on Computers, vol.46, issue.12, pp.1325-1337, 1997.
DOI : 10.1109/12.641933

W. Lindsay, P. Ramanathan, and . Dbp-m, DBP-M: a technique for meeting end-to-end (m, k)-firm guarantee requirement in point-to-point networks, Proceedings of 22nd Annual Conference on Local Computer Networks, pp.294-303, 1999.
DOI : 10.1109/LCN.1997.630999

P. Ramanathan, Overload management in real-time control applications using (m, k)-firm guarantee, IEEE Transactions on Parallel and Distributed Systems, vol.10, issue.6, pp.549-559, 1999.
DOI : 10.1109/71.774906

C. C. Han and H. Tyan, A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms, Proceedings Real-Time Systems Symposium, pp.36-45, 1997.
DOI : 10.1109/REAL.1997.641267

G. Koren and D. Shasha, Skip-Over: algorithms and complexity for overloaded systems that allow skips, Proceedings 16th IEEE Real-Time Systems Symposium, pp.110-117, 1995.
DOI : 10.1109/REAL.1995.495201
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.4212

J. Lehoczky, L. Sha, and Y. Ding, The rate monotonic scheduling algorithm: exact characterization and average case behavior, [1989] Proceedings. Real-Time Systems Symposium, pp.166-171, 1989.
DOI : 10.1109/REAL.1989.63567

A. Striegel and G. Manimaran, Packet scheduling with delay and loss differentiation, Computer Communications, vol.25, issue.1, pp.21-31, 2002.
DOI : 10.1016/S0140-3664(01)00337-1

A. Striegel and G. Manimaran, Best-effort Scheduling of (m,k)-firm Real-time Streams in Multihop Networks, Workshop of Parallel and Distributed Real-Time Systems, 2000.

C. C. Chou and K. Shin, Statistical Real-Time Channels on Multi-access Bus Networks, IEEE Transaction on Parallel and Distributed Systems, vol.7, issue.8, pp.769-780, 1997.

R. West and C. Poellabauer, Analysis of a window-constrained scheduler for real-time and best-effort packet streams, Proceedings 21st IEEE Real-Time Systems Symposium, 1999.
DOI : 10.1109/REAL.2000.896013

B. Choi, D. Xuan, C. Li, R. Bettati, and W. Zhao, Scalable QoS Guaranteed Communication Services for Real-Time Applications, Proc. of the IEEE International Conf. on Distributed Computing Systems, 2000.

]. S. Wang, D. Xuan, R. Bettati, and W. Zhao, Providing Absolute Differentiated Services with Statistical Guarantees in Static Priority Scheduling Networks, Prods of IEEE Real-Time Technology and Applications Symposium (RTAS), 2001.

B. Gaujal, N. Navet, and J. Migge, Dual-Priority versus Background Scheduling: A Path-Wise Comparison, Journal of Real Time System [26.] R. L. Cruz, Quality of Service Guarantees in Virtual Circuit Switched Networks, 1995.
URL : https://hal.archives-ouvertes.fr/inria-00072931

R. L. Cruz, A Calculus for Network Delay, IEEE Transactions on Information Theory, vol.1, issue.2, 1991.

]. P. King, Computer Communication Systems Performance Modelling, 1990.

C. Buttazzo and G. , Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Application, 1997.
DOI : 10.1007/0-387-27578-9

H. Takagi, Queuing Analysis of Polling System: An Update in Stochastic Analysis of Computer and Communication System, pp.267-318, 1990.

R. Rom and M. Sidi, Multiple Access Protocols_ Performance and Analysis, 1990.