Abstract

Consider a GI/M/1 queue with multiple vacations. As soon as the system becomes empty, the server either begins an ordinary vacation with probability q(0⩽q⩽1) or takes a working vacation with probability 1-q. We assume the vacation interruption is controlled by Bernoulli. If the system is non-empty at a service completion instant in a working vacation period, the server can come back to the normal busy period with probability p(0⩽p⩽1) or continue the vacation with probability 1-p. Using the matrix-analytic method, we obtain the steady-state distributions for the queue length both at arrival and arbitrary epochs. The waiting time and sojourn time are also derived by different methods. Finally, some numerical examples are presented.

Full Text
Paper version not known

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 call

Disclaimer: 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.