<!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>Performance Analysis of Two-Way Communication Retrial Queueing Systems With 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>
          <xref ref-type="aff" rid="aff1">1</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>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Informatics, University of Debrecen</institution>
          ,
          <addr-line>Debrecen</addr-line>
          ,
          <country country="HU">Hungary</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Proceedings of the 1</institution>
        </aff>
      </contrib-group>
      <fpage>246</fpage>
      <lpage>258</lpage>
      <abstract>
        <p>Many models of two-way communication queueing systems have been studied in recent years, they can be utilized in many fields of life like in [7, 28, 30]. Customers have always been characterized by the phenomena of impatience due to the long waiting time for service [4, 14, 15, 27]. In this paper, we consider two-way communication systems with a non-reliable server where primary customers may decide to leave the system after spending a considerable amount of time in the system before getting its proper service. The service unit can break down during its operation or in an idle state, too. Whenever the server becomes idle it may generate requests towards the customers' residing in an infinite source. These requests, the so-called secondary customers, can enter the system after a random time if the service unit is available and functional upon their arrivals. Otherwise, they return to the source without coming into the system. Every primary customer has a property of impatience meaning that an arbitrary request has the ability to</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>quit the system after some time while its demand remains unsatisfied.
During server failure, every individual may generate requests but these will be
forwarded immediately towards the orbit. The source, service, retrial,
impatience, operation, and repair times are supposed to be independent of each
other.</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        Nowadays due to the rapid technology development and the increase of trafic
growth, the study of communication systems is crucial and inevitable especially
in the topic of optimization. Not just companies or associations have some kind
of networking infrastructure but our homes as well, which results in a load of
communication processes. Therefore, the creation and modelling of new or
existing telecommunication systems are needed. With the help of queuing systems
with repeated calls are perfectly useful for modelling such arising issues in main
telecommunication systems, such as telephone switching systems, call centers, or
computer systems. In the last years, a great number of articles dealt with such
scenarios like in [
        <xref ref-type="bibr" rid="ref3 ref9">3, 9</xref>
        ].
      </p>
      <p>The fundamental characteristic of retrial queueing systems is that when every
service unit is busy an incoming customer remains in the system in a virtual waiting
room called the orbit. The customers who are located in the orbit try to enter the
service unit after a random time.</p>
      <p>
        Impatience is a natural phenomenon and models with this property are nearer to
reality and lead us to more precise analysis. Because of the relatively great number
of situations that can occur in healthcare applications, call centers,
telecommunication networks, it is no wonder that many papers were devoted to examining the
efect of impatience like [
        <xref ref-type="bibr" rid="ref13 ref18 ref25">13, 18, 25</xref>
        ]. Impatience can be interpreted in diferent
ways: balking customers decide not to join the queue if it is too long, jockeying
customers can move from its queue to another queue if they detect they will get
served faster, and reneging customers leave the queue if they have waited a definite
time for service. In our investigated model customers have a reneging feature.
      </p>
      <p>
        In connection with the communication systems users (or sources) typically are
coerced to fight for the available channels or facilities. The possibility of conflict
is relatively high when several sources initiate random attempts on the channel
producing collisions and the loss of transmissions. Developing eficient methods is
important for avoiding such collisions and corresponding message delay. The efect
of collisions have been published in numerous papers for example in [
        <xref ref-type="bibr" rid="ref19 ref20 ref21 ref22 ref24">19–22, 24</xref>
        ].
      </p>
      <p>
        The examination of the availability of the service unit is vital because a lot of
studies suppose that the service unit never fails and it is accessible on a permanent
basis. But these assumptions are quite unrealistic and in practice, on many
occasions, we find the service stations in failed state. This unfortunate behaviour has
a considerable influence on the system’s characteristics as well on the performance
measures thus it is worth investigating such systems with server breakdowns like
in the following papers [
        <xref ref-type="bibr" rid="ref12 ref16 ref29 ref32 ref8">8, 12, 16, 29, 32</xref>
        ].
      </p>
      <p>
        Recently in a relatively high number of papers make an efort to study two-way
