Ergodicity and Invariance of Flows in Queuing Systems

Author(s)
G. Sh. Tsitsiashvili

Affiliation(s)

Institute for Applied mathematics, Far Eastern Branch of Russian Academy Sciences, Vladivostok, Russia.

Institute for Applied mathematics, Far Eastern Branch of Russian Academy Sciences, Vladivostok, Russia.

ABSTRACT

In this paper, we investigate the flow of customers through queuing systems with randomly varying intensities. The analysis of the Kolmogorov-Chapman system of stationary equations for this model showed that it is not possible to construct a convenient symbolic solution. In this paper an attempt is made to circumvent this requirement by referring to the ergodicity theorems, which gives the conditions for the existence of the limit distribution in the service processes, but do not require knowledge of them.

In this paper, we investigate the flow of customers through queuing systems with randomly varying intensities. The analysis of the Kolmogorov-Chapman system of stationary equations for this model showed that it is not possible to construct a convenient symbolic solution. In this paper an attempt is made to circumvent this requirement by referring to the ergodicity theorems, which gives the conditions for the existence of the limit distribution in the service processes, but do not require knowledge of them.

1. Introduction

In this paper, we investigate the flow of customers through queuing systems. This work was initiated by the task, which was set in 2000 to the author of the article by the late professor of the Australian National University (Canberra, Australia) Joe Gani. He proposed to calculate a model of a single-server queuing system with a Poisson input flow with a randomly changing intensity and a randomly changing service intensity. The analysis of the Kolmogorov-Chapman system of stationary equations for this model showed that it is not possible to construct a convenient symbolic solution and it is necessary to use numerical methods and to solve approximately a linear system of algebraic equations.

Progress in solving this problem could be obtained only recently, thanks to an appeal to Burke’s theorem on the coincidence of Poisson input and output flow distributions in the $M\mathrm{|}M\mathrm{|}n\mathrm{|}\infty $ system. However, the proof of this theorem [1] occurred to be rather cumbersome and inconvenient to extend to other queuing models, including systems in a random environment. Therefore, it was necessary to develop an alternative proof [2] of this theorem, based on the classical work of A.Ya. Khinchin [3] on the representation of Poisson flows.

However, this alternative proof required knowledge of limit distributions in queuing systems, which is not always possible to obtain in a symbolic form. Therefore, in this paper an attempt is made to circumvent this requirement by referring to the ergodicity theorems, which gives the conditions for the existence of the limit distribution in the service processes, but do not require knowledge of them.

2. Equality of Average Intensities of Input and Output Flows in the Queuing System

Consider queuing system A with Poisson input flow of intensity $\lambda $ . Let $x\left(t\right)$ be the number of customers of the input flow in the system A on a half-interval $\left(0,t\right]$ , $x\left(0\right)=0$ . Then the following relation is true.

lemma 1. The following almost sure convergence is true:

$\frac{x\left(t\right)}{t}\to \lambda ,\text{\hspace{0.17em}}t\to \infty .$ (1)

Proof. Let $\left[t\right]$ be an integer part of $t>1$ . Then almost surely the following relations are executed:

$\frac{x\left(\left[t\right]\right)}{\left[t\right]}\cdot \frac{\left[t\right]}{\left[t\right]+1}\le \frac{x\left(t\right)}{t}\le \frac{x\left(\left[t\right]+1\right)}{\left[t\right]+1}\cdot \frac{\left[t\right]+1}{\left[t\right]}\mathrm{,}$ (2)

with

$x\left(\left[t\right]\right)={\displaystyle \underset{i=0}{\overset{\left[t\right]-1}{\sum}}}\left(x\left(i+1\right)-x\left(i\right)\right),$ (3)

where all terms in equality (3) are independent and have Poisson distribution with the parameter $\lambda $ . Then from the relations (2), (3) and the strengthened law of large numbers (see, for example, ( [4] , Chapter 8, $4$)) we have the equality (1).

Corollary 1. From Lemma 1 we have the convergence by probability in the relation (1).

Denote $y\left(t\right)$ the number of customers that came out of the queuing system A on the half-interval $\left(0,t\right]$ and put $z\left(t\right)$ the number of customers in the system at time t.

Theorem 1. If the random process $z\left(t\right)$ is ergodic and stationary, then the convergence by probability is true

$\frac{y\left(t\right)}{t}\to \lambda \mathrm{,}\text{\hspace{0.17em}}t\to \infty \mathrm{.}$ (4)

Proof. With probability one, the following equality is performed

$x\left(t\right)=y\left(t\right)+z\left(t\right),\text{\hspace{0.17em}}t\ge 0.$ (5)

In turn, from the ergodicity of the stationary random process $z\left(t\right),\text{\hspace{0.17em}}z\left(0\right)=0$ it follows (see, for example, ( [4] , Chapter 10, $4$)) that there is the distribution function $F\left(u\right),\text{\hspace{0.17em}}F\left(0\right)=0,\text{\hspace{0.17em}}F\left(u\right)\to 1,\text{\hspace{0.17em}}u\to \infty $ such that for any $u\ge 0$ the probability $P\left(z\left(t\right)<u\right)\equiv F\left(u\right)$ . We prove now that the following convergence by probability is true

