Efficacy of the Single Server Markovian Two-Phase Symmetric Queue with Encouraged Stationary-Queue-Size Analysis

Authors

  • R. Jeyachandhiran Department of Mathematics, School of advanced sciences, Vellore Institute of Technology, Vellore-632014, India
  • P. Rajendran Department of Mathematics, School of advanced sciences, Vellore Institute of Technology, Vellore-632014, India https://orcid.org/0000-0003-3694-2190

DOI:

https://doi.org/10.37256/cm.4420233505

Keywords:

encouraged arrival, stochastic Markov renewal process, vacation time, Bernoulli two vacation symmetric queue

Abstract

The efficacy of the Markovian single server symmetric queue is examined in this paper together with the suggested encouraged stationary queue-size analysis. First, we propose the stochastic Markov renewal process with encouraged arrival see time averages and encouraged arrival-stationary-queue-size analysis. The server takes further vacations after two extra service phases or until the server discovers a new set of clients in the service. Finally, we discuss the utility of the Bernoulli two-vacation symmetric queue, and it is clearly shown that the degree of efficiency rises when the encouraged arrival is taken into account.

Downloads

Published

2023-11-28

How to Cite

1.
Jeyachandhiran R, Rajendran P. Efficacy of the Single Server Markovian Two-Phase Symmetric Queue with Encouraged Stationary-Queue-Size Analysis. Contemp. Math. [Internet]. 2023 Nov. 28 [cited 2024 Apr. 15];4(4):1150-73. Available from: https://ojs.wiserpub.com/index.php/CM/article/view/3505