Abstract
We consider two important classes of single-server bulk queueing models: M(X)/G(Y)/1 with Poisson arrivals of customer groups, and G(X)/m(Y)1 with batch service times having exponential density. In each class we compare two systems and prove that one is more congested than the other if their basic random variables are stochastically ordered in an appropriate manner. However, it must be recognized that a system that appears congested to customers might be working efficiently from the system manager's point of view. We apply the results of this comparison to (i) the family {M/G(s)/1,s ⩾ 1} of systems with Poisson input of customers and batch service times with varying service capacity; (ii) the family {G(s)/1,s ⩾ 1} of systems with exponential customer service time density and group arrivals with varying group size; and (iii) the family {M/D/s,s⩾ 1} of systems with Poisson arrivals, constant service time and varying number of servers. Within each family, we find the system that is the best for customers, but this turns out to be the worst for the manager (or vice versa). We also establish upper (or lower) bounds for the expected queue length in steady state and the expected number of batches (or groups) served during a busy period. The approach of the paper is based on the stochastic comparison of random walks underlying the models.
Similar content being viewed by others
References
U.N. Bhat, Imbedded Markov chain analysis of single server bulk queues, J. Aust. Math. Soc. 4(1964)244.
T.P. Bagchi and J.G.C. Templeton,Numerical Methods in Markov Chains and Bulk Queue, Lecture Notes in Economics and Mathematical Systems 72 (Springer-Verlag, New York, 1972).
M.L. Chaudhry and J.G.C. Templeton,A first Course in Bulk Queues (Wiley, New York, 1983).
C.M. Harris and N.U. Prabhu, Stochastic comparisons for single server queues, Naval Res. Logist. Quart. (1987), to appear.
N.U. Prabhu,Queues and Inventories (Wiley, New York, 1965).
N.U. Prabhu,Stochastic Storage Processes (Russian translation) (Mir Publishers, Moscow, 1984).
S. Stidham, On the optimality of single server queueing systems, Oper. Res. 18(1970)708.
D. Stoyan,Comparison Methods for Queues and Other Stochastic Models (English translation), ed. D.J. Daley (Wiley, New York, 1983).
A. Veinott, Optimal policy in a dynamic, single product, non-stationary inventory model with several demand classes, Oper. Res. 13(1965)761.
Author information
Authors and Affiliations
Additional information
This research was partially supported by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.
Rights and permissions
About this article
Cite this article
Prabhu, N.U. Stochastic comparisons for bulk queues. Queueing Syst 1, 265–277 (1987). https://doi.org/10.1007/BF01149538
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01149538