<!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>Estimation of the length of the process simulation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Valeriy A. Naumov</string-name>
          <email>valeriy.naumov@pfu.fi</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yuliya V. Gaidamaka</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anna A. Platonova</string-name>
          <email>aaplatonova@list.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Federal Research Center “Computer Science and Control” (FRC CSC RAS)</institution>
          ,
          <addr-line>44-2 Vavilov St, Moscow, 119333, Russian Federation</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>In: K. E. Samouylov, L. A. Sevastianov, D. S. Kulyabov (eds.): Selected Papers of the 12</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Peoples' Friendship University of Russia (RUDN University)</institution>
          ,
          <addr-line>6 Miklukho-Maklaya St, Moscow, 117198, Russian Federation</addr-line>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Service Innovation Research Institute</institution>
          ,
          <addr-line>Annankatu 8 A, Helsinki, 00120</addr-line>
          ,
          <country country="FI">Finland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>115</fpage>
      <lpage>124</lpage>
      <abstract>
        <p>The paper is devoted to the method of determining the simulation duration suficient for estimating of unknown parameters of the distribution law for given values of the relative error and the confidence level. The method is developed for nonnegative random variables, for nonnegative regenerating sequence and for nonnegative regenerating piecewise-constant process. An algorithm for simulation a piecewise constant random process is proposed, the result of which is the number of experiments or the duration of the simulation as well as the estimates of unknown parameters obtained as a result of simulation. The results of numerical experiments illustrating the application of the method for determining the simulation duration are given for a predetermined relative error and confidence level. For the examples, two distributions are chosen from the families of one-parameter and two - from two-parameter distributions. The simulation of random variables with the chosen distributions took into account the simulation duration, suficient for estimating the unknown parameters of the distribution law for given relative error and confidence level. For chosen distributions, series of experiments were performed at diferent values of the relative error and the confidence probability.</p>
      </abstract>
      <kwd-group>
        <kwd>and phrases</kwd>
        <kwd>confidence</kwd>
        <kwd>simulation</kwd>
        <kwd>estimation of an unknown parameter</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1. Introduction
experiments.</p>
      <p>One way to analyze the characteristics of a random process is to simulate it, when
the model of the calculated process is fully reproduced. Simulation simulation relies
on Monte Carlo methods - numerical methods for solving mathematical problems by
simulation random</p>
      <p>
        variables. The most important technique in this case is to bring
