Abstract
This paper considers a finite-buffer discrete-time Geo X / G Y /1/ K+ B queue with multiple vacations that has a wide range of applications including high-speed digital telecommunication systems and various related areas. The main purpose of this paper is to present a performance analysis of this system. For this purpose, we first derive a set of linear equations to compute the steady-state departure-epoch probabilities based on the embedded Markov chain technique. Next, we present numerically stable relationships for the steady-state probabilities of the queue lengths at three different epochs: departure, random, and arrival. Finally, based on these relationships, we present various useful performance measures of interest such as the moments of the number of packets in the queue at three different epochs, the mean delay in the queue of a packet, the loss probability and the probability that server is busy with computational experiences.
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.
