Priority Queueing Disciplines Loss Probabilities Mean Queues
Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Pliska Studia Mathematica Bulgarica, Vol. 14, No 1, (2003), 23p-36p
The non-preemptive priority queueing with a finite buffer is considered. A randomized push-out buffer management mechanism that allows to control very efficiently the loss probability of priority packets is introduced. The packet loss probabilities for priority and non-priority traffic are derived with the use of the generating function approach. For the standard non-randomized push-out scheme, the explicit analytic expressions are obtained. A procedure for the numerical calculation of mean queues is also proposed.