meanSoujournTime

Mean sojourn time in the initial state i (without final probability of state j)

The idea of a computational algorithm described in the article by Andronov M. et al. (2022) <https://link.springer.com/chapter/10.1007/978-3-030-92507-9_13>.
The purpose of this package is to automate computations for a Markov-Modulated M/G/1 queuing system with alternating Poisson flow of arrivals. It offers a set of functions to calculate various mean indices of the system, including mean flow intensity, mean service busy and idle times, and the system's stationary probability.

Olga Zoldaka

MG1StationaryProbability

Computes Stationary Distribution for M/G/1 Queuing System

meanSoujournTime function

<dl><dt>i</dt>
<dd>MC i-th state</dd>
<dt>t</dt>
<dd>time value</dd></dl>

Arguments

Mean sojourn time in the initial state i (without final probability of state j) — meanSoujournTime

<dl>

<dt>i</dt>
<dd>MC i-th state</dd>


<dt>t</dt>
<dd>time value</dd>

</dl>

meanSoujournTime: Mean sojourn time in the initial state i (without final probability of state j)

Description

Usage

Value

Arguments

Examples