1. Alternative approach based on roots for computing the stationary queue-length distributions in GIX/M(1,b)/1 single working vacation queue
- Author
-
Miaomiao Yu
- Subjects
021103 operations research ,Markov chain ,Group (mathematics) ,0211 other engineering and technologies ,Characteristic equation ,Generating function ,02 engineering and technology ,Management Science and Operations Research ,01 natural sciences ,Computer Science Applications ,Theoretical Computer Science ,Exponential function ,Computer Science::Performance ,010104 statistics & probability ,Distribution (mathematics) ,Computer Science::Networking and Internet Architecture ,Applied mathematics ,Rouché's theorem ,0101 mathematics ,Queue ,Mathematics - Abstract
The purpose of this paper is to present an alternative algorithm for computing the stationary queue-length and system-length distributions of a single working vacation queue with renewal input batch arrival and exponential holding times. Here we assume that a group of customers arrives into the system, and they are served in batches not exceeding a specific number b. Because of batch arrival, the transition probability matrix of the corresponding embedded Markov chain for the working vacation queue has no skip-free-to-the-right property. Without considering whether the transition probability matrix has a special block structure, through the calculation of roots of the associated characteristic equation of the generating function of queue-length distribution immediately before batch arrival, we suggest a procedure to obtain the steady-state distributions of the number of customers in the queue at different epochs. Furthermore, we present the analytic results for the sojourn time of an arbitrary customer in a batch by utilizing the queue-length distribution at the pre-arrival epoch. Finally, various examples are provided to show the applicability of the numerical algorithm.
- Published
- 2021