<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>On Stochastic and Failure Rate Orderings in Systems with Two-Component Service Time Mixture ?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Irina Peshkova</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Applied Mathematical Research of the Karelian research Centre of RAS</institution>
          ,
          <addr-line>Pushkinskaya str. 11, Petrozavodsk, 185910</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Moscow Center for Fundamental and Applied Mathematics, Moscow State University</institution>
          ,
          <addr-line>Moscow 119991</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Petrozavodsk State University</institution>
          ,
          <addr-line>Lenin str. 33, Petrozavodsk, 185910</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>and Evsey Morozov</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we discuss stochastic and failure rate comparisons of two-component mixture distributions and the properties of conditional excess distribution of two-component mixture. We consider the uniform distance between conditional excess mixture distribution and it's parent distribution. Then we apply the failure rate comparison and stochastic ordering techniques to construct the upper and lower bounds for the steady-state performance indexes of a multiserver model. This theoretical analysis is further illustrated by the comparison of conditional excesses of service times, the waiting times and queue sizes in the queueing systems with mixed service time distribution.</p>
      </abstract>
      <kwd-group>
        <kwd>Conditional Excess Distribution</kwd>
        <kwd>Failure Rate Comparison</kwd>
        <kwd>Multiserver System</kwd>
        <kwd>Performance Analysis</kwd>
        <kwd>Finite Mixture Distribution</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The analysis of the behaviour of mixtures of random variables has a long history,
see for instance, [4,6]. The mixtures arise in many applications, for example in
biology, when population consists of several subpopulations referred to a di erent
components of mixture. In the communication networks they can be used to
model queueing systems with several classes of customers.</p>
      <p>
        This paper is dedicated to the properties of conditional excess distribution
of two-component mixtures. The excesses over given and increasing thresholds
play a fundamental role in many applications when we study the asymptotic
behaviour of the performance indexes describing queueing systems. For instance,
the conditional distribution Fu (de ned by (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) is known as the excess{life or
residual lifetime distribution function in reliability theory and also in
medical statistics [7]. In the insurance context, Fu is usually referred to as the
excess{of{loss [7]. In the analysis of communications systems the conditional excess
? The research is supported by Russian Foundation for Basic Research, projects No.
      </p>
      <p>19-57-45022, 19-07-00303, 18-07-00156, 18-07-00147.
distribution is often used to estimate the probability that a performance measure
(for instance, the waiting time) exceeds a high threshold [12].</p>
      <p>In previous research, we developed the comparison of the performance
measures (rather than excess) in the systems with di erent service time
distribution and with (two-component) mixture of given distributions. In particular,
we have considered the following two-component distributions:
Hyperexponential distribution, Pareto distribution, Exponential-Pareto mixture distribution.
The corresponding stationary measures in such systems have been compared
with the corresponding measures in the systems with (one-component)
Exponential distribution and Pareto distribution. As a result, some useful bounds for
the performance measures have been obtained, see [14,13].</p>
      <p>The main new contribution of this research is as follows. Using the stochastic
and failure rate ordering, monotonicity properties (with respect to the
interarrival time and service times [1,17]) we can compare the conditional excesses
of service times and performance indexes in queueing system with the
twocomponent mixture service time and the corresponding measures in the system
in which service time distribution coincides with the distribution of a mixture
component.</p>
      <p>The structure of the paper is as follows. In Section 2, we de ne nite
twocomponent mixture distributions and consider properties of stochastic and
failure rate comparison of mixture components. In Section 3, we introduce the
conditional excess distribution Fu over the threshold u and discuss some its
properties. In Section 4, we consider the uniform distance between the conditional
excess mixture distribution and it's parent distribution which is illustrated by
two examples: for the Hyperexponential distribution and two-component Pareto
distribution. These results are further applied in Section 5 to the conditional
excess distributions of service times and distributions of queue size and waiting
time in the multiserver systems.
2</p>
      <p>Stochastic and Failure Rate Ordering
In this section we give some basic de nitions which are used below. Let X be a
non-negative random variable with distribution function F and density f . For
each x such that the tail distribution F (x) = P(X &gt; x) &gt; 0, we de ne the failure
rate function as
f (x)</p>
      <p>F (x)
rF (x) =
;
x
0:</p>
      <p>An absolutely continuous distribution F with density f is said to have an
increasing failure rate (IFR) if rf (x) is an increasing function. Analogously, the
distribution F (with density f ) has decreasing failure rate (DFR) if the function
rF (x) is decreasing.</p>
      <p>The distribution function F is said to be new better than used (NBU) if for
x; u 0</p>
      <p>F (x + u)</p>
      <p>F (x)F (u):
We say that df F is new worse than used (NWU) if for x; u</p>
      <p>One can show that the IFR (DFR) property of a distribution function implies
the NBU (NWU) property of the corresponding failure rate function, see [4].</p>
      <p>Consider two non-negative random variables X and Y with distribution
functions F and G, respectively. We say that X is less than Y stochastically, and
denote it as X Y , if
We say that X is less than Y in failure rate, and denote it X</p>
      <p>Y , if
r
F (x)</p>
      <p>G(x); x</p>
      <p>0:
rF (x)
rG(x); for all x
0:
It is well-known [15] that the failure rate ordering implies stochastic ordering,
that is,</p>
      <p>X
r</p>
      <p>Y ) X
st</p>
      <p>Y :</p>
    </sec>
    <sec id="sec-2">
      <title>Distribution function</title>
      <p>where a constant p 2 (0; 1), is said to be a two-component mixture of
distributions F and G. The constant p is called mixture parameter. Suppose that
the random variables X; Y with distribution functions F; G, respectively, are
independent, and let I be indicator function independent of X; Y , taking value
1 with probability p (value 0 with probability 1 p). Then it is said that the
variable</p>
      <p>Z = I X + (1</p>
      <p>
        I) Y
has two-component mixture distribution (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ).
      </p>
      <p>It is proved in [13] that if the components X; Y are ordered stochastically
(in failure rate) then the mixture Z has the following natural stochastic (failure
rate) bounds:</p>
      <p>X
X
st
r</p>
      <p>Y ) X
Y ) X
st
r</p>
      <p>Z
Z
st
r</p>
      <p>
        Y ;
Y:
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
3
      </p>
      <p>Conditional Excess Distribution of Two-Component
Mixture
Let X be a non-negative random variable with distribution function F and right
endpoint xr, de ned as
xr = supfx
0 : F (x) &lt; 1g
1:
F u(x) = P(X
u
xjX &gt; u) =</p>
      <p>F (x + u)</p>
      <p>F (u)
; u &lt; xr; x
plays an important role in the reliability theory and called the residual lifetime. It
represents the survival function of a unit of age u, i.e., the conditional probability
that a unit of age u will survive for an additional x units of time [2]. The failure
rate of Fu given by
for each u</p>
      <p>IXu + (1</p>
      <p>I)Yu
r</p>
      <p>Yu:
f (x + u)</p>
      <p>F (x + u)
rFu (x) =</p>
      <p>
        = rF (u + x):
is called the conditional excess distribution of X over the threshold u [3]. The
tail of conditional excess distribution, de ned as
Now the statement of the theorem follows from (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ).
      </p>
      <p>F (x + u)
G(x + u)</p>
      <p>F (x)F (u)
G(x)G(u)</p>
      <p>F (u)
G(u)</p>
      <p>;
F u(x) =</p>
      <p>F (x + u)</p>
      <p>F (u)</p>
      <p>G(x + u)</p>
      <p>
        G(u)
= Gu(x):
and failure rate
where
It can be veri ed that, under condition
We note that if X or Y or both have an exponential distribution and X
st
relations (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) hold. As an example we consider the Exponential-Pareto mixture
distribution with tail distribution function
      </p>
    </sec>
    <sec id="sec-3">
      <title>Y , then</title>
      <p>H(x) = pe
x + (1
p)
; ; ; x0 &gt; 0; x
0
rH (x) =
p b(x) + (1 p) =(x0 + x)
p b(x) + (1 p)</p>
      <p>;
b(x) = e
x
1 +
; x</p>
      <p>
        0:
the relations (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) hold for this distribution.
      </p>
      <p>It is known that the mixture of two DFR distributions is DFR and F is DFR
if and only if Fu(x) is increasing in u for all x 0 [7]. Then we immediately
obtain the following statement.</p>
      <p>Theorem 3. Let F and G be DFR distributions. Then for all u such that
H(u) = pF (x) + (1
p)G(x) &gt; 0;
the tail</p>
      <p>
        We note that mixtures of IFR distributions need not be IFR and can even
be DFR [7]. An important source of DFR mixtures is the mixture of exponential
distributions, which arises in the real applications. For instance, consider the
Hyoerexponential distribution with parameters 1; 2; 1 6= 2 and tail
H(x) = pe
1x + (1
p)e
2x; 1; 2; x
0:
(
        <xref ref-type="bibr" rid="ref9">9</xref>
        )
Then the tail of conditional excess distribution Hu is increasing and, for each x,
satis es
      </p>
      <p>H(x + u) ! e min( 1; 2) x</p>
      <p>H(u)
as u ! 1:</p>
      <p>Uniform Distance Between Conditional Excess Mixture
and Parent Distributions
First we de ne the uniform distance between two distributions F and G, as [5]
(F; G) = suxp jF (x)</p>
      <p>
        G(x)j;
which is used in the sensitivity analysis measures. The uniform distance between
conditional excess mixture distribution tail (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) and it's parent distribution tail
F u is
(Hu; F u) = suxp jHu(x)
      </p>
      <p>F u(x)j
= (1
p) sup
x</p>
      <p>G(x + u)F (u) G(u)F (x + u)</p>
      <p>F (u)(pF (u) + (1 p)G(u))</p>
      <p>
        :
1
2
If the densities for distribution functions F and G exist, and there exists x that
delivers the supremum in equation (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ), then x satis es the equality
rG(x + u)
rF (x + u)
=
      </p>
      <p>
        F u(x )
Gu(x )
For example, for Hyperexponential distribution (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) solution of equation (
        <xref ref-type="bibr" rid="ref11">11</xref>
        ) has
the following form
      </p>
      <p>
        2 1
and coincides with the solution x obtained for the uniform distance (H; F )
between Hyperexponential distribution H with 1 &gt; 2 and the parent
(Exponential) distribution F with parameter 1 [12]. The expression (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ) in this case
becomes
x = (x0 + u)
2
and it follows that
      </p>
    </sec>
    <sec id="sec-4">
      <title>For Pareto mixture</title>
      <p>
        H(x) = p
we nd from (
        <xref ref-type="bibr" rid="ref11">11</xref>
        )
=
It then follows that
(H; F ) = (1
      </p>
      <p>p) 1
lim
u!1
(Hu; F u) =
1
2
2
2
2
2
1
2
1
In this section, we rst compare the steady-state excesses of performance
measures in the bu ered multiserver queueing systems with renewal input ow.
Consider two systems with the same number N of servers working in parallel. (In
what follows the superscript (i) denotes the index of system i.) The service
discipline is assumed to be First-Come-First-Served. We denote by Sn(i) the service
time of customer n, and by t(ni) his arrival instant. The sequence of the
independent identically distributed (iid) interarrival times n(i) = t(ni+)1 t(ni); n 1; and
the sequence of the iid service times fSn(i); n 1g are assumed to be
independent, i = 1; 2. Denote by S(i) the generic service time, and by (i) the generic
interarrival time, i = 1; 2. At the arrival instant t(ni) of customer n, denote by
Q(ni) the queue size, by n(i) the number of customers and by Wn(i) the waiting
time of customer n. Denote, when exists, the limits (in distribution)</p>
      <p>Q(ni) ) Q(i); Wn(i) ) W (i); n ! 1; i = 1; 2:
These limits exist, in particular, when the interarrival times (i); i = 1; 2 are
non-lattice (for instance, when input is Poisson) and the following negative drift
assumption holds [1]:</p>
      <p>ES(i) &lt; N E (i):
Now we compare the steady-state queue size Q(i) and W (i) in the given systems
i = 1; 2, with the corresponding indexes Q and W in the system with the mixture
service time S de ned as</p>
      <p>
        S = IS(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) + (1
      </p>
      <p>
        I)S(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ):
The following statement contains conditions implying an ordering of conditional
excess of service time and performance indexes in given systems and the system
with mixed service time.
      </p>
      <p>
        Theorem 4. Assume that the following conditions hold:
(
        <xref ref-type="bibr" rid="ref13">13</xref>
        )
(
        <xref ref-type="bibr" rid="ref14">14</xref>
        )
(
        <xref ref-type="bibr" rid="ref15">15</xref>
        )
(
        <xref ref-type="bibr" rid="ref16">16</xref>
        )
S(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ).
      </p>
      <p>
        tu
Then the excess service times are ordered in failure rate as follows:
and queue sizes and waiting times are stochastically ordered:
1(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) =st 1(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) = 0;
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) =
st
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ); S(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
      </p>
      <p>
        S(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ):
r
r
      </p>
      <p>
        r
S(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
u
      </p>
      <p>
        ISu(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) + (1
      </p>
      <p>
        I)Su(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
      </p>
      <p>
        Su(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ); u
      </p>
      <p>
        0;
Q(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
W (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
st
st
      </p>
      <p>Q
W
st
st</p>
      <p>
        Q(
        <xref ref-type="bibr" rid="ref2">2</xref>
        );
W (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ):
If additionally, S(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) is NBU and S(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) is NWU then also
      </p>
      <p>
        st
S(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
u
      </p>
      <p>
        ISu(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) + (1
      </p>
      <p>
        I)Su(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
st
      </p>
      <p>
        Su(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ):
Proof. Under conditions (
        <xref ref-type="bibr" rid="ref13">13</xref>
        ) it follows from relation (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) that S(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
r r
Then Theorem 5 in [17] implies (
        <xref ref-type="bibr" rid="ref15">15</xref>
        ). The inequalities (
        <xref ref-type="bibr" rid="ref14">14</xref>
        ) and (
        <xref ref-type="bibr" rid="ref16">16</xref>
        ) are the direct
corollaries of the Theorems 1 and 2, respectively.
      </p>
      <p>
        S
It is worth mentioning that indeed the stochastic ordering of service times S(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
st
S(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) in (
        <xref ref-type="bibr" rid="ref13">13</xref>
        ) is su cient for inequalities (
        <xref ref-type="bibr" rid="ref15">15</xref>
        ). However we use failure rate ordering
because, for some distributions, it is more easy to nd conditions implying this
ordering. Also we note that we can replace stochastic ordering in (
        <xref ref-type="bibr" rid="ref15">15</xref>
        ) by the
ordering w.p.1, using a coupling technique, see [16].
      </p>
      <p>The analysis of performance indexes in multiserver systems with mixtures of
service times is usually a complicated problem which, as a rule, has not
analytical solution. An estimation of these indexes by simulation is often also a hard
problem. In such cases we may separately analyze the systems with component
service times to construct the upper and lower bounds for the target indexes
based on the results of Theorem 4 and simulation method of regenerative
envelops, recently developed in the works [8,9,10].</p>
      <p>Indeed the mixture service time distributions naturally arise in the
analysis of the multiclass queueing systems. In such systems, there are K classes of
arrivals, and class-i customers have the iid service times fSn(i); n 1g with
generic element S(i). Assume (for simplicity only) that class-i customers follow
Poisson input with rate i. Then the total input rate is = PiK=1 i, and each
new customer is class-i one with the probability pi = i= ; i = 1; : : : ; K: In
the multiserver queuing system with FCFS service discipline and stochastically
equivalent servers, each new customer entering each server is class-i one with
the same probability pi. Then the (class-independent) service time of the nth
customer entering the system (or arbitrary server) can be written as the mixture
Sn =st</p>
      <p>
        K
X In(i)Sn(i); n
i=1
1;
(
        <xref ref-type="bibr" rid="ref17">17</xref>
        )
where indciator In(i) = 1 if the nth customer is class-i (and In(i) = 0 otherwise).
Thus the service time in the multiclass system has mixture distribution, and the
representation (
        <xref ref-type="bibr" rid="ref17">17</xref>
        ) can be used, for instant, to study the asymptotic behaviour
of the remaining service time of the customer being in the server at instant t
as t ! 1. It is worth mentioning that in such an analysis we can obtain not
only some bounds but explicit asymptotic expressions as well. For instance, one
prove, using coupling argument, that the stationary remaining service time in
such an N -server system has the following explicit distribution
      </p>
      <p>K
X
i=1</p>
      <p>N
i Z 1</p>
      <p>x
F (x) = 1
(1</p>
      <p>Fi(u))du; x
0;
where Fi is the distribution of S(i). For more details see [11].
6</p>
      <p>Conclusion
In this paper, we study the applicability of the failure rate ordering and
stochastic comparison to the steady-state of performance measures in the multiserver
systems with two-component mixture service time distributions. For such
systems, we consider the conditions imposed on service time distributions implying
monotonicity properties of the failure rate functions. Also we discuss how
mixture service time distribution arises in the multiclass systems. Some particular
examples are considered as well. The interesting problem for future research
is the preservation property of stochastic ordering for conditional excesses of
performance indexes.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. S. Asmussen : Applied Probability and Queues (2nd ed.). Springer-Verlag, New York,
          <year>2003</year>
          . 439 P. https://doi.org/10.1007/b97236
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>T.</given-names>
            <surname>Aven</surname>
          </string-name>
          , U. Jensen : Stochastic Models in Reliability. Springer-Veriag New York, Inc.
          <year>2013</year>
          . 297 P. https://doi.org/10.1007/978-1-
          <fpage>4614</fpage>
          -7894-2
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>P.</given-names>
            <surname>Embrechts</surname>
          </string-name>
          , C. Kluppelberg, T. Mikosch,
          <source>Modelling Extremal Events for Insurance and Finance</source>
          . Springer Heidelberg New York Dordrecht London.
          <year>1997</year>
          . 660 P.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>C D</given-names>
            <surname>Lai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M</given-names>
            <surname>Xie</surname>
          </string-name>
          <article-title>: Stochastic Ageing</article-title>
          and Dependence for Reliability, Springer Science+Business Media, Inc.,
          <year>2006</year>
          , 418 P. https://doi.org/10.1007/ 0-387-34232-X
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>V.Y.</given-names>
            <surname>Korolev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.A.</given-names>
            <surname>Krylov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.V.</given-names>
            <surname>Kuz</surname>
          </string-name>
          <article-title>'min : Stability of nite mixtures of generalized Gamma-distributions with respect to disturbance of parameters</article-title>
          . Inform. App.,
          <year>2011</year>
          , 5, pp.
          <volume>31</volume>
          {
          <fpage>38</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>G.I.</given-names>
            <surname>Mclachlan</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          <article-title>Peel : Finite mixture models</article-title>
          .
          <source>Wiley series in probability and statistics. Applied probability and statistics section</source>
          .
          <year>2001</year>
          . 439 P. https://doi. org/10.1002/0471721182
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>A.</given-names>
            <surname>Marshall</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <article-title>Olkin : Life distributions. Structure of nonparametric, semiparametric and parametric families</article-title>
          . Springer Science+Business Media, LLC.
          <year>2007</year>
          . 783 P. https://doi.org/10.1007/978-0-
          <fpage>387</fpage>
          -68477-2
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>E.</given-names>
            <surname>Morozov</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Peshkova</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          .
          <source>Rumyantsev : On Failure Rate Comparison of Finite Multiserver Systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Arti cial Intelligence and Lecture Notes in Bioinformatics) 11965 LNCS</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>419</fpage>
          -
          <lpage>431</lpage>
          . https://doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -36614-8_
          <fpage>32</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>E.</given-names>
            <surname>Morozov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Nekrasova</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Peshkova</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>Rumyantsev : A regeneration-based estimation of high performance multiserver systems</article-title>
          .
          <source>Communications in Computer and Information Science 608</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>271</fpage>
          -
          <lpage>282</lpage>
          . https://doi.org/10.1007/ 978-3-
          <fpage>319</fpage>
          -39207-3_
          <fpage>24</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. E. Morozov,
          <string-name>
            <surname>I. Peshkova</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Rumyantsev :
          <article-title>On Regenerative Envelopes for Cluster Model Simulation</article-title>
          . In: Vishnevskiy,
          <string-name>
            <given-names>V.M.</given-names>
            ,
            <surname>Samouylov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.E.</given-names>
            , and
            <surname>Kozyrev</surname>
          </string-name>
          , D.V. (eds.) Distributed Computer and Communication Networks: 19th International Conference,
          <string-name>
            <surname>DCCN</surname>
          </string-name>
          <year>2016</year>
          , Moscow, Russia,
          <source>November 21-25</source>
          , Springer International Publishing, Cham,
          <year>2016</year>
          , Revised Selected Papers. pp.
          <volume>222</volume>
          {
          <fpage>230</fpage>
          . https://doi.org/ 10.1007/978-3-
          <fpage>319</fpage>
          -51917-3_
          <fpage>20</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Morozov</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morozova</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>On the stationary remaining service time in the queueing systems (submitted for SMART2020)</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Morozov</surname>
          </string-name>
          , E.;
          <string-name>
            <surname>Pagano</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Peshkova</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Rumyantsev</surname>
            ,
            <given-names>A. Sensitivity</given-names>
          </string-name>
          <string-name>
            <surname>Analysis</surname>
          </string-name>
          and
          <article-title>Simulation of a Multiserver Queueing System with Mixed Service Time Distribution</article-title>
          .
          <source>Mathematics</source>
          <year>2020</year>
          ,
          <volume>8</volume>
          ,
          <fpage>1277</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Peshkova</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morozov</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maltseva</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>On Comparison of Multiserver Systems with Two-component Mixture Distributions (submitted in DCCN 2020</article-title>
          , CCIS series).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Peshkova</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morozov</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maltseva</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>On comparison of multiserver systems with Exponential-Pareto mixture distribution</article-title>
          ,
          <source>Computer Networks</source>
          .
          <volume>1231</volume>
          ,
          <year>2020</year>
          , pp.
          <fpage>141</fpage>
          -
          <lpage>152</lpage>
          . https://doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -50719-0_
          <fpage>11</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>S.</given-names>
            <surname>Ross</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.G.</given-names>
            <surname>Shanthikumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhu</surname>
          </string-name>
          :
          <article-title>On increasing-failure-rate random variables</article-title>
          , Appl.Prob, no.
          <issue>42</issue>
          ,
          <year>2005</year>
          , pp.
          <volume>797</volume>
          {
          <fpage>809</fpage>
          . https://doi.org/10.1239/jap/1127322028
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. H. Thorisson ; Coupling, Stationarity, and Regeneration, Springer, New York,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17. W. Whitt :
          <article-title>Comparing counting processes and queues</article-title>
          ,
          <source>Advances in Applied Probability</source>
          , Vol.
          <volume>13</volume>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <year>1</year>
          ,
          <issue>1981</issue>
          , pp.
          <fpage>207</fpage>
          -
          <lpage>220</lpage>
          . https://doi.org/10.2307/1426475
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>