Steady state analysis of the GI/M/1/N queue with a variant of multiple working vacations

Steady state analysis of the GI/M/1/N queue with a variant of multiple working vacations

0.00 Avg rating0 Votes
Article ID: iaor201110333
Volume: 61
Issue: 4
Start Page Number: 1296
End Page Number: 1301
Publication Date: Nov 2011
Journal: Computers & Industrial Engineering
Authors: ,
Keywords: markov processes, queues: applications
Abstract:

This paper studies the GI/M/1/N queue with a variant of multiple working vacations, where the server leaves for a working vacation as soon as the system becomes empty. The server takes at most H consecutive working vacations if the system remains empty after the end of a working vacation. Employing the supplementary variable and embedded Markov chain methods, we obtain the queue length distribution at different time epochs. Based on the various system length distribution, the probability of blocking, mean waiting times and mean system lengths have been derived. Finally, numerical results are discussed.

Reviews

Required fields are marked *. Your email address will not be published.