communication designs thanks to their usefulness to model real-life examples in the
various application field. This is especially true for call centers where the service
unit not only processes incoming calls but also operates in idle state executing
certain other works like advertising and promoting products. In such systems
utilization of the service unit is always pivotal, see for example in [
        <xref ref-type="bibr" rid="ref1 ref11 ref17 ref2 ref26 ref31 ref5 ref7">1, 2, 5, 7, 11,
17, 26, 31</xref>
        ].
      </p>
      <p>The novelty of the present paper is to achieve a sensitivity analysis using
various distributions of service time of customers on the performance measures like
the mean waiting time of an arbitrary, successfully served and impatient customer,
the total utilization of the service unit, the probability of abandonment, etc. To
compare the efect of the diferent distributions on distinct metrics a stochastic
simulation program is developed based on SimPack. In this collection, you may
perform various algorithms in connection with discrete event simulation,
continuous simulation, and combined (multi-model) simulation. So we built a simulation
model to implement every feature of the system and to calculate and estimate the
desired measure using various values of input parameters. The obtained results
demonstrate the importance of utilized distribution under diferent parameter
settings represented by numerous figures and highlight some interesting specialties of
these types of systems.</p>
    </sec>
    <sec id="sec-3">
      <title>2. System</title>
    </sec>
    <sec id="sec-4">
      <title>Model</title>
      <p>In this paper, a two-way communication retrial queuing model is considered with
a non-reliable server (Figure 1). In this model,  customer populates the
finitesource implying that the system will be stable at every moment. Each customer
generates a request (primary customers) towards the server with rate / , so the
inter-request time follows an exponential distribution with parameter / . Our
model does not have a queue at all, thus in the case of an idle server the service of
a primary customer starts immediately. The service time of these requests follows
gamma, hypo-exponential, hyper-exponential, Pareto, and lognormal distribution
with diferent parameters but with the same mean value. After departing from
the system, successful requests go back to the finite-source. When the server is
occupied, the incoming primary customers are forwarded to the orbit where they
may retry to attain the service unit after an exponentially distributed random
time with parameter / . It is assumed that server failures take place during its
operation or in idle state according to exponential distribution time with the rate
 0 when it is busy and with rate  1 if it is idle. After server breakdown the repair
process begins right away and the repair time of the server is also an exponentially
distributed random variable with parameter  2.</p>
      <p>Every primary customer is characterized by an impatience property and in our
investigated model two diferent types are distinguished:
1. a primary customer after waiting for some time in the orbit leaves the system
without receiving its appropriate service,
2. a primary customer after waiting for some time in the system leaves the
system without receiving its appropriate service.</p>
      <p>This decision is made after a random time which is exponential with rate  .
After the server is becoming idle it has the possibility to produce outgoing calls
towards the customers (secondary) from an infinite source which is performed after
an exponentially distributed period with parameter  . The requirement of the
service of these customers is that the server will not be in a failed or busy state
upon their arrivals, otherwise, they are cancelled and turn back to the infinite
source without entering the system. The service time of this type of customer
follows a gamma distribution with parameters  2 and  2. Whenever the server
breaks down during the service of a customer the primary ones are forwarded
immediately towards the orbit and the secondary ones depart the system without
continuing their service.</p>
    </sec>
    <sec id="sec-5">
      <title>3. Simulation Results</title>
      <p>
        In Table 1 the various values of input parameters are shown for the simulation.
A statistics package is utilized to estimate the desired performance measures in
our program which was developed by Andrea Francini in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. This code uses the
method of batch means to collect a certain number of independent samples (batch
means) by amassing consecutive  observations of a steady-state simulation. It is
one of the most widespread and common methods to define a confidence interval
for the steady-state mean of a process. To have the sample averages approximately
independent the size of batches should be carefully selected. By calculating the
average of the sample averages of each batch we obtain the final mean value. About
this technique you can find detailed information in the following works [
        <xref ref-type="bibr" rid="ref23 ref6">6, 23</xref>
        ]. The
simulations are performed with a confidence level of 99.9%. The relative half-width
of the confidence interval required to stop the simulation run is
      </p>
      <sec id="sec-5-1">
        <title>3.1. First Scenario</title>
        <p>
          Achieving our objective we use hyper-exponential, gamma, lognormal and Pareto
