Analysing a finite buffer queue with finite number of vacation policy and correlated arrivals

K. Sikdar

International Journal of Operational Research, 2019, vol. 34, issue 4, 582-605

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 J^th 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.

Keywords: finite buffer; finite vacation; Markovian arrival process; MAP; queue; steady state; single server; waiting time. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=99110 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:34:y:2019:i:4:p:582-605

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().