S. Floyd and V. Jacobson, Random early detection gateways for congestion avoidance, IEEE/ACM Transactions on Networking, vol.1, issue.4, 1993.
DOI : 10.1109/90.251892

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

A. Koubâa, Gestion de la qualité de service temporelle selon la contrainte (m,k)-firm dans les réseaux à commutation de paquets, Thèse INPL, 2004.

Y. Q. Song, A. Koubâa, and J. Li, Qualité de service temps réel selon le modèle (m,k)-firm », Systèmes temps réel, pp.213-244, 2006.

J. Li, Garantir la qualité de service temps réel selon l'approche (m,k)-firm, Thèse INPL, pp.14-2007

C. L. Liu and J. W. Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM, vol.20, issue.1, pp.46-61, 1973.
DOI : 10.1145/321738.321743

R. L. Cruz, A calculus for network delay. I. Network elements in isolation, IEEE Transactions on Information Theory, vol.37, issue.1, pp.114-131, 1991.
DOI : 10.1109/18.61109

R. L. Cruz, A calculus for network delay. II. Network analysis, IEEE Transactions on Information Theory, vol.37, issue.1, pp.132-141, 1991.
DOI : 10.1109/18.61110

C. S. Chang, Performance Guarantees in Communication Networks, 2000.

L. Boudec, J. Y. , and P. Thiran, Network Calculus: A Theory of Deterministic Queueing Systems For The Internet, Online Version of the Book of, 2002.

L. Kleinrock, Queueing systems, 1975.

L. Kleinrock, Queueing systems Computer application, 1976.

K. Tindell, Fixed Priority Scheduling of Hard Real-Time Systems, 1994.

M. Joseph and P. Pandya, Finding Response Times in a Real-Time System, The Computer Journal, vol.29, issue.5, pp.390-395, 1986.
DOI : 10.1093/comjnl/29.5.390

J. P. Lehoczky, Fixed priority scheduling of periodic task sets with arbitrary deadlines, [1990] Proceedings 11th Real-Time Systems Symposium, pp.201-209, 1990.
DOI : 10.1109/REAL.1990.128748

N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings, Applying new scheduling theory to static priority pre-emptive scheduling, Software Engineering Journal, vol.8, issue.5, pp.284-292, 1993.
DOI : 10.1049/sej.1993.0034

A. Burns, M. Nicholson, K. Tindell, and . Zhang, Allocating and Scheduling Hard Real-time Tasks on a Point-to-Point Distributed System, Time Systems, pp.11-20, 1993.

K. Jeffay, D. F. Stanat, and C. U. Martel, On Non Preemptive Scheduling of Periodic and Sporadic Task, IEEE real-time systems symposium, pp.129-139, 1991.

L. Georges, P. Mühlethaler, and N. Rivierre, A Few Results on Non-Preemptive Real-Time Scheduling, INRIA research report n°RR3926, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00072726

L. Georges, N. Rivierre, and M. Spuri, Preemptive and Non- Preemptive Real-Time UniProcessor Scheduling, INRIA research report n°RR INRIA2966, 1996.

P. Briand and M. Roy, Meeting Deadlines in Hard Real- Time Systems, The Rate Monotonic Approach, IEEE computer Society

Y. Q. Song, Time Constrained Communication Over Switched Ethernet, Proc. of IFAC Fet, pp.177-184, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100586

Y. Q. Song, A. Koubâa, and F. Simonot, Switched Ethernet For Real-Time Industrial Communication: Modelling And Message Buffering Delay Evaluation, th IEEE WFCS'2002, pp.27-35, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00100920

J. Jasperneite, P. Neumann, M. Theis, and K. Watson, Deterministic real-time communication with switched Ethernet, 4th IEEE International Workshop on Factory Communication Systems, 2002.
DOI : 10.1109/WFCS.2002.1159695

H. Charara, J. Scharbarg, J. Ermont, and C. Fraboul, Methods for bounding end-to-end delays on an AFDX network, 18th Euromicro Conference on Real-Time Systems (ECRTS'06), 2006.
DOI : 10.1109/ECRTS.2006.15

A. K. Parekh and R. G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: the single-node case, IEEE/ACM Transactions on Networking, vol.1, issue.3, pp.344-357, 1993.
DOI : 10.1109/90.234856

S. Wang, Y. Wang, and K. Lin, Integrating Priority with Share in the Priority-Based Weighted Fair Queueing Scheduler for Real-Time Networks, Journal of RTS, pp.119-149, 2002.

G. Quan and X. Hu, Enhanced Fixed-priority Scheduling with (m, k)-firm Guarantee, 21st IEEE RTSSUSA), pp.79-88, 2000.

A. K. Mok and W. R. Wang, Window-constrained real-time periodic task scheduling, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420), pp.15-24, 2001.
DOI : 10.1109/REAL.2001.990592

J. Li, Sufficient Condition for Guaranteeing (m,k)-firm Real-Time Requirement Under NP-DBP-EDF Scheduling, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099703

R. West, Y. Zhang, K. Schwan, and C. Poellabauer, Dynamic window-constrained scheduling of real-time streams in media servers, IEEE Transactions on Computers, vol.53, issue.6, pp.744-759, 2004.
DOI : 10.1109/TC.2004.10

Y. Zhang, R. West, and X. Qi, A Virtual Deadline Scheduler for Window-Constrained Service Guarantees, 25th IEEE RTSS, 2004.

N. Jia, E. Hyon, and Y. Q. Song, Ordonnancement sous contraintes (m,k)-firm et combinatoire des mots, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000670