Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\)
- 14 Downloads
In this paper, we provide a complete analysis of a discrete-time infinite buffer queue in which customers arrive in batches of random size such that the inter-arrival times are arbitrarily distributed. The customers are served in batches by a single server according to the random serving capacity rule, and the service times are geometrically distributed. We model the system via the supplementary variable technique and further use the displacement operator method to solve the non-homogeneous difference equation. The analysis done using these methods results in an explicit expression for the steady-state queue-length distribution at pre-arrival and arbitrary epochs simultaneously, in terms of roots of the underlying characteristic equation. Our approach enables one to estimate the asymptotic distribution at a pre-arrival epoch by a unique largest root of the characteristic equation lying inside the unit circle. With the help of few numerical results, we demonstrate that the methodology developed throughout the work is computationally tractable and is suitable for light-tailed inter-arrival distributions and can also be extended to heavy-tailed inter-arrival distributions. The model considered in this paper generalizes the previous work done in the literature in many ways.
KeywordsBatch arrival Difference equation Discrete-time Random service capacity Renewal process Supplementary variable
Mathematics Subject Classification60K25
The author F. P. Barbhuiya is grateful to Indian Institute of Technology Kharagpur, India, for the financial support. The authors would like to thank the anonymous referee for their valuable remarks and suggestions which led to the paper in the current form.
- 1.Abolnikov, L., Dukhovny, A.: Markov chains with transition delta-matrix: ergodicity conditions, invariant probability measures and applications. Int. J. Stoch. Anal. 4(4), 333–355 (1991)Google Scholar
- 12.Cordeau, J.L., Chaudhry, M.L.: A simple and complete solution to the stationary queue-length probabilities of a bulk-arrival bulk-service queue. Infor. 47, 283–288 (2009)Google Scholar
- 14.Feller, W.: An Introduction to Probability Theory and its Applications, vol. 1. Wiley, New York (1968)Google Scholar
- 18.Hunter, J .J.: Mathematical Techniques of Applied Probability: Discrete Time Models, Techniques and Applications. Academic Press, Cambridge (1983)Google Scholar
- 23.Takagi, H.: Queuing Analysis: A Foundation of Performance Evaluation. Discrete Time Systems, vol. 3. North-Holland, Amsterdam (1993)Google Scholar
- 25.Woodward, M.E.: Communication and Computer Networks: Modelling with Discrete-Time Queues. Wiley-IEEE Computer Society Pr, Hoboken (1994)Google Scholar