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

  • Authors:
  • Konstantin E. Avrachenkov;Nikita O. Vilchevsky;Georgy L. Shevlyakov

  • Affiliations:
  • INRIA Sophia Antipolis, 2004 Route des Lucioles, B.P. 93, Sophia Antipolis Cedex 06902, France;St. Petersburg State Polytechnic University, 29 Polytechnicheskaya Street, St. Petersburg 195251, Russia;Department of Information and Communications, Gwangju Institute of Science and Technology (GIST), 1 Oryong-dong, Buk-gu, Gwangju 500-712, South Korea

  • Venue:
  • Performance Evaluation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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. In the particular case of the standard non-randomized push-out scheme we obtain explicit analytic expressions. The theoretical results are illustrated by numerical examples. The randomized push-out scheme is compared with the threshold based push-out scheme. It turns out that the former is much easier to tune than the latter. The proposed scheme can be applied to the Differentiated Services of the Internet.