Abstract
In a quasi-birth---death (QBD) queue, the level forward and level backward transitions of a QBD-type Markov chain are interpreted as customer arrivals and services. In the generalized QBD queue considered in this paper, arrivals and services can occur in matrix-geometrically distributed batches. This paper presents the queue length and sojourn time analysis of generalized QBD queues. It is shown that, if the number of phases is N, the number of customers in the system is order-N matrix-geometrically distributed, and the sojourn time is order-$$N^2$$N2 matrix-exponentially distributed, just like in the case of classical QBD queues without batches. Furthermore, phase-type representations are provided for both distributions. In the special case of the arrival and service processes being independent, further simplifications make it possible to obtain a more compact, order-N representation for the sojourn time distribution.
Sign-in/Register to access full text options 
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.