the problem to the calculation of mathematical expectations [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. If the mathematical
expectation is unknown, the problem arises of estimating it with the required accuracy.
Methods are known for obtaining estimates for unknown parameters of the distribution
law of a random variable on the basis of a limited number of experiments [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ]. In this
case, it is necessary to determine the duration of the simulation, suficient to estimate
the unknown parameters of the distribution law for given relative error and confidence
level. The method for determining the length of the simulation, based on the central
limit theorem, is proposed in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>The approach is also applicable to estimating the
characteristics of nonnegative regenerating process both in discrete or in continuous time.
The method</p>
      <p>makes it possible to obtain estimates of the characteristics of a random
process both in discrete and continuous time, i.e. the characteristics that depend on
the number of jumps in states and the characteristics that depend on the time of stay
in states.</p>
      <p>The method is applicable for the case of known values of the distribution
characteristics corresponding to the experiments, and for the case of unknown values of
the mathematical expectation and variance, for which they are obtained from existing</p>
      <p>In Section 2, the method is described for the case of simulation independent identically
distributed random variables. Section 3 presents the simulation algorithm. In Section
4, a numerical experiment was carried out for some of the laws of distribution
— the
exponential distribution, the</p>
      <p>
        Weibull distribution, the Rayleigh distribution, and the
Pareto distribution, the characteristics of which are known [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. For these distributions,
for a number of values of the relative error, for several values of the confidence probability,
a series of experiments were conducted and estimates of the mathematical expectation
~ and variance ~ were obtained as well as a suficient length of the series of experiments
(the duration of the simulation). A numerical experiment illustrates the operation of the
method for determining the length of simulation for a given relative error and confidence
level [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>2.</p>
      <p>
        Method for determining the length of the simulation
In this section the method for determining the length of the simulation is described
Let n be the number of independent experiments on a nonnegative random variable
X, on the basis of which we estimate ~ and ~ for the mathematical expectation m&gt;0
according to [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
and variance D:
~ =
∑︀
=1
      </p>
      <p>,
~ =
∑︀
=1 ( − ~)2
 − 1</p>
      <p>We express the probability on the left-hand side of the inequality in terms of the
normal distribution function
* ():
(1)
(2)
(3)</p>
      <p>⎷⎸⎸ 1
 = ∑︁  ( − − 1) ,   = ∑︁ 2 ( − − 1) .
where  =  *</p>
      <p>and  * () is the inverse of * () meaning the value of
the argument at which the normal distribution function is equal to x.</p>
      <p>If mathematical expectation m and variance D are not known, we use their estimates
 = ~ and  ˜ =</p>
      <p>
        Thus, the required number n of experiments will be found from the inequality [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]:
(4)
(5)
(6)
(7)
(8)
(9)
(10)
      </p>
      <p>
        Inequality (7) is also applicable in the case when the values 1, 2, ...,  form a
nonnegative regenerating sequence, i.e. discrete time random process [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>Denote  = 1 + 2 + ... +  and  = 21 + 22 + ... + 2, then
Therefore, the required number of experiments can be found from the inequality
In order to avoid overflow when exponentiation of accumulated amounts, it is more
convenient to use its record in the following form:
where  =
︁(  )︁ 2


assumes a constant value  on the interval [− 1, ) , 0 = 0 &lt; 1 &lt; 2 &lt; . . . &lt; − 1 &lt;
estimated by formulas
~ =

 , ~ =

 −
and the required simulation duration of the T is found from the inequality
The mathematical expectation and variance of this process on the interval [0,T ) are</p>
      <p>︂(
≤   +
1 )︂

3.</p>
      <p>Simulation Algorithm
︂(  )︂ 2</p>
      <p>,

(12)
(13)
(14)
(15)</p>
      <p>Let X(t) = (1(), 2(), ..., ()) be a piecewise constant process with L
components, either in discrete or in continuous time.</p>
      <p>Let nonnegative functions () (X()) and () (X()) be characteristics of the process
X() in case of discrete or continuous time correspondingly with the mathematical
expectations
() = lim</p>
      <p>→∞ 
() = lim
 →∞  0

=1
1 ∫︁ 
1 ∑︁ () (X()),  = 1, 2, . . . , ,</p>
      <p>() (X()) ,  = 1, 2, . . . , ,
where  and  are the corresponding numbers of characteristics.</p>
      <p>The goal is to estimate () and () with predetermined values of relative error 
and confidence probability  . In addition the following input data should be determined:
 - duration of transit period before beginning of accumulating statistics;  - the
maximum length of the simulation in case of failure to achieve the specified accuracy;
eps - infinitesimal increment in time units;  - small quantity to avoid zero divide in
step d.</p>
      <p>The algorithm for simulation a piecewise constant process to obtain estimates of
required characteristics is given below.
the time of the next jump   .
quantities () and (),  = 1, 2, ..., . We set  = 1 and   = 0.</p>
      <p>a) Set the duration of the transit period  &gt; 0, the maximum simulation duration
 &gt;  and determine the initial state of the process X(t):X = X(0).</p>
      <p>For each characteristic () of the process X(t), we zero out the quantities () and
(),  = 1, 2, ..., . For each characteristic () of the process X(t), we zero out the
b) Set   =  , and then for each component of the process  () determine
and the corresponding component  = {  }, where 1 ≤  ≤ .</p>
      <p>We determine the instant   = {  } of the nearest jump of the process X(t)
If   ≥
We change the accumulated data:
, we set   =  + .</p>
      <p>() := () + () (X) ,
 () := () + ︁(
()(X)
︁) 2</p>
      <p>,  = 1, 2, . . . , ,
() := () + () (X) (  −  ),
(16)
g) End of simulation.</p>
      <p>~() =
~() =

()

() ,  = 1, 2, . . . , ,</p>
      <p>,  = 1, 2, . . . , .
to the estimates during determined period .</p>
      <p>At the end of simulation one obtain the estimates ~() for discrete time process or
~() for continuous time process as well as the number of experiments or simulation
duration. In case specified accuracy was not achieved the values ~() and ~() correspond
4.</p>
      <p>Numerical results
probability  =0.95 are chosen.</p>
      <p>For the simulation, we selected the distributions of non-negative continuous random
variables — the exponential distribution and the Rayleigh distribution (one-parameter),
the</p>
      <p>
        Weibull distribution and the Pareto distribution (two-parameter) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
For all
experiments three values of relative errors  ∈ {10− 2, 10− 3, 10− 4
} and the confidence
 () := () + ︁(
()(X)
︁) 2
(  −  ),  = 1, 2, . . . , .
(17)
(18)
(19)
(20)
(21)
(22)
process X(t): X = X( ).
      </p>
      <p>c) If   &lt; , then we set  :=  + 1 and find the following state
X of the
If   ≥ , go to step f (the specified accuracy is not achieved).
d) If   &gt;  and for some values () &lt;  or () &lt;  , then go to step b.
e) If   &gt;  and for some characteristic (), we have
then go to step b. If for some characteristic (), we have ()
then go to step b.</p>
      <p>f ) We calculate the estimates of the average values of the characteristics
