Algorithms for the State Probabilities in a General Class of Single Server Queueing Systems with Group Arrivals
针对一类具有批量到达的单服务器排队系统，提出了一种稳定的递归方法，用于计算到达时刻和任意时刻的状态概率，适用于有限容量、状态依赖马尔可夫输入的模型，并讨论了M/G/1队列中拒绝概率和服务器空闲概率的计算。
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.