Loss-bounded analysis for differentiated services

Alexander Kesselman*, Yishay Mansour

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic streams. We focus on loss and first show that only trivial bounds could be obtained by means of traditional competitive analysis. Then we introduce a new approach for estimating loss of an online policy called loss-bounded analysis. In loss-bounded analysis the loss of an online policy is bounded by the loss of an optimal offline policy plus a constant fraction of the benefit of the online policy. We relate the loss-bounded analysis to the throughput-competitive analysis. We derive tight upper and lower bounds for various settings of DiffServ parameters using the new loss-bounded model. We believe that loss-bounded analysis is an important technique that can complement traditional competitive analysis providing new insight and interesting results.

Original languageEnglish
Pages (from-to)79-95
Number of pages17
JournalJournal of Algorithms
Issue number1
StatePublished - Jan 2003


  • Buffer scheduling
  • Competitive analysis
  • DiffServ
  • Loss-bounded analysis
  • Online algorithms


Dive into the research topics of 'Loss-bounded analysis for differentiated services'. Together they form a unique fingerprint.

Cite this