()
() &gt; () (︀  + 1 )︀ ,
,
() = 1 − − 
with the parameter  =3.</p>
      <p>For several values of the relative error  the number n of experiments necessary to
achieve the required accuracy with given confidence level  =0.95 is indicated, together
with the corresponding estimates ~ for mathematical expectation and ~ for variance.
expectation ~ and variance ~, the straight line corresponds to the exact value of the
mathematical expectation  ≈
0.333 (21) and variance  ≈
0.111 (22).
The number n of experiments and numerical characteristics for the exponential
distribution with the parameter  =3
The number n of experiments and numerical characteristics for the Weibull
distribution with the parameters  =1 and k =5
with the parameters  =1 and k =5.</p>
      <p>,</p>
      <p>In Figure 3 and Figure 4 the curves correspond to the simulation estimate of the
mathematical expectation ~ and variance ~, the straight line corresponds to the
analytical value of the mathematical expectation   = 0.9181 (24) and variance
  ≈
distribution (23) show the dependence of the number of experiments on the relative
pending on the relative error for the
exponential distribution
depending on the relative error for the
with the parameters =2, =3.
  =
︂(  )︂ 2
(31)</p>
      <p>In Figure 9 and Figure 10 the curves correspond to the estimate of the mathematical
expectation ~ and variance ~, the straight line corresponds to the exact value of the
mathematical expectation   = 1.5 (30) and variance   = 0.75 (31).</p>
      <p>In this paper we propose an algorithm for simulation of a regeneration
multicomponent process. The length of the simulation is specified by the relative errors
of the process parameters. The algorithm makes it possible to obtain estimates the
characteristics of the process, both in discrete and continuous time, which depend on
the number of jumps in the states, and on the characteristics of the stay time in states.</p>
      <p>The result of the algorithm is the number of experiments (the number of process
jumps) or the duration of the simulation as well as the estimates of unknown parameters
obtained as a result of simulation.</p>
      <p>
        The numerical experiment is an illustration of the work of the method for
