The Priority Queueing With Finite Buffer Size and Randomized Push-Out Mechanism

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 nonpriority traffic are calculated using the generation 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