Open AccessDiscussion on the transient behavior of single server Markovian multiple variant vacation queues
Author(s) -
Manickam Vadivukarasi,
K. Kalidass
Publication year - 2021
Publication title -
badania operacyjne i decyzje/operations research and decisions
Language(s) - English
Resource type - Journals
eISSN - 2081-8858
pISSN - 1230-1868
DOI - 10.37190/ord210107
Subject(s) - beneficiary , computer science , transient (computer programming) , queue , markov process , markov chain , real time computing , computer network , operating system , mathematics , statistics , business , finance , machine learning
In this paper, we consider an M / M / 1 queue where beneficiary visits occur singly. Once the beneficiary level in the system becomes zero, the server takes a vacation immediately. If the server finds no beneficiaries in the system, then the server is allowed to take another vacation after the return from the vacation. This process continues until the server has exhaustively taken all the J vacations. The closed form transient solution of the considered model and some important time dependent performance measures are obtained. Further, the steady state system size distribution is obtained from the time-dependent solution. A stochastic decomposition structure of waiting time distribution and expression for the additional waiting time due to the presence of server vacations are studied. Numerical assessments are presented.