Priority queueing with finite buffer size and randomized push-out mechanism - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2002

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

Résumé

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.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-4434.pdf (225.45 Ko) Télécharger le fichier
Loading...

Dates et versions

inria-00072154 , version 1 (23-05-2006)

Identifiants

  • HAL Id : inria-00072154 , version 1

Citer

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

Partager

Gmail Facebook X LinkedIn More