Abstract
In this paper, we study the discrete time G I X / G Y / 1 queueing system. First, some general results are obtained for the stability condition, stationary distributions of the queue lengths and waiting times. Then we show that, for some practical situations, the queueing system of interest has the properties of both the M / G / 1 and G I / M / 1 non-skip-free Markov chains described by [H.R. Gail, S.L. Hantler, B.A. Taylor, Non-skip-free M / G / 1 and G I / M / 1 types of Markov chains, Advances in Applied Probability, 29 (3) (1997) 733–758]. For such cases, the queueing system can be analyzed as a QBD process, a M / G / 1 type Markov chain, or a G I / M / 1 type Markov chain with finite blocks after re-blocking. Computational procedures are developed for computing a number of performance measures for the queueing system of interest. In addition, we study a G I / M / 1 type Markov chain associated with the age process of the customers in service.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
