<!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>
      <journal-title-group>
        <journal-title>International Conference on Applied Informatics
Eger, Hungary, January</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Simulation of Finite-Source Retrial Queuing Systems With Collisions, Non-Reliable Server and Impatient Customers in the Orbit</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ádám Tóth</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>János Sztrik</string-name>
          <email>sztrik.janos@inf.unideb.hu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Informatics University of Debrecen</institution>
          <addr-line>Kassai Road 26, Debrecen, 4028</addr-line>
          ,
          <country country="HU">Hungary</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <volume>2</volume>
      <fpage>9</fpage>
      <lpage>31</lpage>
      <abstract>
        <p>The goal of the paper is to study a M/M/1//N finite-source retrial queuing system with collisions and customers' impatient behavior in the orbit. The server is not reliable, breakdown can happen either in busy or in idle states. The situation when an incoming customer from the orbit or from the source ifnds the server busy causes a collision and both requests are directed toward the orbit (including the customer under service, too). It is assumed that every request in the source is eligible to generate customers whenever the server is not working but these requests immediately get into the orbit. A customer after some waiting for the server to be served can depart from the orbit without fulfilling its service requirement these are the so-called impatient customers. In that case it goes back to the source. All random variables involved in the model construction are supposed to be independent of each other. The novelty of the investigation is to carry out a sensitivity analysis comparing various distributions of impatient time of customers on the performance measures such as mean number of customers in the orbit, mean waiting time of an arbitrary customer, mean waiting time of customers who leave the system without service, probability of abandonment, server utilization, etc. By the use of a self-developed simulation program several graphical results and comparisons of the investigated systems are illustrated.</p>
      </abstract>
      <kwd-group>
        <kwd>impatient customer</kwd>
        <kwd>retrial queueing system</kwd>
        <kwd>sensitivity analysis</kwd>
        <kwd>simulation</kwd>
        <kwd>non-reliability</kwd>
        <kwd>collision</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        At present with the rapid increase of trafic growth balks the analysis and optimal
designing of communication systems. With regard to exchanging of information,
a lot of communication process are created by companies from day to day.
Consequently, construction of new applicable models of telecommunication systems or
modifying of existing ones are necessary. Queuing systems with repeated calls may
competently describe major telecommunication systems, such as telephone
switching systems, call centers, CSMA-based wireless mesh networks in frame level.
Numerous papers and books are devoted to study their importance like [
        <xref ref-type="bibr" rid="ref19 ref20">19, 20</xref>
        ]. The
main feature of retrial queueing system is that customers remain in the system
even if it is unable to find idle service unit and after some random time it attempts
to reach the service facility again. Impatience of the customers is a natural
phenomenon and an interesting topic in queueing theory. The process of reneging and
balking is extensively studied by many researchers for example in [
        <xref ref-type="bibr" rid="ref21 ref22">21, 22</xref>
        ].
Whenever an arriving customer decides not to enter the system is called balking while
in reneging a customer in the system after waiting for some time leaves the system
without being served. In our investigated model reneging customers are considered.
      </p>
      <p>
        Speaking of communication systems where the available channels or other
facilities are very limited thus users (sources) usually need to fight for these resources.
This results a high possibility of conflict because several sources may launch
uncoordinated attempts producing collisions. In these cases the loss of transmission
takes place and it is necessary to ensure of the process of retransmission. So
evolving eficient procedures for preventing conflict and corresponding message delay is
essential. Some results on retrial queues with collision that have been published in
[
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5">1, 2, 3, 4, 5</xref>
        ].
      </p>
      <p>
        In many papers of retrial queueing literature the service unit is assumed to
