Skip to Main content Skip to Navigation
Conference papers

Loss-Tolerant QoS using Firm Constraints in Guaranteed Rate Networks

Anis Koubaa 1 Ye-Qiong Song 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00099989
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:13:13 AM
Last modification on : Thursday, January 11, 2018 - 6:20:06 AM

Identifiers

  • HAL Id : inria-00099989, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

126