Skip to Main content Skip to Navigation

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

Jian Li 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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 determin-ing the schedulability of a real-time task set under Distance Base Priority scheduling al-gorithm; (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 re-source 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.
Complete list of metadata

Cited literature [59 references]  Display  Hide  Download
Contributor : Jian Li Connect in order to contact the contributor
Submitted on : Thursday, April 5, 2007 - 4:50:07 PM
Last modification on : Saturday, March 13, 2021 - 3:32:25 AM
Long-term archiving on: : Wednesday, April 7, 2010 - 3:11:15 AM


  • HAL Id : tel-00140318, version 1



Jian Li. Garantir la qualité de service temps réel selon l'approche (m,k)-firm. Réseaux et télécommunications [cs.NI]. Institut National Polytechnique de Lorraine - INPL, 2007. Français. ⟨tel-00140318⟩



Record views


Files downloads