$\frac{z\left(t\right)}{t}\to \mathrm{0,}\text{\hspace{0.17em}}t\to \infty \mathrm{.}$ (6)

Fix $\epsilon >0$ , then the following equality is true:

$P\left(\frac{z\left(t\right)}{t}>\epsilon \right)=1-F\left(\epsilon t\right)\to 0,\text{\hspace{0.17em}}t\to \infty ,$

and so the convergence by probability in the relation (6) is valid. From the convergence by probability in the relation (6), equality (5) and Corollary 1 we obtain the statement of the theorem 1.

3. Poisson Output Flows in Queuing Systems of General Form

Suppose that the ergodic stationary process $z\left(t\right)$ is Markov. Since this process characterizes the number of customers in the queuing system A, then it takes the values $\mathrm{0,1,}\cdots $ Denote ${f}_{k}=P\left(z\left(t\right)=k\right),\text{\hspace{0.17em}}k=0,1,\cdots $ and suppose that the intensities of ${\mu}_{k}$ customers leaving the system A, in the state $z\left(t\right)=k$ .

Theorem 2. The output flow in queuing system A is Poisson with the intensity $\lambda $ .

Proof. A random sequence of points on the real axis is called a Poisson flow with the intensity $\lambda $ if the following conditions ( [3] , page 12, 13), ( [5] , page 20, 35-37) are true: 1) the probability of the existence of the point of flow on the time interval $\left[t\mathrm{,}t+h\right)$ does not depend on the location of the points of the flow up to the time t (this property is called lack of follow-through and expresses the mutual independence of the flow points into disjoint periods of time); 2) the probability that in the half-interval $\left[t\mathrm{,}t+h\right)$ the point of flow appears is $\lambda \left(t\right)h+o\left(h\right)\mathrm{,}\text{\hspace{0.17em}}h\to 0$ ; 3) the probability of occurrence of two or more flow points in the half-interval $\left[t\mathrm{,}t+h\right)$ is $o\left(h\right)\mathrm{,}\text{\hspace{0.17em}}h\to 0$ .

We use the construction of [2] and prove that the output flow of customers from the queuing system A is Poisson. Indeed, since the random process $z\left(t\right)$ is discrete Markov, and the moments of withdrawal of customers from the system A are the moments of jumps down the process $z\left(t\right)$ , the output flow of customers from A satisfies the condition a), checking of the conditions b), c) is made by direct calculations. Therefore, the output flow in the system A is Poisson with the intensity $a={\displaystyle {\sum}_{k=1}^{\infty}}\text{\hspace{0.05em}}{f}_{k}{\mu}_{k}$ . Using Theorem 1, we obtain the equality $\lambda =a$ .

Remark 1. In a case the queuing system A is n-server type $M\mathrm{|}M\mathrm{|}n\mathrm{|}\infty $ , Theorem 2 is a generalization of the famous theorem of Burke [1] . The peculiarity of this design is the fact, that only ergodic properties of the Markov process $z\left(t\right)$ are important, while knowledge of stationary probabilities ${f}_{k},\text{\hspace{0.17em}}k=1,2,\cdots $ are not necessary to calculate the intensity of the output Poisson flow.

4. Queuing Systems with Failures

Consider the $M\mathrm{|}M\mathrm{\left|1\right|0}$ queuing system, in which the customers coming on a busy server, is refused. Input flow to this system is a Poisson with the intensity $\lambda $ , service times have exponential distribution with the parameter $\mu $ . This system is described by a number $z\left(t\right)$ of the customers in it at the moment t [5] . The set of states of the Markov process $z\left(t\right)$ is $\left\{\mathrm{0,1}\right\}$ . Denote transition intensity of the process $z\left(t\right)$ from state i to state j by $\alpha \left(i\mathrm{,}j\right)$ . Then the following equations are true:

$\alpha \left(0,1\right)=\lambda ,\text{\hspace{0.17em}}\alpha \left(1,0\right)=\mu ,\text{\hspace{0.17em}}\alpha \left(1,1\right)=\lambda .$

Here the transition $0\to 1$ corresponds to the arrival of the customer into the empty system. In turn, the transitions between the process states $z\left(t\right)$ , leading to the withdrawal of customers from the system have the form $1\to \mathrm{0,}\text{\hspace{0.17em}}1\to 1$ (see Figure 1).

The transition $1\to 0$ corresponds to the withdrawal of the severed customer from the system, and the $1\to 1$ corresponds to the withdrawal of the refused customer from the system.

Markov process $z\left(t\right)$ is ergodic for any parameter values $\lambda ,\mu >0$ , and its limit distribution has the form

${b}_{0}=\frac{1}{1+\rho},\text{\hspace{0.17em}}{b}_{1}=\frac{\rho}{1+\rho}.$

