Loss-Tolerant QoS using Firm Constraints in Guaranteed Rate Networks

  • Authors:
  • Affiliations:
  • Venue:
  • RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose in this paper a trade-off between hardand soft real-time guarantees to maintain an acceptableQoS guarantee in overload condition and maximizeefficiently the utilization of network resources. The key ofour solution is that many real-time applications are loss-tolerant,but the loss profile must be well defined sincesuccessive packet losses are not suitable. We use theconcept of (m,k)-firm timing constraints to define a novelguaranteed loss-tolerant QoS. Therefore, we extend thebasic WFQ algorithm to take into account the firm timingconstraints to provide lower delay guarantees withoutviolating bandwidth fairness or misusing networkresources. The proposal is called (m,k)-WFQ. UsingNetwork Calculus formalism, analytic study gives thedeterministic delay bound provided by the (m,k)-WFQalgorithm for upper bounded arrival curve traffic.Theoretical results and simulations show a noticeableimprovement on delay guarantee made by (m,k)-WFQcompared to standard WFQ algorithm without muchdegrading bandwidth fairness.