be available steadily. But these assumptions are quite unrealistic because in real
life applications of these systems can break down, diferent types of problems can
arise like power outage, human error or other failures. Various factors have efect
on the transmission rate of the wireless channel in a a wireless communication
scenario and these are apt to sufer transmission failure, interruptions throughout
transferring the packets. Investigating retrial queueing systems with random server
breakdowns and repairs has a great importance as the operation of non-reliable
systems modifies system characteristics and performance measures. Finite-source
retrial queues with server breakdowns have been investigated in several papers, for
example in [
        <xref ref-type="bibr" rid="ref6 ref7 ref8">6, 7, 8</xref>
        ], where the MOSEL software package (Modeling, Specification
and Evaluation Language) is used or in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] where several homogeneous servers were
modeled and analyzed by the help of Generalized Stochastic Petri nets (GSPNs)
using retrial systems. There are other papers which studied a finite-source retrial
queue where the server is subject to breakdowns like [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref14">10, 11, 12, 13, 14</xref>
        ].
      </p>
      <p>
        In this paper we study the operation of the system where the service unit is
subject to breakdown and waiting customers can leave the system without spending
time at the service unit. The novelty of this investigation is to carry out sensitivity
analysis using assorted distributions of impatience of calls on performance measures
like mean waiting time of an incoming call or total utilization of the server. To
accomplish this goal a simulation program is evolved based on SimPack toolkit [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]
which is a collection of C and C++ libraries. In this several diferent simulation
algorithms are developed and provide the user with a set of utilities to build a
working simulation from a model description. This is a frame and contains very
basic building blocks, the model and its correct operation was coded by us. With
the help of this program graphical results are given.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. System model</title>
      <p>A retrial queueing system of type M/M/1//N is considered with a non-reliable
server and impatient customers which Figure 1 represents. In the finite-source</p>
      <p>customers reside and each of them is able to generate calls towards the server
with rate /
so the inter-request time is exponential with parameter /
. Every
incoming customer has an “impatience” property which determines how much time
the customer spend in the orbit without fulfilling its service requirement. Exceeding
this time result that the customer no longer waits for the service unit and departs
without being served properly. This variable follows gamma, hypo-exponential,
hyper-exponential, Pareto and lognormal distribution with diferent parameters but
with the same mean value. In absence of waiting queue if an incoming customer
ifnds the server in idle state its service starts immediately. The service times of
the customers is exponentially distributed with parameter  . After its successfully
service customers return to the source.</p>
      <p>Encountering the service unit in busy
state the incoming customer remains in the system entering the orbit. After an
exponentially distributed time with parameter /
customers located in the orbit
make an other attempt to get into the service. The server is not reliable so from
time to time it is supposed to break down. This is an exponentially distributed
random variable with parameter  0 in case of a busy server and  1 when the server
awaits a customer.</p>
      <sec id="sec-2-1">
        <title>The repair process starts immediately upon the breakdown</title>
        <p>which also follows exponential distribution with parameter  2. If server failure
takes place during the service of a customer then it is transferred to the orbit.</p>
        <p>All the random variables involved in the model construction are assumed to be
totally independent of each other.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Simulation results</title>
      <p>
        performance measures a statistics package is involved in our simulation program,
written by Andrea Francini in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. This class applies the method of batch mean to
gather a sequence of independent samples (batch means) by aggregating 
successive observations of a steady state simulation. It is one of the easiest and common
technique for establishing a confidence interval for steady state mean of a process.
The size of batches should be long enough to guarantee that the sample averages
are approximately independent. Taking the average of the sample averages of each
batch results the final mean value.
      </p>
      <sec id="sec-3-1">
        <title>More detailed information about this technique see for example [17].</title>
      </sec>
      <sec id="sec-3-2">
        <title>The simulations are performed with the confidence</title>
        <p>level of 99.9%. Relative half-width of the confidence interval required to stop the
simulation run is 0.00001.</p>
        <p>
          Our aim is to examine how the diferent distributions of impatience of calls
have an efect on the performance measure when the mean and variance are equal,
in such a way that the squared coeficient of variation would be greater than one.
For comparison hyper-exponential, gamma, lognormal and Pareto distributions are
utilized besides the case when the mean value is constant. Our simulation program
is equipped with random number generators and these functions need input
parameters which are diferent in every distribution. To achieve valid comparison in
case of every distribution fitting process is needed to be done which can be viewed
in [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ].
        </p>
        <p>N
