A finite buffer two class queue with different scheduling and push-out schemes

The authors analyze an M₁, M₂ /G₁, G₂/1/N queue with different scheduling and push-out schemes. They present an exact method to compute loss probabilities, the distribution of the number of class 1 packets in the system and the mean waiting time of a class 1 packet. An approximate solution is given for the computation of the mean waiting time for class 2 packets. The model allows general service time distributions for classes 1 and 2, as well as a general service discipline and a divided buffer management scheme. Numerical examples are included, which consider the loss probabilities and mean waiting time simultaneously