distributions to investigate how these distributions of service time of primary
customers alter the performance measures. In the first scenario, the squared coeficient
of variation is greater than one. The parameters are selected that the mean and
variance would be identical and to accomplish an accurate comparison a fitting
process has been done. From this process, you can find detailed information in the
following paper [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ].
when the customers are not impatient. From the shape of the curves, it is clearly
visible that the steady-state distributions of the cases are seemed to be normally
distributed. With this parameter setting big diferences between the two impatient
modes do not develop but obviously, more customers are located averagely in the
system in the case of without impatience.
tions in the case of the steady-state distributions of the number of customers in
the orbit with impatience mode 2. Regardless of the distribution, every obtained
curve is similar to the normal distribution. In the case of Pareto distribution, the
mean number of customers is the highest and the efect of diferent distributions is
clearly observable.
        </p>
        <p>The mean waiting time is presented in function of arrival intensity of primary
customers on Figure 4, 5 and 6. First, I compared the efect of impatience.
Interestingly, the results are almost identical between the impatient modes whether we
talk about the mean waiting time of an arbitrary, successfully served, or impatient
customer. However, pronounced diferences appear when impatience is not present
vs. when there it is.</p>
        <p>After that we are curious to see how the efect of diferent used distributions
develop, so Figure 7, 8 and 9 demonstrates that. Even though the mean and variance
are the same, results clearly illustrate the efect of various distributions. The
highest values are experienced in the case of Pareto distribution and the lowest in the
case of the gamma distribution. With suitable parameter settings, we experience
the maximum property characteristic of a finite-source retrial queueing system.</p>
        <p>Figure 10 demonstrate how the probability of abandonment of a customer
changes with the increment of the arrival intensity. By a probability of
abandonment, we mean the probability 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 distribution
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 the other distributions.</p>
      </sec>
      <sec id="sec-5-2">
        <title>3.2. Second Scenario</title>
        <p>The question arises whether it is true for using other parameter settings for example
when the squared coeficient of variation of the service time of primary customers
is less than one. We use the same parameters as in the previous section (Table 1),
and Table 3 contains the changed parameters of service time of primary customers.
Instead of hyper-exponential, we use this time hypo-exponential distribution
because the squared coeficient of variation is always less or equal to one. We will
show some figures, Figure 11 is connected to the steady-state distribution of the
number of customers in the orbit. Analyzing the curves in more detail they
completely overlap each other. As regards the shape of the curves they correspond to
normal distribution. The mean number of customers is higher in the case of every
distribution compared to the previous section.</p>
        <p>The Figure 12 and 13 are related to the mean waiting of an arbitrary and
impatient customer. As you can see very slight diferences occur in the case of
Pareto distribution the values are a little bit higher. With this parameter setting
the interesting maximum value of the mean waiting time appears as in the previous
section.</p>
        <p>Figure 14 demonstrates the probability of abandonment of a customer versus
arrival intensity. Not surprisingly after seeing the previous figures the diference of
achieved values are relatively close to each other. It can be stated that with these
parameters customers are more tend to leave the system from orbit.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>4. Conclusion</title>
      <p>We investigated a queueing system of type // 1// with impatient customers
