Analysing a finite buffer queue with finite number of vacation policy and correlated arrivals Online publication date: Tue, 16-Apr-2019
by K. Sikdar
International Journal of Operational Research (IJOR), Vol. 34, No. 4, 2019
Abstract: This paper analyses a MAP/G/1/N queue having finite number of vacations. The server takes a finite number (say J ≥ 0) of vacations whenever the system becomes empty at service completion epoch. If no clients are found by the end of the Jth vacation, the server does not go for vacation and stays in the system (called dormant period) until one client arrives. The number of vacations being finite and the server can utilise vacation periods for any other jobs. This is obvious that J = 1 and J → 1 lead to single and multiple vacation models, respectively. This research work mainly focuses more generalised vacation policy and different use cases. The following results have been obtained: 1) the distributions of clients in the queue at various epochs; 2) the Laplace-Stieltjes transform of the actual waiting-time distribution in the queue of a client under the FCFS discipline. The numerical data and graphs are presented to establish the analytical result.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook