**Citation:** Tsitsiashvili, G. Study of Synergistic Effects in Complex Stochastic Systems. *Mathematics* **2021**, *9*, 1396. https://doi.org/10.3390/ math9121396

Academic Editors: Mikhail Posypkin, Andrey Gorshenin, Vladimir Titarev and Jaan Janno

Received: 23 March 2021 Accepted: 13 June 2021 Published: 16 June 2021

**Publisher's Note:** MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

**Copyright:** © 2021 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https:// creativecommons.org/licenses/by/ 4.0/).

**1. Introduction**

Questions of composition and decomposition in multi-element stochastic systems are relevant for solving a number of problems. These include paralleling of algorithms and programs, modeling of supercomputers, the Internet, computer networks, mobile telephone communication systems, development of software packages for modeling catastrophic events in complex systems, design and improvement of technological and economic processes, and so on.

The term "synergy" (the result of the interaction of many elements of the system) originated in statistical physics, but recently it has been used by specialists from other fields: economics, biology, engineering, etc. Furthermore, research in these areas no longer leads to microscopic, but to phenomenological considerations. Here are some examples, taken from science history and devoting the detection of synergistic effects in complex systems, which have been obtained by famous researchers in their objective areas, using observation and mathematical intuition.

The economist A. Smith investigated the transition from shop production to manufacturing on the example of the production of safety pins. In the workshop method, the pin was made entirely by one master, performing all the operations sequentially. In manufacturing, each operation was performed by a separate master, which significantly increased labor productivity.

The physiologist I.P. Pavlov discovered the conditioned reflex by detecting feedback in the nervous system of the body. Stochastic feedback theory was developed by N. Wiener. A detailed study of the conditioned reflex led to the creation by P.K. Anokhin of the concept of a functional system that is urgently formed in the body when it is necessary to achieve the desired result and quickly disintegrates after it is achieved. N. Wiener and P.K. Anokhin collaborated in the development of this scientific direction, actively discussing the possibilities of mathematical methods in this area.

The physicist E. Rutherford discovered the atomic nucleus and proposed to P.L. Kapitsa to create an installation for the effect of a strong magnetic field on the atomic

nucleus. Long-running installations were melted under the influence of a strong magnetic field. P.L. Kapitsa constructed an installation that creates a strong magnetic field for a short time, which turned out to be long enough for the processes occurring in the atomic nucleus.

Synergistic effects are a source of explicit dependencies between the characteristics of the system against the background of sufficiently large random perturbations. To study them, it was necessary to develop special techniques based on the structural analysis of multi-element stochastic models in combination with majorant asymptotic estimates of their performance indicators. This, in turn, required new techniques for working with statistical data, as well as skills in using the limit theorems of probability theory and the accompanying asymptotic expansions and estimates.

According to the author, many works on the analysis of complex multi-element systems require at the initial stage the construction of simpler models that allow you to determine the main performance indicators and the main parameters with which you can influence these indicators. For this purpose, it is very convenient to build procedures for comparing systems with different (alternative) structures to study their effectiveness with a large number of elements, with a large load, etc. For this purpose, schemes and/or modes of complex systems, computational algorithms, etc. can be used as objects of comparison. At the same time, at the initial stage of the study, a reasonable proportion should be observed between the accuracy of the calculations, which may be relatively small; the complexity of the calculations, which also should not be large; and the significance of the obtained results, which should be sufficiently large. Comparing systems with an alternative structures allows us to take these requirements into account, as with an increase in the number of elements, the differences between systems with an alternative structures are quite large.

The first author's works, devoted to the study of synergistic effects, are analytical generalizations of the results of numerical and field experiments conducted by his colleagues in the modeling of telecommunications systems, container terminals, etc. In this connection, it should be remembered that in hydrodynamics, nonlinear soliton waves were also first discovered in the course of numerical experiments, and then their analytical theory was constructed. The use of computational experiments allows to obtain more accurate estimates of the synergistic effects. This can be used when working with models used in the programs "digital economy", "smart city", when modeling remote modes of operation that have become popular, on-line conferences, when using smart phones, etc. Currently, new information technologies are rapidly entering our life and their research helps us to adapt to them and to adapt these technologies themselves to the needs of potential users (for example, the use of smart phones by aged users). Nevertheless, analytical research helps to determine the direction of such research and to carry them out. In a sense, this avoids very complex structural optimization problems, a significant part of which are NP problems. Along with this, it becomes possible to use observations of complex systems, which also contributes to the study of synergistic effects in them.

In this paper, the synergistic effect is understood as a significant change in the performance indicators of a complex system when its structure changes, i.e., the connections between its elements. The complexity issues play an important role in modern systems analysis [1,2]. To reduce complexity, various techniques are used, among which the structural transformation of the system plays an important role [3,4]. This methodological technique is closely linked to the issues of the stability of a complex system [5].

Such a statement of the problem can be the comparing the reliability of separate and block reserving elements of a two-pole with unreliable edges [6]. This result is a classic in the mathematical theory of reliability and its refinement or amplification can be significant in itself. Note that the study of the reliability of two poles is widely used in various theoretical and applied studies (see, for example, in [7–10], etc. However, such a comparative analysis made in the monograph [6] of Barlow and Proshan did not develop in subsequent works, while the synergistic effects identified in this paper were very significant.

The peculiarity of this task is the use of probabilistic models, which, at first glance, complicate the task. This transition requires the selection of a new performance indicator the required amount of reserve, which reflects the content of the reservation procedure and the novelty of the proposed approach. On the other hand, it is also necessary to construct sufficiently weak (logarithmic) dependencies of the so-introduced indicator on a number of the scheme elements. When selecting a new reserve efficiency indicator, its analogy with probabilistic metrics [11] is used. Therefore, the results obtained in this section are new, original, and significant.

Another problem considered in this paper and connected with synergistic effects appeared at the ITMM 2018 and ITMM 2020 conferences, when discussing the multiserver model of the RQ queuing system [12–14]. The Conference ITMM 2018 was held in conjunction with 12th International Workshop on Retrial Queues (RQ) and Related Topics with a wide representation of queuing theory researchers from Russia, India, Bulgaria, the Netherlands, and other countries. A good source of recent works on this topic is a collection of articles on RQ systems [15].

The RQ queuing system is a system in which a customer received in the presence of busy servers is not rejected, but is sent to the so-called orbit, from where it is extracted in accordance with some protocol for queuing, when one of the servers is released. A.N. Dudin remarked that it is most often assumed Poisson input flow to such a system. However, this requirement is not met because there is a dependence and even a long range dependence between the random variables, characterizing numbers of arrived customers in disjoint time intervals. Moreover, despite the large number of analytical results in which the distributions in RQ systems are calculated in formula form, their use for numerical calculations is difficult due to the high complexity of such calculations, especially for multi-server RQ systems.

The novelty of the proposed approach is that instead of a stationary distribution of the process describing a multi-server RQ system, the probability of customers appearing in the orbit of this system for a fixed period of time is investigated and the convergence of this indicator to zero is established when the number of channels proportional to the intensity of the input flow tends to infinity. Secondly, with an increase in the number of servers, even in a system with a Poisson input flow and exponentially distributed service times, the computational complexity of the problem of calculating the limit distribution in an RQ system increases quite strongly.

Thus, a new problem arises for calculating the RQ queuing system with a large number of servers and a non-Poisson input flow. Using asymptotic theorems for multichannel queuing systems, it is possible, on the contrary, to simplify the problem of analyzing RQ systems. For this purpose, it is convenient to use limit theorems based on topological concepts of convergence in the space of random processes defined on a finite time interval [16]. The significance of this approach lies in the broad scope of its application and in the ability to circumvent the computational complexity of the problem by reducing it to the limit theorems of probability theory.

A continuation of the study of multi-server queuing systems in this paper is the analysis of a system with failures. This system arises when modeling modern data transmission networks (of fifth generation), formulated by leading Russian specialists in the mathematical theory of communication [17]. This task is quite important and leading Russian specialists in modeling of transmission networks Samouylov K.E. and Gaidamaka Yu.V. even organized a seminar with the author's participation to find alternative approaches to this problem solution with publishing of obtained results [18]. The solution to this problem is based on the recently installed a synergistic effect in multi-server queuing system with failures, when the stationary probability of failure tends to zero as the number of servers and proportionally the input flow intensity tend to infinity. Moreover, the obtained asymptotic results were quite accurate.

This study is based on the classical Erlangian model of loss multi-server system (see, for example, in [19,20]). Asymptotic behaviors of the blocking probability and parameters

of the Equivalent Random Theory method was analyzed in [21] for the case when both the number of servers and the input flow intensity tend to infinity.

However, the inclusion in this model of the assumption that load factor equals one, the intensity of the input flow is proportional to the number of servers *n*, and the tendency of *n* to infinity allowed us to establish that the probability of failure tends to zero also. The exact asymptotic rate of this convergence is established. Moreover, when the load factor is less than one, it is possible to construct an upper estimate of the rate of convergence to zero in the form of a geometric progression. Therefore, the synergistic effect found in this paper is very strong and so can be used in the design of data transmission systems of the fifth generation.

The features of probabilistic models of complex systems discovered in this way can also be used in the estimation of their parameters. In particular, in the deterministic model of logistic growth [22] (which is very important and classical in mathematical biology), the problem of estimating the growth parameter from inaccurate observations arises and attracts specialists again and again. The solution of this problem by the method of least squares leads to quite large errors. In this paper, the unknown growth parameter is expressed in terms of the trajectory averages of the deterministic sequence of the model. In turn, the trajectory averages are estimated from observations over a sufficiently long period of time, which leads to the leveling of observation errors. These estimates are based on the use of probabilistic metrics developed in [11] and are new.

Thus, the solution of the above problems of system analysis required a combination of probabilistic and deterministic methods of system analysis, among which the methods of studying the synergistic effects arising from the structural restructuring of a complex system play a decisive role. The benefit of received results is to establish sufficiently strong dependencies of performance indicators on changes in the system structure. This approach opens up new opportunities in solving problems of structural optimization of stochastic systems: queuing, reliability, etc.

#### **2. Separate Redundancy in a Two-Pole System**

Consider *m* sequentially connected and independently operating elements with a failure-free probability of *p*, 0 < *p* < 1. The probability of failure-free operation of such a chain is *pm*. Let us focus on two alternative ways to reserve this network. In the first method, *n* independently functioning duplicates are connected in parallel (see Figure 1).

**Figure 1.** *n*-multiple block redundancy (**top**), split redundancy (**bottom**) of a chain of length *m*.

Reliability of the network obtained in this way is *<sup>H</sup>n*(*m*) = <sup>1</sup> <sup>−</sup> (<sup>1</sup> <sup>−</sup> *<sup>p</sup>m*)*n*. In the second method, each element of the original chain is *n*-multiple reserved separately (see Figure 1). Reliability of the newly formed network *Hn*(*m*)=(<sup>1</sup> <sup>−</sup> *<sup>q</sup>n*)*m*, *<sup>q</sup>* <sup>=</sup> <sup>1</sup> <sup>−</sup> *<sup>p</sup>*.

From the results of the monograph [6], it follows that *Hn*(*m*) <sup>≥</sup> *<sup>H</sup>n*(*m*) (this inequality is valid for any bipolar). However, this inequality gives only a qualitative idea of the possibilities of separate reservation. To give a quantitative assessment, it is convenient to move from the reliability function to the required amount of reserve.

For *<sup>δ</sup>* <sup>&</sup>gt; 0, denote *<sup>n</sup>*∗(*m*, *<sup>δ</sup>*) = min(*<sup>n</sup>* : *<sup>H</sup>n*(*m*) <sup>≥</sup> <sup>1</sup> <sup>−</sup> *<sup>δ</sup>*), *<sup>n</sup>*∗(*m*, *<sup>δ</sup>*) = min(*<sup>n</sup>* : *Hn*(*m*) <sup>≥</sup> 1 − *δ*) the required volume of reserve, in which the reliability exceeds 1 − *δ*. To calculate the reliability of general type two-pole, it is necessary to solve an NP-complex problem. However, to compare the different ways of reserving a chain of the length *m*, it is necessary only to solve a few simple inequalities. Moreover, the results of this comparison are very contrasting and the most interesting consideration of a separate reserve may be applied to general type two-pole also. Let us denote [*a*] the integer part of the real number *a*.

**Proposition 1.** *The following inequalities are met:*

$$n^\*(m,\delta) \ge \left[\frac{1-\delta}{p^m}\right] + 1,\ n\_\*(m,\delta) \le \left[\frac{\ln(\delta/m)}{\ln q}\right] + 1.\tag{1}$$

**Proof.** Indeed, for all *a*, 0 < *a* < 1, the inequality holds

$$(1 - a)^m \ge 1 - ma, \quad m = 1, 2, \dots, \Rightarrow \; H^n(m) = 1 - (1 - p^m)^n \le np^m, \Rightarrow$$

$$m^\*(m, \delta) \ge \min(n : np^m \ge 1 - \delta) = \min\left(n : n \ge \frac{1 - \delta}{p^m}\right) \ge \left[\frac{1 - \delta}{p^m}\right] + 1,$$

so the first relation in Formula (1) takes place. In turn,

$$H\_n(m, \delta) \ge (1 - q^n)^m \ge 1 - m q^n \implies n\_\*(m, \delta) \le \min(n : m q^n \le \delta) \implies$$

$$n\_\*(m, \delta) \le \min(n : \ln m + n \ln q \le \ln \delta) \le \left[\frac{\ln(\delta/m)}{\ln q}\right] + 1.$$

Therefore, the second relation in Formula (1) is valid.

Table 1 demonstrates how much *n*∗(*m*, *δ*) is greater than *n*∗(*m*, *δ*).


**Table 1.** Meanings of *n*∗(*m*, *δ*), *n*∗(*m*, *δ*) for *p* = 0, 7, *δ* = 0, 1.

A comparison of these relations shows that for a large chain length of *m*, the splitreservation scheme provides special advantages, as the lower bound, which grows as a geometric progression, is replaced by the upper logarithmic bound. Note that the upper estimate of the required reserve in the scheme of separate reservation of a sequential chain is logarithmic in *m* and can be easily extended to the general case.

Indeed, consider a two-pole consisting of *m* independently operating edges with probabilities of operation *p*1, ... , *pm* ≥ 1 − *q*, 0 < *q* < 1. Let us construct a two-pole in which each edge of the original two-pole is a reserve of *n* identical elements and denote *Hn*(*p*1, ... , *pm*) the probability of the existence of a working path from the initial to the final vertex in this two-pole.

**Proposition 2.** *For the value n*∗(*p*1,..., *pm*, *δ*)*, the relation is valid*

$$n\_\*(p\_{1\prime}, \dots, p\_{m\prime}\delta) \le \left[\frac{\ln(\delta/m)}{\ln q}\right] + 1.$$

**Proof.** The proof of this statement is based on the inequality *Hn*(*p*1, ... , *pn*) ≥ (1 − (1 − *<sup>p</sup>*1)*n*) · ... · (<sup>1</sup> <sup>−</sup> (<sup>1</sup> <sup>−</sup> *pm*)*n*) <sup>≥</sup> (<sup>1</sup> <sup>−</sup> *<sup>q</sup>n*)*<sup>m</sup>* <sup>≥</sup> <sup>1</sup> <sup>−</sup> *mqn*. This inequality follows from the fact that the reliability of an arbitrary two-pole with *m* independently functioning elements is not less than the reliability of a chain of m elements connected in series. Therefore, the second inequality in the formula (1) is true also.

For an arbitrary two-pole, a logarithmic by *m* upper estimate of the value of the required reserve in the separate reservation scheme is performed. Note that this result is obtained using trivial inequalities and does not require calculating the reliability of *Hn*(*p*1,..., *pm*), which in general is an NP-problem.

Indeed, if *α*1, ... , *α<sup>m</sup>* are independent boolean random variables which describe states of two-pole elements and boolean function *A*(*α*1, ... , *αm*) describes a workability of twopole dependently on states of its elements then its reliability

$$H\_A(p\_1, \ldots, p\_m) = \sum\_{\substack{a\_1, \ldots, a\_m = 0}}^1 A(a\_1, \ldots, a\_m) \prod\_{j=1}^m p\_j^{a\_j}, \text{ with } p\_j^1 = p\_j, \ p\_j^0 = 1 - p\_j, \ j = 1, \ldots, m.$$

Calculation of the reliability *H*(*p*1, ... , *pm*) formally requires performing of 2*<sup>m</sup>* arithmetical operations.

Thus, a convenient choice of the reserve efficiency indicator in the form of the required reserve volume solves two problems. It allows us to obtain a strong (logarithmic) dependence of the chosen efficiency indicator on the number of edges of the two-pole *m* and makes it possible to abandon the solution of the NP-problem of calculating the reliability of the two-pole.

#### **3. RQ-Queuing Systems with a Large Number of Servers**

Consider an RQ-system, i.e., a queuing system, in which, if there is a free server, the customer that has come to the system immediately begins to be served on it. If there are no free servers, then the customer is sent to the orbit, from where it can return to the newly released server in accordance with some protocol [12–14]. A good source for RQ systems in recent years has been Conference ITMM 2018 in Tomsk, which was held in conjunction with 12th International Workshop on Retrial Queues and Related Topics (WRQ 2018).

To solve this problem, we propose to use the theorem on the asymptotic behaviour of an n-server queuing system for *n* → ∞. In this theorem, we prove that at *T* > 0 for *n* → ∞, the probability *Pn*(*T*) that on the segment [0, *T*] in the system there will be customers going into orbit tends to zero. Already in this result, the transition from the limit distribution to the above probability is made. Moreover, this characteristic becomes a new indicator of efficiency, which is convenient to use when analyzing a multichannel RQ queuing system.

Consider the series scheme in which the characteristics of *n*-server queuing systems are defined by the parameter *n* → ∞, which characterizes an intensity of input flow tending to infinity. Denote *en*(*t*) a number of input flow customers arriving before the moment *t*, *en*(0) = 0. Assume that *qn*(*t*) is a number of busy servers in this system at the moment *t*, *qn*(0) = 0, *τ<sup>j</sup>* is the service time of *j* input flow customer and *τj*, *j* ≥ 1, is a sequence of independent and identically distributed random variables (s.i.i.d.r.v.'s) with the distribution function (d.f.) *F*(*t*) (*F* = 1 − *F*), which has continuous and bounded by ¯ *f* > 0 density *f*(*t*). All results of this section are based on ([16], Chapter II, § 1, Theorem 1):

**Theorem 1.** *Assume that the following conditions are true.*


$$\frac{B(n)}{A(n)} \to B \ge 0, \ \frac{\sqrt{n}}{A(n)} \to K \ge 0, \ \frac{n}{A(n)} \to \infty.$$

*so that* max(*B*, *K*) = 1*).*


Here, the concept of C-convergence used in Theorem 1 is defined as follows. Denote by F<sup>1</sup> the space of deterministic functions on the segment [0, *T*] with uniform metric *ρ*. Designate by F the set of bounded functionals *f* defined on F<sup>1</sup> and continuous in the metric *ρ* : if *z* = *z*(*t*), *z*<sup>1</sup> = *z*1(*t*), *z*<sup>2</sup> = *z*2(*t*), ... ∈ F<sup>1</sup> and *ρ*(*z*, *zn*) → 0, *n* → ∞, then *f*(*zn*) → *f*(*z*), *n* → ∞. Say that the sequence of random processes *zn* = *zn*(*t*), *n* ≥ 1, C-converges to the random process *z* = *z*(*t*) if for any functional *f* ∈ F we have that *E f*(*zn*) → *E f*(*z*), *n* → ∞.

**Deterministic input flow of customer groups.** Let at times 1, 2, ... in *n*-server RQqueuing system come groups of customers of the size of *η*<sup>1</sup> ≥ 0, *η*<sup>2</sup> ≥ 0, ... , where *η*1, *η*2, ... – i.i.d.r.v.'s with integer values, *Eη*<sup>1</sup> = *a*, *Var η*<sup>1</sup> < ∞. Define the input flow by the equality [*nt*+*ψ*]

*en*(*t*) = ∑ *k*=1 *ηk*, *t* ≥ 0, where *ψ* – independent of *ηk*, *k* ≥ 1, *τj*, *j* ≥ 1, a random variable

with a uniform distribution on the segment [0, 1] ([*d*] is the integer part of the real number *d*). Here and in two next models random variable *ψ* has uniform distribution to ensure the proportionality *t* of the mathematical expectation *Een*(*t*).

**Theorem 2.** *Suppose that, for some D* > 0, *almost certainly η*<sup>1</sup> < *D and the inequality aEτ*<sup>1</sup> < 1 *is true. Then for any T* > 0 *the relation Pn*(*T*) → 0, *n* → ∞, *is valid.*

**Proof.** In [23] it is proved that under the conditions of this theorem,

$$P\left(\sup\_{0\le t\le T} q\_n(t) \ge n\right) \to 0,\ n \to \infty. \tag{2}$$

Connecting this relation with the inequality *Pn*(*T*) ≤ *P* sup 0≤*t*≤*T qn*(*t*) ≥ *n* , *n* ≥ 1, one

obtains the proof of the theorem.

**Alternating input flow.** Consider a *n*-server RQ-queuing system, assuming *n* = *n*(*N*) → ∞, *N* → ∞. Let us define the input flow to this system using the following construction. Following the works in [24,25], we define a continuous random flow defined by ON and OFF periods. Let a sequence of i.i.d.r.v's *X*<sup>0</sup> ≥ 0, *X*<sup>1</sup> ≥ 0, *X*<sup>2</sup> ≥ 0, ... consists of lengths of ON-periods, the sequence of i.i.d.r.v.'s *Y*<sup>0</sup> ≥ 0, *Y*<sup>1</sup> ≥ 0, *Y*<sup>2</sup> ≥ 0, ... consists of the lengths of OFF-periods and these random sequences are independent. Denote *F*1(*t*) = *P*(*X*<sup>1</sup> < *t*), *F*2(*t*) = *P*(*Y*<sup>1</sup> < *t*), *t* ≥ 0, and suppose that

$$
\overline{F}\_1(t) = t^{-a\_1} L\_1(t), \\
\overline{F}\_2(t) = t^{-a\_2} L\_2(t), \\
1 < a\_1 < a\_2 < 2,
$$

where the function *L*1(*t*) → *l*<sup>1</sup> > 0, *t* → ∞, and *L*2(*t*) is a slowly varying function. Let *b*(*t*) is the inverse of the function 1/*F*1(*t*) : *b*(1/*F*1(*t*)) = *t*.

We introduce independent r.v.'s *B*, *X*, *Y*, which are independent of *Xn*, *Yn*, *n* ≥ 1, and *Y*<sup>0</sup> with distributions

$$P(B=1) = \frac{\mu\_1}{\mu},\ P(B=0) = \frac{\mu\_2}{\mu},\ \mu = \mu\_1 + \mu\_2,\ \mu\_1 = EX\_1,\ \mu\_2 = EY\_1.$$

$$P(X \le x) = \frac{1}{\mu\_1} \int\_0^x \mathbb{F}\_1(s)ds,\ P(Y \le x) = \frac{1}{\mu\_2} \int\_0^x \mathbb{F}\_2(s)ds.$$

Then, a random sequence

$$T\_0 = B(X + \mathcal{Y}\_0) + (1 - B)\mathcal{Y},\ T\_n = T\_0 + \sum\_{i=1}^n (X\_i + \mathcal{Y}\_i),\ n \ge 1,$$

generates an ON–OFF process

$$W(t) = BI\_{[0,X)}(t) + \sum\_{n=0}^{\infty} I\_{[T\_n, T\_n + \mathcal{X}\_{n+1})}(t), \ t \ge 0$$

(here *IA*(*t*) is the indicator function of a random event *t* ∈ *A*). The random process *W*(*t*) is binary: *W*(*t*) = 1, if *t* is contained in an ON-period, *W*(*t*) = 0, if *t* is contained in the OFF-period and stationary, and *EW*(*t*) = *μ*1/*μ* = *α*.

Denote *<sup>A</sup>*(*t*) = *<sup>t</sup>* 0 *W*(*s*)*ds*, then *EA*(*t*) = *αt*, *t* ≥ 0. Let *n* = *n*(*N*) = *NM*(*N*), *M* = *M*(*N*)=[*Nγ*], *γ* > 0, and random functions *Am*(*t*), *m* = 1, ..., *M*, are independent copies of a random function *<sup>A</sup>*(*t*). We introduce the function *en*(*t*) = \$ *<sup>M</sup>* ∑ *m*=1 *Am*(*Nt*) + *ψ* % , specifying the alternating input flow.

**Theorem 3.** *If γ* > *α*<sup>1</sup> − 1 *and αEτ<sup>j</sup>* < 1, *then for any T* > 0 *the relation Pn*(*T*) → 0, *n* → ∞, *is true.*

The proof of Theorem 3 repeats the proof of Theorem 2 verbatim.

**Erlangian input flow.** Let *En*(*t*) a Poisson flow of customers with intensity *nα*. Define the input flow to the *n*-server system described above by the equality

$$e\_n(t) = \left[\frac{E\_n(t)}{r} + \psi\right], \ t \ge 0,$$

where *ψ* is a random variable independent of *ηk*, *k* ≥ 1, *τj*, *j* ≥ 1, with a uniform distribution on the segment [0, 1], and the fixed *r* takes natural values. It is obvious that for any fixed *ψ*, 0 ≤ *ψ* ≤ 1, the moments of single jumps of the process *en*(*t*) form an Erlangian flow. Here, the Erlangian flow is obtained from *En*(*t*) by allocation of moments with numbers that are multiples of *r*.

**Theorem 4.** *If αEτ<sup>j</sup>* < 1, *then for any T* > 0 *the relation Pn*(*T*) → 0, *n* → ∞, *holds.*

**Proof.** In [26] it is proved that Formula (2) is valid under the conditions of the theorem. Connecting it with inequality *Pn*(*T*) ≤ *P* sup 0≤*t*≤*T qn*(*t*) ≥ *n* , one obtains the proof of the theorem.

The choice of the probability *Pn*(*T*) as an efficiency indicator allows us to apply the known theorems to the analysis of a multi server RQ-system with a fairly general protocol for the transfer of customers from orbit to the vacated server almost without additional consideration.
