Algorithmic computation of MAP/PH/1 queue with finite system capacity and two-stage vacations

Qingqing YeJournal of Industrial and Management Optimization 2019 · DOI

Abstract

In this article, we study a discrete-time MAP/PH/1 queue with finite system capacity and two-stage vacations. The two-stage vacations policy which comprises single working vacation and multiple vacations is featured by that once the system is empty during the regular busy period, the system first takes the working vacation during which the server can still provide the service but at a lower service rate. After this working vacation, if the system is empty, the server will take a vacation during which the server stops its service completely, otherwise, the server resumes to the normal service rate. For this queue, using the matrix-geometric combination solution method, we obtain the stationary probability vectors when the traffic intensity is not equal to one. In addition, we discuss the spectrum properties of the key matrices and give their decomposition results that can be used to reduce the computation loads. Further, waiting time is derived by constructing an absorbing Markov chain. Various performance measures are obtained. At last, some numerical examples are presented to show the impacts of system parameters on performance measures.
BibTeX
@article{ye2019algorithmic,
  author = {Qingqing Ye},
  title = {{Algorithmic computation of MAP/PH/1 queue with finite system capacity and two-stage vacations}},
  journal = {Journal of Industrial and Management Optimization},
  year = {2019},
  doi = {10.3934/jimo.2019063},
}

Loading related content...

Figure