Theorem 2 implies the following statement.

Theorem 3. Stationary flows of the served customers and customers that have been rejected, are Poisson and have intensities ${a}_{1}={b}_{1}\mu ,\text{\hspace{0.17em}}{a}_{2}={b}_{1}\lambda $ , respectively. The stationary output flow in the system $M\mathrm{|}M\mathrm{\left|1\right|0}$ is Poisson and its intensity $a=\lambda ={a}_{1}+{a}_{2}$ .

Remark 2. The statement of Theorem 3 extends to queuing systems $M\mathrm{|}M\mathrm{|}n\mathrm{|}N$ with a limited queue, a finite number of servers, as well as a system with a finite number of flows and a fairly general discipline of their service. In the latter case it is necessary to fulfil the ergodicity condition, which requires that the graph whose nodes are the states of the system, whose edges are transitions between states, satisfies the reachable condition of any node from any other node.

Figure 1. Transition intensities of process $z\left(t\right)$ describing the number of customers in the queuing system $M\mathrm{|}M\mathrm{\left|1\right|0}$ with failures.

5. Queuing Systems in Random Environment

1) Poisson input flow with randomly varying intensity. Let the time axis $t\ge 0$ be split into half-intervals

$\left[{T}_{0}=0,{T}_{1}={T}_{0}+{\xi}_{1}\right),\left[{T}_{1},{T}_{2}={T}_{1}+{\xi}_{2}\right),\cdots $ ,

where are independent random variables with distribution

with parameter. Introduce discrete Markov chain with set of

states and irreducible transition matrix and stationary probabilities.

Consider the Markov random process, where is a Markov stationary random process that characterizes the intensity of the input flow at the time t, is the number of input flow customers that came to the system on the half-interval. Example of this process is represented in Figure 2. Here is an intensity of a transition from to, and is intensity of transition from to, and is intensity of transition from to, and is intensity of transition from to.

Points of jumps (up) of the process are the moments of customers arrivals to the system. Since the process is Markov, then for a random flow defined by jumps (up) of the component satisfies the condition a) of the Section 3. In turn, due to the stationarity of the Markov process the probability occurrences of process jump in the half-interval equals, where. Thus, it is proved that the input Poisson flow with a randomly varying intensity coincides by the distribution with the Poisson flow having an average intensity.

This circumstance allows us to study the output flows in queuing systems and networks with Poisson input flow having a randomly changing intensity, assuming that the random service intensities in the nodes of the queuing system or network and the random input flow are independent.

2) Queing system in random environment. Consider the system with the service intensity and the Poisson input

Figure 2. Transition intensities of process describing the number of input flow customers that came to the system on the half-interval.

flow with the intensity, that change randomly according to the following rules. Let on each half-interval the input flow to the system be Poisson with the intensity, and the intensity of service is. It is easy to check that under these conditions, the Markov random process is ergodic. Then from Theorem 2 it is easy to establish that the total output flow from a given system is Poisson with the intensity. These constructions allow to consider manifold queuing models with different input flows and distributions of customers service times.

Partially supported by Russian Fund of Basic Researches, project 17-07-00177.

Cite this paper

Tsitsiashvili, G. (2018) Ergodicity and Invariance of Flows in Queuing Systems.*Journal of Applied Mathematics and Physics*, **6**, 1454-1459. doi: 10.4236/jamp.2018.67122.

Tsitsiashvili, G. (2018) Ergodicity and Invariance of Flows in Queuing Systems.

References

[1] Burke, P.J. (1956) The Output of a Queuing System. Operations Research, 4, 699-704.

https://doi.org/10.1287/opre.4.6.699

[2] Tsitsiashvili, G.Sh. and Osipova M.A. (2018) Generalization and Extension of Burke Theorem. Reliability: Theory and Applications, 13, 59-62.

[3] Khinchin, A.Ya. (1963) Works on the Mathematical Queuing Theory. Physmatlit, Moscow. (In Russian)

[4] Borovkov, A.A. (1972) Course of Probability Theory. Nauka, Moscow. (In Russian)

[5] Ivchenko, G.I., Kashtanov, V.A. and Kovalenko, I.N. (1982) Queuing Theory. Vishaya Shkola, Moscow. (In Russian)

[1] Burke, P.J. (1956) The Output of a Queuing System. Operations Research, 4, 699-704.

https://doi.org/10.1287/opre.4.6.699

[2] Tsitsiashvili, G.Sh. and Osipova M.A. (2018) Generalization and Extension of Burke Theorem. Reliability: Theory and Applications, 13, 59-62.

[3] Khinchin, A.Ya. (1963) Works on the Mathematical Queuing Theory. Physmatlit, Moscow. (In Russian)

[4] Borovkov, A.A. (1972) Course of Probability Theory. Nauka, Moscow. (In Russian)

[5] Ivchenko, G.I., Kashtanov, V.A. and Kovalenko, I.N. (1982) Queuing Theory. Vishaya Shkola, Moscow. (In Russian)