Loss-Tolerant QoS using Firm Constraints in Guaranteed Rate Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Loss-Tolerant QoS using Firm Constraints in Guaranteed Rate Networks

Anis Koubaa
  • Function : Author
  • PersonId : 835403
Ye-Qiong Song


We propose in this paper a trade-off between hard and soft real-time guarantees to maintain an acceptable QoS guarantee in overload condition and maximize efficiently the utilization of network resources. The key of our solution is that many real-time applications are loss-tolerant, but the loss profile must be well defined since successive packet losses are not suitable. We use the concept of (m,k)-firm timing constraints to define a novel guaranteed loss-tolerant QoS. Therefore, we extend the basic WFQ algorithm to take into account the firm timing constraints to provide lower delay guarantees without violating bandwidth fairness or misusing network resources. The proposal is called (m,k)-WFQ. Using Network Calculus formalism, analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. Theoretical results and simulations show a noticeable improvement on delay guarantee made by (m,k)-WFQ compared to standard WFQ algorithm without much degrading bandwidth fairness.
No file

Dates and versions

inria-00099989 , version 1 (26-09-2006)


  • HAL Id : inria-00099989 , version 1


Anis Koubaa, Ye-Qiong Song. Loss-Tolerant QoS using Firm Constraints in Guaranteed Rate Networks. 10th IEEE Real-Time and Embedded Technology and Applications - RTAS'04, 2004, Toronto, Canada, pp.526--535. ⟨inria-00099989⟩
44 View
0 Download


Gmail Facebook X LinkedIn More