100
/
0.01
 0
0.1
 1
0.1
 2
1
/
0.01

1</p>
        <p>
          Figure 2 shows the comparison of steady-state distribution of the customers. It
represents the probability of how many customers residing in the system. Taking
a closer look on the results all the curves correspond to normal distribution and
in the following papers the proof of this phenomenon can be found in [
          <xref ref-type="bibr" rid="ref23 ref24 ref25">23, 24, 25</xref>
          ].
However, this figure clearly displays the contrast among the applied distributions.
Although the shape of the curves is almost the same the average number of
customers in the system varies a little bit especially in case of Pareto distribution and
when the average of impatience of calls is constant the mean is more compared to
the others.
The mean response time of a successfully served customer is shown in function
of arrival intensity on Figure 3. Under successfully served customer we mean those
customers who leaves the system through the service unit. Interestingly, diferences
can be observed even though the first two moments are equal, especially in case
of applying gamma distribution. Results clearly illustrate the efect of various
distributions. Highest values are experienced at gamma distribution. Despite the
increasing arrival intensity the maximum property characteristic of finite-source
retrial queueing systems occurs under suitable parameter settings.
        </p>
        <p>Figure 4 demonstrate how the probability of abandonment of a customer changes
with the increment of the arrival intensity. Under probability of abandonment we
mean the probability of that a customer leaves the system without getting its
full service requirement (through the orbit). After a slow increase of the value of
this performance measure it stagnates which is true for every used distributions
of impatience of calls but they difer significantly from each other. At gamma
distribution the tendency of leaving the system earlier is much higher than the
others especially compared to at constant mean of impatience of calls. Here the
disparity is much higher among the applied distributions compared to the previous
ifgures.</p>
        <p>The last figure is related to the total utilization of server versus arrival
intensity. Total utilization contains every service time including the interrupted ones
no matter whether a call departed from the service unit or from the orbit. By
examining closely the figure we find prominent results when gamma distribution
is applied and regarding the others the received values are almost identical. With
the increment of arrival intensity the total utilization of the service unit increases
as well.
3.1. Diferent parameter setting
After viewing the above outcomes and figures we are intrigued to know how the
operation of the system changes if another parameter setting is used. To do so we
modify the parameters in order the squared coeficient of variation to be less than
one so hyper-exponential is exchanged for hypo-exponential distribution.</p>
      </sec>
      <sec id="sec-3-3">
        <title>Table 3 contains the modified parameter setting of distribution of impatience of calls. Other parameters remain unchanged (see Table 1).</title>
        <p>Distribution
Parameters</p>
        <p>Mean</p>
        <p>Variance
Squared coeficient of variation</p>
        <p>Gamma
among the applied distributions with this parameter setting, too. As regard to the
values with these parameters the mean number of customer is higher in case of
every distribution.</p>
        <p>The next figure shows the mean response time of a successfully served customer
in function of arrival intensity. Examining Figure 7 the same tendency can be seen
as on the previous figure but diferences can still be discovered especially in case of
gamma distribution. This figure also reveals that customers averagely spend less
time in the system compared to the previous parameter setting.
Figure 8 demonstrates the probability of abandonment of a customer versus
arrival intensity. Not surprisingly after seeing the previous two figures the diference
of achieved values are relatively far from each other, disparity is still present among
the applied distributions. It can be stated that with these parameters customers
are more tend to leave the system from the orbit.</p>
        <p>Lastly, on Figure 9 the running parameter (value of x-axis) is the arrival
