Randomized push-out disciplines in priority queueing (Q1781659)

The paper considers a queueing system with two classes of packets. The packets of different classes arrive at the system according to the Poisson processes with different rates. The service time has the exponential distribution with the same rate for each class. The buffer has a finite size and is shared by both types of customers. If the buffer is full, a newly arriving customer of class 1 can push out of the buffer a customer of class 2 with a predetermined probability. To solve steady-state Kolmogorov equations, the paper uses a generating function approach, which only requires the solution of a finite linear system of equations.