Algorithms for the State Probabilities in a General Class of Single Server Queueing Systems with Group Arrivals
Single server queues with batch arrivals are useful in the modeling of computer and communication systems amongst others. In this paper we give for a wide class of single server queues with batch arrivals a stable recursive method to compute state probabilities both at arrival and at arbitrary epochs. This class includes finite capacity models with state dependent Markovian input in which batches could be totally or partially rejected. The customers of a batch are served individually and the service time has a general distribution function. In particular, we discuss as application the computation of operating characteristics, such as rejection probability and probability of server idleness, for a finite capacity M/G/1 queue for which arriving customers are rejected if their waiting plus service times exceed the capacity of the system.
Volume (Year): 27 (1981)
Issue (Month): 10 (October)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:27:y:1981:i:10:p:1178-1187. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.