Skip to Main content Skip to Navigation
Reports

Priority queueing with finite buffer size and randomized push-out mechanism

Abstract : The non-preemptive priority queueing with a finite buffer is considered. We introduce a randomized push-out buffer management mechanism which allows to control very efficiently the loss probability of priority packets. The packet loss probabilities for priority and non-priority traffic are calculated using the generating function approach. For the particular case of the standard non-randomized push-out scheme we obtain explicit analytic expressions. The theoretical results are illustrated by a numerical example.
Document type :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00072154
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:55:34 PM
Last modification on : Thursday, September 24, 2020 - 10:22:03 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:55:53 PM

Identifiers

  • HAL Id : inria-00072154, version 1

Collections

Citation

Konstantin Avrachenkov, Nikita Vilchevsky, Georgy L. Shevlyakov. Priority queueing with finite buffer size and randomized push-out mechanism. [Research Report] RR-4434, INRIA. 2002. ⟨inria-00072154⟩

Share

Metrics

Record views

1955

Files downloads

563