determining the simulation duration, suficient for estimating the unknown parameters of
the distribution law for given relative error and confidence level. The evaluation of the
parameters obtained on the basis of a series of experiments, in the case considered
mathematical expectation and variance, was compared with the exact values of these
parameters, the analytical form of which for taken distributions is known. We note that
the method makes it possible to determine a suficient length of a series of experiments
also for the case when the values of the distribution law parameters are unknown, and
estimates for these parameters are obtained on the basis of simulation [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. This method
is planned to be used in simulating random access [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and adaptive radio access [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] for
LTE networks as a development of previous research.
      </p>
      <p>Acknowledgments</p>
      <p>The publication has been prepared with the support of the “RUDN University Program
5-100” and funded by RFBR according to the research projects No. 18-07-00576,
1907-00933. This work has been developed within the framework of the COST Action
CA15104, Inclusive Radio Communication Networks for 5G and beyond (IRACON).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Metropolis</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ulam</surname>
            <given-names>S</given-names>
          </string-name>
          .
          <source>The Monte Carlo Method // Journal of the American Statistical Association</source>
          , Vol.
          <volume>44</volume>
          , No.
          <volume>247</volume>
          (
          <issue>Sep</issue>
          .,
          <year>1949</year>
          ).- pp.
          <fpage>335</fpage>
          -
          <lpage>341</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Wentzel</surname>
            <given-names>E.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ovcharov L</surname>
          </string-name>
          .A. Applied problems in probability theory. - Moscow: Mir.
          <article-title>- 1986.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Ross S.M.</surname>
          </string-name>
          <article-title>A first course in probability</article-title>
          / 9th ed. University of Southern California. Upper Saddle River, New Jersey London,
          <string-name>
            <given-names>Prentice</given-names>
            <surname>Hall</surname>
          </string-name>
          .
          <article-title>- 2014.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Naumov</surname>
            <given-names>V.A.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Gaidamaka</given-names>
            <surname>Yu</surname>
          </string-name>
          .V.
          <article-title>Opredelenie momenta ostanovki modelirovanija pri zadannyh oshibke i urovne doverija [Determination of the stopping time for simulation with a given error and confidence level]. Trudy 21 Mezhdunarodnoj konferencii «Raspredelennye komp'juternye i telekommunikacionnye seti: teorija i prilozhenija» DCCN-</article-title>
          <year>2018</year>
          ,
          <fpage>17</fpage>
          -
          <lpage>21</lpage>
          sentjabrja
          <year>2018</year>
          .
          <string-name>
            <surname>Moskva</surname>
          </string-name>
          .
          <article-title>-</article-title>
          <year>2018</year>
          . - S.
          <fpage>287</fpage>
          -
          <lpage>292</lpage>
          .
          <source>[Proc. 21st International Conference Distributed Computer and Communication Networks (DCCN</source>
          <year>2018</year>
          ), Moscow, Russia,
          <source>September 17-21</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>287</fpage>
          -
          <lpage>292</lpage>
          ].
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Johnson</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kotz</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Balakrishnan</surname>
            <given-names>N. Continuous</given-names>
          </string-name>
          <string-name>
            <surname>Univariate</surname>
            <given-names>Distribution</given-names>
          </string-name>
          , Volume
          <volume>1</volume>
          . Wiley, New York.- 1994.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Iglehart</surname>
            <given-names>D. L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shedler</surname>
            <given-names>G. S. Regenerative</given-names>
          </string-name>
          <article-title>Simulation of Response Times in Networks of Queues</article-title>
          . Springer-Verlag Berlin Heidelberg,
          <year>1980</year>
          . doi:
          <volume>10</volume>
          .1007/BFb0044445.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Borodakiy</surname>
            <given-names>V.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Samouylov</surname>
            <given-names>K.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gudkova</surname>
            <given-names>I.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Markova</surname>
            <given-names>E.V.</given-names>
          </string-name>
          <string-name>
            <surname>Analyzing</surname>
          </string-name>
          <article-title>Mean Bit Rate of Multicast Video Conference in LTE Network with Adaptive Radio Admission Control Scheme //</article-title>
          <source>Journal of Mathematical Sciences (United States)</source>
          .-
          <volume>218</volume>
          (
          <issue>3</issue>
          ).-
          <fpage>2016</fpage>
          .- pp.
          <fpage>257</fpage>
          -
          <lpage>268</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Gudkova</surname>
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Samouylov</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buturlin</surname>
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Borodakiy</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gerasimenko</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Galinina</surname>
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Andreev</surname>
            <given-names>S.</given-names>
          </string-name>
          <article-title>Analyzing impacts of coexistence between M2M and H2H Communication on 3GPP</article-title>
          <source>LTE System // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</source>
          ,
          <fpage>8458</fpage>
          .-
          <lpage>2014</lpage>
          .- pp.
          <fpage>162</fpage>
          -
          <lpage>174</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>