intensity and value of y-axis is the total utilization of the server. Among the lines
there are not so significant diferences, they coincide with each other meaning that
the utilization is almost the same except in case of Pareto and gamma distribution
where the utilization of service unit is significantly less.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>In this paper a finite-source retrial queueing system is presented with a non-reliable
server, collisions and impatient customers. The obtained results fully demonstrated
how pivotal selecting a distribution of impatience of calls because it has a great
influence on the system characteristics despite the fact that the mean and the
variance are exactly the same. Figure in connection with probability of abandonment
clearly assure this phenomenon. Results evidently indicated the distinction is
noticeable and significant among the performance measures having the same mean
and variance of diferent distributions when the squared coeficient of variation is
greater than one and moderate when it is less than one. In the future we would
like to deal with more distributions to expand our investigation and examine the
performance measures when the distribution of service time is not exponential. We
also would like to analyze systems of two-way communication in order to carry out
a valid collating.</p>
      <p>Acknowledgements. The research work of Ádám Tóth, János Sztrik was
supported by the construction EFOP-3.6.3-VEKOP-16-2017-00002. The project was
supported by the European Union, co-financed by the European Social Fund.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Kvach</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nazarov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <article-title>Sojourn Time Analysis of Finite Source Markov Retrial Queuing System with Collision</article-title>
          , In: Dudin A.,
          <string-name>
            <surname>Nazarov</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yakupov</surname>
            <given-names>R</given-names>
          </string-name>
          . (eds) Information Technologies and
          <string-name>
            <surname>Mathematical Modelling - Queueing Theory</surname>
            and
            <given-names>Applications. ITMM</given-names>
          </string-name>
          <year>2015</year>
          .
          <article-title>Communications in Computer</article-title>
          and Information Science Vol.
          <volume>564</volume>
          (
          <year>2015</year>
          ),
          <fpage>64</fpage>
          -
          <lpage>72</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Kvach</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <article-title>Numerical research of a Markov closed retrial queueing system without collisions and with the collision of the customers</article-title>
          ,
          <source>In: Proceedings of Tomsk State University. A series of physics and mathematics. Tomsk. Materials of the II AllRussian Scientific</source>
          Conference Vol.
          <volume>295</volume>
          (
          <year>2014</year>
          ),
          <fpage>1051</fpage>
          -
          <lpage>12</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Kvach</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nazarov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <article-title>Numerical research of a closed retrial queueing system M/GI/1//N with collision of the customers</article-title>
          ,
          <source>In: Proceedings of Tomsk State University. A series of physics and mathematics. Tomsk. Materials of the III All-Russian Scientific Conference</source>
          Vol.
          <volume>297</volume>
          (
          <year>2015</year>
          ),
          <fpage>65</fpage>
          -
          <lpage>70</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Kvach</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nazarov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <article-title>The research of a closed RQ-system M/GI/1//N with collision of the customers in the condition of an unlimited increasing number of sources</article-title>
          , In: Probability Theory, Random Processes, Mathematical Statistics and
          <article-title>Applications: Materials of the International Scientific Conference Devoted to the 80th Anniversary of Professor Gennady Medvedev</article-title>
          ,
          <source>Doctor of Physical and Mathematical Sciences</source>
          (
          <year>2015</year>
          ),
          <fpage>65</fpage>
          -
          <lpage>70</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Nazarov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kvach</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yampolsky</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <article-title>Asymptotic Analysis of Closed Markov Retrial Queuing System with Collision</article-title>
          , In: Dudin A.,
          <string-name>
            <surname>Nazarov</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yakupov</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gortsev</surname>
            <given-names>A</given-names>
          </string-name>
          . (eds) Information Technologies and
          <string-name>
            <surname>Mathematical Modelling. ITMM</surname>
          </string-name>
          <year>2014</year>
          .
          <article-title>Communications in Computer</article-title>
          and Information Science Vol.
          <volume>487</volume>
          (
          <year>2014</year>
          ),
          <fpage>334</fpage>
          -
          <lpage>341</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Almási</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roszik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sztrik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <article-title>Homogeneous finite-source retrial queues with server subject to breakdowns and repairs</article-title>
          ,
          <source>Mathematical and Computer</source>
          Modelling Vol.
          <volume>42</volume>
          , No.
          <fpage>5</fpage>
          -
          <lpage>6</lpage>
          (
          <year>2005</year>
          ),
          <fpage>673</fpage>
          -
          <lpage>682</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Sztrik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <article-title>Tool supported performance modelling of finite-source retrial queues with breakdowns</article-title>
          ,
          <source>Publicationes</source>
          Mathematicae Vol.
          <volume>66</volume>
          (
          <year>2005</year>
          ),
          <fpage>197</fpage>
          -
          <lpage>211</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Sztrik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Almási</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roszik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <article-title>Heterogeneous finite-source retrial queues with server subject to breakdowns and repairs</article-title>
          ,
          <source>Journal of Mathematical Sciences</source>
          Vol.
          <volume>132</volume>
          (
          <year>2006</year>
          ),
          <fpage>677</fpage>
          -
          <lpage>685</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Gharbi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ioualalen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>GSPN analysis of retrial systems with servers breakdowns and repairs</article-title>
          ,
          <source>Applied Mathematics and Computation</source>
          Vol.
          <volume>174</volume>
          , No.
          <volume>2</volume>
          (
          <issue>2006</issue>
          ),
          <fpage>1151</fpage>
          -
          <lpage>1168</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Dragieva</given-names>
            <surname>Velika</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <article-title>Number of retrials in a finite source retrial queue with unreliable server</article-title>
          ,
          <source>Asia-Pacific Journal of Operational Research</source>
          Vol.
          <volume>31</volume>
          , No.
          <volume>2</volume>
          (
          <issue>2014</issue>
          ),
          <fpage>23</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Gharbi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nemmouchi</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mokdad</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ben-Othman</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <article-title>The impact of breakdowns disciplines and repeated attempts on performances of small cell networks</article-title>
          ,
          <source>Journal of Computational Science</source>
          Vol.
          <volume>5</volume>
          , No.
          <volume>4</volume>
          (
          <issue>2014</issue>
          ),
          <fpage>633</fpage>
          -
          <lpage>644</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Krishnamoorthy</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pramod</surname>
            ,
            <given-names>P. K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chakravarthy</surname>
            ,
            <given-names>S. R.</given-names>
          </string-name>
          <article-title>Queues with interruptions: a survey</article-title>
          ,
          <source>TOP</source>
          Vol.
          <volume>22</volume>
          , No.
          <volume>1</volume>
          (
          <issue>2014</issue>
          ),
          <fpage>290</fpage>
          -
          <lpage>320</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <article-title>Performance analysis of the retrial queues with finite number of sources and service interruptions</article-title>
          ,
          <source>Journal of the Korean Statistical Society</source>
          Vol.
          <volume>42</volume>
          , No.
          <volume>1</volume>
          (
          <issue>2013</issue>
          ),
          <fpage>117</fpage>
          -
          <lpage>131</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Tóth</surname>
            ,
            <given-names>Á.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bérczes</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sztrik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kvach</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>Simulation of Finite-Source Retrial Queueing Systems with Collisions and a Non-reliable Server</article-title>
          , In: Vishnevskiy V.,
          <string-name>
            <surname>Samouylov</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kozyrev</surname>
            <given-names>D</given-names>
          </string-name>
          . (eds)
          <article-title>Distributed Computer and Communication Networks</article-title>
          .
          <source>DCCN 2017. Communications in Computer and Information Science</source>
          Vol.
          <volume>700</volume>
          (
          <year>2017</year>
          ),
          <fpage>146</fpage>
          -
          <lpage>158</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Fishwick</surname>
            ,
            <given-names>Paul A.</given-names>
          </string-name>
          <article-title>SimPack: Getting Started With Simulation Programming In C And C++</article-title>
          ,
          <source>In: Proceedings of the 24th Conference on Winter Simulation</source>
          (
          <year>1992</year>
          ),
          <fpage>154</fpage>
          -
          <lpage>162</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Francini</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neri</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <article-title>SimPack: Getting Started With Simulation Programming In C And C++</article-title>
          , In: Proceedings of MASCOTS '
          <fpage>96</fpage>
          - 4th International Workshop on Modeling,
          <source>Analysis and Simulation of Computer and Telecommunication Systems</source>
          (
          <year>1996</year>
          ),
          <fpage>116</fpage>
          -
          <lpage>122</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kelton</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <article-title>A Procedure for Generating Batch-Means Confidence Intervals for Simulation: Checking Independence and Normality</article-title>
          , Simulation Vol.
          <volume>83</volume>
          (
          <year>1996</year>
          ),
          <fpage>683</fpage>
          -
          <lpage>694</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Sztrik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Tóth, Á.,
          <string-name>
            <surname>Pintér</surname>
          </string-name>
          , Á.,
          <string-name>
            <surname>Bács</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <article-title>Simulation of Finite-Source Retrial Queues with Two-Way Communications to the Orbit</article-title>
          , In: Dudin A.,
          <string-name>
            <surname>Nazarov</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moiseev</surname>
            <given-names>A</given-names>
          </string-name>
          . (eds) Information Technologies and
          <string-name>
            <given-names>Mathematical</given-names>
            <surname>Modelling</surname>
          </string-name>
          .
          <source>Queueing Theory and Applications</source>
          .
          <source>ITMM 2019. Communications in Computer and Information Science</source>
          Vol.
          <volume>1109</volume>
          (
          <year>2019</year>
          ),
          <fpage>270</fpage>
          -
          <lpage>284</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Fiems</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Phung-Duc</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <article-title>Light-tracfi analysis of random access systems without collisions</article-title>
          ,
          <source>Annals of Operations Research</source>
          Vol.
          <volume>277</volume>
          (
          <year>2017</year>
          ),
          <fpage>3113</fpage>
          -
          <lpage>27</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Artalejo</surname>
            ,
            <given-names>J. R.</given-names>
          </string-name>
          ,
          <source>Gomez Corral, A. Retrial Queueing Systems: A Computational Approach</source>
          , Springer (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Kumar</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sharma</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>Transient performance analysis of a single server queuing model with retention of reneging customers</article-title>
          ,
          <source>Yugoslav Journal of Operations Research</source>
          Vol.
          <volume>28</volume>
          ,
          <issue>Issue 3</issue>
          (
          <year>2018</year>
          ),
          <fpage>315</fpage>
          -
          <lpage>331</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>C. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dudin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dudin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Samouylov</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <article-title>Analysis of a Semi-Open Queuing Network with a State Dependent Marked Markovian Arrival Process, Customers Retrials</article-title>
          and Impatience, Mathematics Vol.
          <volume>7</volume>
          (
          <issue>2019</issue>
          ),
          <fpage>715</fpage>
          -
          <lpage>734</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Nazarov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sztrik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kvach</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tóth</surname>
            ,
            <given-names>Á.</given-names>
          </string-name>
          <article-title>Asymptotic sojourn time analysis of finite-source M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs</article-title>
          .
          <source>Ann Oper Res</source>
          Vol.
          <volume>288</volume>
          , (
          <year>2020</year>
          ),
          <fpage>417</fpage>
          -
          <lpage>434</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Nazarov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sztrik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kvach</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bérczes</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <article-title>Asymptotic analysis of finitesource M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs</article-title>
          .
          <source>Ann Oper Res</source>
          Vol.
          <volume>277</volume>
          , (
          <year>2019</year>
          ),
          <fpage>2132</fpage>
          -
          <lpage>29</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Sudyko</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nazarov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sztrik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <article-title>Asymptotic waiting time analysis of a ifnite-source M/M/1 retrial queueing system</article-title>
          .
          <source>Probability in the Engineering and Informational Sciences</source>
          Vol.
          <volume>33</volume>
          Issue 3, (
          <year>2019</year>
          ),
          <fpage>387</fpage>
          -
          <lpage>403</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>