z-logo
open-access-imgOpen Access
Finite Buffer GI/M(n)/1 Queue with Bernoulli-Schedule Vacation Interruption under N-Policy
Author(s) -
P. Vijaya Laxmi,
V. Suchitra
Publication year - 2014
Publication title -
international scholarly research notices
Language(s) - English
Resource type - Journals
ISSN - 2356-7872
DOI - 10.1155/2014/392317
Subject(s) - computer science , algorithm , schedule , queue , database , operating system , computer network
We study a finite buffer N -policy GI/M(n)/ 1 queue with Bernoulli-schedule vacation interruption. The server works with a slower rate during vacation period. At a service completion epoch during working vacation, if there are at least N customers present in the queue, the server interrupts vacation and otherwise continues the vacation. Using the supplementary variable technique and recursive method, we obtain the steady state system length distributions at prearrival and arbitrary epochs. Some special cases of the model, various performance measures, and cost analysis are discussed. Finally, parameter effect on the performance measures of the model is presented through numerical computations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom