A priority queue with superimposed geometric batch arrivals

In this paper, algorithms are derived that permit the exact evaluation of the steady state waiting and system time probabilities, for two different priority custome types, in a discrete time, batch arrival queueing system, which has infinite waiting space. All customers have integer, but non-zero, service times that are generally distributed. Both preemptive and non-preemptive scheduling is considered. Numerical results are presented indicating how these algorithms can be used to study certain problems arising in future telecommunications networks.