Abstract
In this paper, we study a single server queue with finite capacity where the arrival process is Neuts' versatile Markovian point process (the N-process). Many arrival processes are special cases of this iV-process, such as the Markov modulated Poisson process, the renewal process of phase-type and others. The service times are generally distributed. We obtain recursive formulas for the joint distribution of the length of the busy period and the number of customers served during such a period. The queue length distribution, both at departure instants and at an arbitrary time instant are derived. The Laplace-Stielt jes transform of the virtual waiting time distribution is also obtained. This result generalizes Lavenberg's formula for the M/G/l finite capacity queue to the present model.
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.