in the orbit and in the system and an unreliable server capable of calling in
requests from an infinite source in this paper. Simulation has been implemented,
it is shown that stationary probability distribution of the number of customers in
the orbit and in the system correlates to the Gaussian distribution regardless of
the used distribution of service time of the primary customers. Under diferent
scenarios, it was displayed when the squared coeficient of variation is greater than
one the applied distributions of service time have a significant influence on the
performance measures like the mean waiting time of an arbitrary, successfully served
and impatient customers or the probability of abandonment even though the mean
and variance are equal in the case of every distribution. Results also indicate that
there is almost no gap between the obtained values of measures when the squared
coeficient of variation is less than one. The authors plan to continue their research
work, examining the obtained phenomenon in more detail and expand their model
with other features like collisions, outgoing calls toward the customers from the
orbit, or carrying out other sensitivity analysis on other random variables.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Aguir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Karaesmen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. Z.</given-names>
            <surname>Akşin</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          <article-title>Chauvet: The impact of retrials on call center performance</article-title>
          ,
          <source>OR Spectrum 26.3</source>
          (
          <issue>2004</issue>
          ), pp.
          <fpage>353</fpage>
          -
          <lpage>376</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Aksin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Armony</surname>
          </string-name>
          ,
          <string-name>
            <surname>V.</surname>
          </string-name>
          <article-title>Mehrotra: The modern call center: A multi-disciplinary perspective on operations management research</article-title>
          ,
          <source>Production and operations management 16.6</source>
          (
          <issue>2007</issue>
          ), pp.
          <fpage>665</fpage>
          -
          <lpage>688</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Artalejo</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. G.</surname>
          </string-name>
          <article-title>Corral: Retrial Queueing Systems: A Computational Approach</article-title>
          , Springer,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Artalejo</surname>
          </string-name>
          ,
          <string-name>
            <surname>V.</surname>
          </string-name>
          <article-title>Pla: On the impact of customer balking, impatience and retrials in telecommunication systems</article-title>
          ,
          <source>Computers &amp; Mathematics with Applications</source>
          <volume>57</volume>
          .2 (
          <issue>2009</issue>
          ), pp.
          <fpage>217</fpage>
          -
          <lpage>229</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>L.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Gans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mandelbaum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zeltyn</surname>
          </string-name>
          ,
          <string-name>
            <surname>L</surname>
          </string-name>
          . Zhao:
          <article-title>Statistical analysis of a telephone call center: A queueing-science perspective</article-title>
          ,
          <source>Journal of the American statistical association 100</source>
          .469 (
          <year>2005</year>
          ), pp.
          <fpage>36</fpage>
          -
          <lpage>50</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>E. J.</given-names>
            <surname>Chen</surname>
          </string-name>
          , W. D.
          <article-title>Kelton: A Procedure for Generating Batch-Means Confidence Intervals for Simulation: Checking Independence and Normality</article-title>
          , SIMULATION
          <volume>83</volume>
          .10 (
          <year>2007</year>
          ), pp.
          <fpage>683</fpage>
          -
          <lpage>694</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>V.</given-names>
            <surname>Dragieva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Phung-Duc:</surname>
          </string-name>
          Two-Way Communication // 1// Retrial Queue,
          <source>in: International Conference on Analytical and Stochastic Modeling Techniques and Applications</source>
          , Springer,
          <year>2017</year>
          , pp.
          <fpage>81</fpage>
          -
          <lpage>94</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>V. I.</surname>
          </string-name>
          <article-title>Dragieva: Number of retrials in a finite source retrial queue with unreliable server</article-title>
          . English,
          <string-name>
            <surname>Asia-Pac</surname>
          </string-name>
          .
          <source>J. Oper. Res. 31.2</source>
          (
          <issue>2014</issue>
          ), p.
          <fpage>23</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Fiems</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          Phung-Duc:
          <article-title>Light-trafic analysis of random access systems without collisions</article-title>
          ,
          <source>Annals of Operations Research</source>
          <volume>277</volume>
          (
          <year>2019</year>
          ), pp.
          <fpage>311</fpage>
          -
          <lpage>327</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Francini</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          <article-title>Neri: A comparison of methodologies for the stationary analysis of data gathered in the simulation of telecommunication networks</article-title>
          ,
          <source>in: Proceedings of MASCOTS '96 - 4th International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems</source>
          , Feb.
          <year>1996</year>
          , pp.
          <fpage>116</fpage>
          -
          <lpage>122</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N.</given-names>
            <surname>Gans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Koole</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>Mandelbaum: Telephone call centers: Tutorial, review</article-title>
          , and research prospects,
          <source>Manufacturing &amp; Service Operations Management 5.2</source>
          (
          <issue>2003</issue>
          ), pp.
          <fpage>79</fpage>
          -
          <lpage>141</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>N.</given-names>
            <surname>Gharbi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Nemmouchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Mokdad</surname>
          </string-name>
          , J. Ben-Othman:
          <article-title>The impact of breakdowns disciplines and repeated attempts on performances of small cell networks</article-title>
          ,
          <source>Journal of Computational Science 5.4</source>
          (
          <issue>2014</issue>
          ), pp.
          <fpage>633</fpage>
          -
          <lpage>644</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>N.</given-names>
            <surname>Gupta</surname>
          </string-name>
          :
          <article-title>Article: A View of Queue Analysis with Customer Behaviour and Priorities</article-title>
          ,
          <source>IJCA Proceedings on National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011 RTMC.4 (May</source>
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>C.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dudin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dudin</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>Samouylov: Analysis of a Semi-Open Queuing Network with a State Dependent Marked Markovian Arrival Process</article-title>
          ,
          <source>Customers Retrials and Impatience, Mathematics</source>
          <volume>7</volume>
          .8 (
          <issue>2019</issue>
          ), pp.
          <fpage>715</fpage>
          -
          <lpage>734</lpage>
          , doi: https://doi.org/10.3390/math7080715.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>L.</given-names>
            <surname>Kleinrock</surname>
          </string-name>
          :
          <article-title>Creating a mathematical theory of computer networks</article-title>
          ,
          <source>Operations research 50.1</source>
          (
          <issue>2002</issue>
          ), pp.
          <fpage>125</fpage>
          -
          <lpage>131</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A.</given-names>
            <surname>Krishnamoorthy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. K.</given-names>
            <surname>Pramod</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. R.</given-names>
            <surname>Chakravarthy</surname>
          </string-name>
          <article-title>: Queues with interruptions: a survey</article-title>
          ,
          <source>TOP 22.1</source>
          (
          <issue>2014</issue>
          ), pp.
          <fpage>290</fpage>
          -
          <lpage>320</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kuki</surname>
          </string-name>
          , J. Sztrik, Á. Tóth,
          <string-name>
            <surname>T.</surname>
          </string-name>
          <article-title>Bérczes: A Contribution to Modeling Two-Way Communication with Retrial Queueing Systems</article-title>
          , in: Information Technologies and
          <string-name>
            <given-names>Mathematical</given-names>
            <surname>Modelling</surname>
          </string-name>
          .
          <source>Queueing Theory and Applications</source>
          , Springer,
          <year>2018</year>
          , pp.
          <fpage>236</fpage>
          -
          <lpage>247</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>R.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Som</surname>
          </string-name>
          : Optimization of an // 1/ Feedback Queue with Retention of Reneged Customers,
          <source>Operations Research and Decisions</source>
          <volume>24</volume>
          (
          <issue>Dec</issue>
          .
          <year>2014</year>
          ), pp.
          <fpage>45</fpage>
          -
          <lpage>58</lpage>
          , doi: https://doi.org/10.5277/ord140303.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kvach</surname>
          </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</source>
          , vol.
          <volume>295</volume>
          ,
          <article-title>Materials of the II All-Russian Scientific Conference, (In Russian)</article-title>
          ,
          <source>TSU Publishing House</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>105</fpage>
          -
          <lpage>112</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kvach</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>Nazarov: Numerical research of a closed retrial queueing system</article-title>
          // 1//
          <article-title>with collision of the customers</article-title>
          ,
          <source>in: Proceedings of Tomsk State University. A series of physics and mathematics. Tomsk</source>
          , vol.
          <volume>297</volume>
          ,
          <article-title>Materials of the III All-Russian Scientific Conference, (In Russian)</article-title>
          ,
          <source>TSU Publishing House</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>65</fpage>
          -
          <lpage>70</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kvach</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>Nazarov: The research of a closed RQ-system</article-title>
          // 1//
          <article-title>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, (In Russian)</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>65</fpage>
          -
          <lpage>70</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kvach</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>Nazarov: Sojourn Time Analysis of Finite Source Markov Retrial Queuing System with Collision</article-title>
          ,
          <source>in: Information Technologies and Mathematical Modelling - Queueing Theory and Applications</source>
          , ed. by
          <string-name>
            <given-names>A.</given-names>
            <surname>Dudin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nazarov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Yakupov</surname>
          </string-name>
          , Cham: Springer International Publishing,
          <year>2015</year>
          , pp.
          <fpage>64</fpage>
          -
          <lpage>72</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>A. M. Law</surname>
          </string-name>
          , W. D. Kelton:
          <article-title>Simulation Modeling and Analysis</article-title>
          ,
          <string-name>
            <surname>McGraw-Hill</surname>
            <given-names>Education</given-names>
          </string-name>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>A.</given-names>
            <surname>Nazarov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kvach</surname>
          </string-name>
          ,
          <string-name>
            <surname>V.</surname>
          </string-name>
          <article-title>Yampolsky: Asymptotic Analysis of Closed Markov Retrial Queuing System with Collision</article-title>
          ,
          <source>in: Information Technologies and Mathematical Modelling: 13th International Scientific Conference, ITMM</source>
          <year>2014</year>
          ,
          <article-title>named after</article-title>
          <string-name>
            <given-names>A.F.</given-names>
            <surname>Terpugov</surname>
          </string-name>
          , AnzheroSudzhensk, Russia,
          <source>November 20-22</source>
          ,
          <year>2014</year>
          . Proceedings, Cham: Springer International Publishing,
          <year>2014</year>
          , chap. 1, pp.
          <fpage>334</fpage>
          -
          <lpage>341</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>G.</given-names>
            <surname>Panda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Goswami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Datta</given-names>
            <surname>Banik</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          <article-title>Guha: Equilibrium balking strategies in renewal input queue with Bernoulli-schedule controlled vacation and vacation interruption</article-title>
          ,
          <source>Journal of Industrial and Management Optimization</source>
          <volume>12</volume>
          (
          <issue>Sept</issue>
          .
          <year>2015</year>
          ), pp.
          <fpage>851</fpage>
          -
          <lpage>878</lpage>
          , doi: https://doi.org/10.3934/jimo.
          <year>2016</year>
          .
          <volume>12</volume>
          .851.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>S.</given-names>
            <surname>Pustova</surname>
          </string-name>
          <article-title>: Investigation of call centers as retrial queuing systems</article-title>
          ,
          <source>Cybernetics and Systems Analysis 46.3</source>
          (
          <issue>2010</issue>
          ), pp.
          <fpage>494</fpage>
          -
          <lpage>499</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>K.</given-names>
            <surname>Rakesh</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>Sapana: Transient performance analysis of a single server queuing model with retention of reneging customers</article-title>
          ,
          <source>Yugoslav Journal of Operations Research 28.3</source>
          (
          <issue>2018</issue>
          ), pp.
          <fpage>315</fpage>
          -
          <lpage>331</lpage>
          , doi: https://doi.org/10.2298/YJOR170415007K.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>J.</given-names>
            <surname>Sztrik</surname>
          </string-name>
          , Á. Tóth, Á. Pintér,
          <string-name>
            <surname>Z.</surname>
          </string-name>
          <article-title>Bács: Simulation of Finite-Source Retrial Queues with Two-Way Communications to the Orbit</article-title>
          ,
          <source>in: Information Technologies and Mathematical Modelling. Queueing Theory and Applications</source>
          , ed. by
          <string-name>
            <given-names>A.</given-names>
            <surname>Dudin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nazarov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moiseev</surname>
          </string-name>
          , Cham: Springer International Publishing,
          <year>2019</year>
          , pp.
          <fpage>270</fpage>
          -
          <lpage>284</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>Á. Tóth</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Bérczes</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Sztrik</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>Kvach: Simulation of Finite-Source Retrial Queueing Systems with Collisions and a Non-reliable Server</article-title>
          , in: International Conference on Distributed Computer and Communication Networks, Springer,
          <year>2017</year>
          , pp.
          <fpage>146</fpage>
          -
          <lpage>158</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>Á. Tóth</surname>
          </string-name>
          , J. Sztrik:
          <article-title>Simulation of Finite-Source Retrial Queuing Systems With Collisions, Non-Reliable Server and Impatient Customers in the Orbit</article-title>
          ,
          <source>in: Proceedings of 11th International Conference on Applied Informatics, CEUR-WS</source>
          , pp.
          <fpage>408</fpage>
          -
          <lpage>419</lpage>
          , url: http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2650</volume>
          /#paper42.
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wolf</surname>
          </string-name>
          <article-title>: System and Method for Improving Call Center Communications</article-title>
          ,
          <source>US Patent App. 15/604</source>
          ,068,
          <string-name>
            <surname>Nov</surname>
          </string-name>
          .
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , J. Wang:
          <article-title>Performance analysis of the retrial queues with finite number of sources and service interruptions, English</article-title>
          ,
          <source>Journal of the Korean Statistical Society 42.1</source>
          (
          <issue>2013</issue>
          ), pp.
          <fpage>117</fpage>
          -
          <lpage>131</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>