Garantir la qualité de service temps réel selon l'approche (m,k)-firm

Abstract : This work focuses on the scheduling algorithms under (m,k)-firm constraint, as well as the applications for QoS (quality of service) management in the networks and distributed real-time system. The research aim is to achieve the deterministic guarantee of QoS with high resource utilization. The contributions in this thesis include (1) proposing a sufficient condition for determining the schedulability of a real-time task set under Distance Base Priority scheduling algorithm; (2) defining a novel real-time constraint which relaxes the (m,k)-firm constraint and provides a more suitable modelling of soft real-time; (3) developing an effective resource provisioning algorithm under this relaxed (m,k)-firm constraint; (4) proposing an active queue management mechanism, called Double Leaks Bucket, which can guarantee the QoS with dynamic dropping of the packets during the networks overload period
Document type :
Theses
Complete list of metadatas

Cited literature [51 references]  Display  Hide  Download

https://hal.univ-lorraine.fr/tel-01752891
Contributor : Thèses Ul <>
Submitted on : Thursday, March 29, 2018 - 2:01:12 PM
Last modification on : Tuesday, April 24, 2018 - 1:30:12 PM

File

2007_LI_J.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : tel-01752891, version 1

Collections

Citation

Jian Li. Garantir la qualité de service temps réel selon l'approche (m,k)-firm. Autre [cs.OH]. Institut National Polytechnique de Lorraine, 2007. Français. ⟨NNT : 2007INPL012N⟩. ⟨tel-01752891⟩

Share

Metrics

Record views

49

Files downloads

18