1. Introduction
Retrial queues have been extensively studied due to their applications in service and computer and telecommunication systems. The main feature of retrial queues is that a blocked customer that cannot receive service upon arrival joins a virtual queue called an orbit and retries to enter a server after some random time. The analysis of retrial queues is challenging due to the non-homogeneity of the underlying Markov chain of these systems. As a result, analytical solutions for the stationary queue length of retrial queues are found in only a few special cases with a small number of servers (see some surveys and related references [
1,
2,
3,
4,
5]).
Analytical solutions are even more challenging for the network of retrial queues as the so-called product-form solutions do not exist [
6]. This motivated us to consider scaling limits for these models. In a recent series of work [
7,
8,
9,
10], we studied tandem queues with one orbit. In these papers, we studied an asymptotic regime where the retrial rate is extremely small, proving that in the transient regime, two scaled versions of the number of customers in orbit converge to a deterministic process and the diffusion process, respectively. Furthermore, in the stationary regime, two scaled versions of the number of customers in orbit converge to the constant and the Normal distribution, respectively.
This paper extends our work to a new framework with multiple orbits. Each orbit corresponds to a buffer of a server in the tandem queue. Our model is formulated by a four-dimensional Markov chain representing the state of the two servers and two orbits. As the size of each orbit is unlimited, the underlying Markov chain has two infinite dimensions. Furthermore, the underlying Markov chain is non-homogeneous because the retrial rate is proportional to the number of customers in orbit. This makes the analytical solution of the joint queue-length distribution very challenging. In order to obtain exact results, we consider a regime where the retrial rates of both orbits are scaled by a scaling factor. In this regime, the numbers of customers in both orbits explode. We, however, prove that two scaled versions of the numbers of customers in orbits converge to a deterministic vector and a vector of two random variables with Normal distribution, respectively. The proof is based on the characteristic function of the joint distribution of the numbers of calls in orbits.
As for closely related work, Avrachenkov and Yechiali [
11] studied tandem blocking queues with a common retrial queue (constant retrial rate), while Takahara [
12] proposed a fixed point approximation for a queueing network with caller’s retrial. In Ref. [
12], the joint distribution of the number of customers in orbit(s) was not considered, and all nodes are assumed to be independent. To the best of our knowledge, our work is the first to consider an analytic solution for the joint stationary distribution of the numbers of customers in orbits. Furthermore, some related models were also presented in Refs. [
13,
14,
15,
16,
17,
18,
19,
20,
21].
The rest of our paper is organized as follows.
Section 2 presents the model and the problem statement.
Section 3 shows the system of Kolmogorov equations.
Section 4 is devoted to the first-order asymptotic where we show that a scaled version of the numbers of customers in orbit converges to a constant vector. In
Section 5, we further prove that another version of the numbers of customers in orbits extracting the constant converges to a vector following two-variable Normal distribution. Finally,
Section 6 demonstrates some numerical examples showing the applicability of our asymptotic results as approximations.
2. Model Description and Markov Chain
We consider a tandem queueing network with Poisson arrival process of incoming calls with rate
fed to two servers (see
Figure 1). Upon the arrival of a call, if the first server is free, the call occupies it and is served for an exponentially distributed time with mean
. If the first server is busy, the call is sent to the orbit of the first server for an exponentially distributed time with mean
and retries to enter the first server again. Upon service completion from server 1, the call tries to enter to the second server. If the second server is free, the call moves to it for a service with an exponentially distributed random time with mean
. In case the second server is busy, the call moves to the orbit of the second server and retries to enter the second server after some exponentially distributed time with mean
. The call leaves the system after receiving a service from the second server.
Let and denote the state of the first server and that of the second server at time . If server i is busy otherwise for . Furthermore let and denote the numbers of calls in the first and the second orbits at the time , respectively. The process is a Markov chain on the state space .
The goal of the study is to obtain an exact asymptotic expression for the two-dimensional stationary probability distribution of the numbers of calls in orbits .
Lemma 1. The necessary stability condition for X(t) is .
Proof. Because the first server and its orbit form an M/M/1/1 retrial queue, this queue’s necessary and sufficient stability condition is
. It should be noted that the output process of the first queue is not a renewal process [
2]. However, under the stability condition of the first queue, i.e.,
, the departure rate from the first queue is also
. Under the stability condition of the second queue, the probability that the second server is busy is given by
, which implies the proof. □
3. Balance Equations and Characteristic Functions
Under the steady state, we define the stationary probabilities
We define the partial characteristic functions, denoting
as follows:
The balance equations for the probabilities in (
1) are given as follows.
with the convention that
if
or
. Multiplying these equations by
, taking the summation over
, and arranging the results we obtain the following system of equations for characteristic functions.
Let us write the system (
3) in the matrix form and multiply the resulting system by the identity column vector
(with all elements of 1) to obtain the following system.
where
.
The system of Equation (
5) is the basis for further research. We will solve it by the method of asymptotic analysis [
22] under the asymptotic condition
where
. The method of asymptotic analysis is carried out in two stages: the first stage
and the second stage
.
4. The First Order Asymptotic
By denoting
,
, we get the following system
Furthermore, we perform in the system (
6) the following substitution
With this substitution represents the vector of characteristic functions of .
We derive the following system.
which we will solve under the following assumptions.
Theorem 1. The vector is a vector of the states of servers that satisfies the normalization condition and is the solution of the matrix equationwhere and are solutions of the equationsand where and are parameters of the asymptotic analysis. Remark 1. It should be noted thatrepresents the infinitesimal generator of the Markov chain of the states of the two-server tandem queue without buffers and retrials. In particular, the arrival process to the first server is superposed by a Poisson with rate λ, and an additional Poisson process with rate (representing the retrials from the first orbit), while the input to the second server is the output from the first server and a Poisson process with rate (representing the retrials from orbit 2). Furthermore, we interpret (11) and (12) as the balance equations of the rates coming into and out of orbit 1 and orbit 2, respectively. In fact, represents the blocking flow going into the orbit and does the flow successfully going out the orbit (seeing the first server idle). The same interpretation is also applied for (12). Proof. Let us take the limit
in the system (
8) and obtain
It should be noted that the nontrivial (
) solution of (
13) is unique because the underlying Markov chain has unique stationary distribution and its characteristic function. We find the solution of this system in the form
where row vector
defines the probability distribution of the states of servers. If we can find the solution in this form, it will be the unique solution of (
13).
Substituting the Equation (
14) in the system (
13), we obtain
We will find the solution of the system (
15) in the following form
then
and
.
So, substituting these expressions into (
15), we obtain
Because
the theorem is proved. □
Solving this system, we find the probability distribution of states of servers , and parameters and .
Remark 2. At first look, the system of Equation (17) has 7 equations while the number of unknowns is 6. However, as we mentioned in Remark 1, the matrix is the infinitesimal generator of a Markov chain the system of equations has one redundant equation. Thus, in fact, we have 6 equations for 6 unknowns. Remark 3. Theorem 1 implies that converges in distribution to as . Thus, we can have the approximation Equation (
18) represents the deterministic part of the number of calls in the orbits. In order to see the stochastic part, we consider the second-order asymptotic in
Section 5.
5. The Second Order Asymptotic
We subtract the deterministic part in (
18) to investigate the stochastic part. To this end, we define
represents the characteristic function of .
Substituting the following in the system (
5)
we obtain
In the system (
20), we make substitutions
With this substitution, represents the characteristic function of
We then rewrite the system in the following form
For the system (
22), we will solve under the assumption that
and its derivatives have limits as
.
Theorem 2. In the context of Theorem 1, we havewhere , , and are the second-order central moments, defined as Furthermore, and are given in the following form:where C is an arbitrary constant, , , , , , and are solutions of the following systems Proof. Let us substitute the following expansion into the system (
22)
Taking a series expansion of the exponent, we obtain
Let us rewrite the system (
28) in the following form:
Furthermore, let us divide the first equation by
, the second by
and take the limit
to obtain
We will find the solution in the following form
and then
We substitute these two equations into the system (
30) to obtain
Let us consider equations of the system (
32) separately, i.e., the coefficients of
and
are 0.
The system (
33) is an inhomogeneous system of linear algebraic equations for
and
. Since the matrix of the coefficients
(as explained in Remark 1) is an infinitesimal generator, and the rank of the extended matrix is equal to the rank of
, the system has many solutions.
Let us consider the inhomogeneous system of Equation (
33) and the homogeneous system of Equation (
17). If we compare them, we can see that system (
17) is the homogeneous system for system (
33). In this case, we can write the solution to the system (
33) in the form
where
C is a constant, and each of
,
,
,
,
, and
is a particular solution of the inhomogeneous system (
33).
By substituting the expression (
34) in the system (
33), we obtain
and get the system of equations to find a particular solution of the inhomogeneous system (
33) as follows.
All these systems of linear equations are feasible because is the infinitesimal generator of a Markov chain, as explained in Remark 1.
From the system (
36) we can find
,
,
,
, and
,
and substitute to (
34) to find
,
. In order to find
,
, and
, we solve the system of equations such that the coefficients of
in (
32) are zeros.
The theorem is proved. □
So, the second order asymptotic shows that the asymptotic probability distribution of the number of calls in the orbit is a two-dimensional Gaussian with asymptotic means and , dispersions and , covariance .
Remark 4. In the above procedure, we can see that C is an arbitrary parameter. At the first look, the values of and are not unique. As a result, , and may not be unique. However, it turns out that these values are unique because we can prove that C disappears from (37). In fact, we look atwhich includes C due to . Substituting in (34) into this quantity, we see that the coefficient of C is given by due to (11). Similarly, we also have that the coefficients of C in the expressions of and are also zero. These imply that and do not depend on C. 6. Numerical Examples
We consider
,
,
,
,
,
,
,
.
Figure 2 presents the approximation of the probability distribution of the number of calls in orbits.
In this case, covariance , asymptotic means , , and dispersions , of the number of calls in the orbits and probability distribution of states of servers .
The characteristic function
of the number of calls in the first orbit has the form [
2]
We apply the inverse Fourier transform of the pre-limit characteristic function (
38) and write the pre-limit density of the probability distribution of the number of calls in the first orbit in the form:
We can also explicitly express
as in Ref. [
2]. We obtain the Gaussian limiting probability distribution of the number of calls in the first orbit
with asymptotic mean
and dispersions
. We consider a numerical example for
,
,
,
,
,
,
,
and show the comparison of the asymptotic density
and the pre-limit probability density
of the number of calls in the first orbit in
Figure 3, where the Kolmogorov distance is equal to 0.017, which is acceptable.
Author Contributions
Conceptualization, A.N., T.P.-D., S.P. and M.M.; Methodology, A.N., T.P.-D., S.P. and M.M.; Software, S.P. and M.M.; Validation, T.P.-D., S.P. and M.M.; Formal analysis, A.N., T.P.-D., S.P. and M.M.; Investigation, A.N. and M.M.; Data curation, S.P.; Writing—original draft, A.N., T.P.-D., S.P. and M.M.; Writing—review & editing, T.P.-D. and S.P.; Visualization, M.M.; Supervision, A.N., T.P.-D. and S.P. All authors have read and agreed to the published version of the manuscript.
Funding
This study was supported by the Tomsk State University Development Programme (Priority-2030).
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Falin, G. A survey of retrial queues. Queueing Syst. 1987, 7, 127–168. [Google Scholar] [CrossRef]
- Falin, G.; Templeton, J.G. Retrial Queues; CRC Press: Boca Raton, FL, USA, 1997; Volume 75. [Google Scholar]
- Phung-Duc, T. An explicit solution for a tandem queue with retrials and losses. Oper. Res. 2012, 12, 189–207. [Google Scholar] [CrossRef] [Green Version]
- Artalejo, J.R.; Gómez-Corral, A. Retrial Queueing Systems; Springer: Berlin/Heidelberg, Germany, 2008. [Google Scholar]
- Yang, T.; Templeton, J. A survey on retrial queues. Queueing Syst. 1987, 2, 203–233. [Google Scholar] [CrossRef]
- Artalejo, J.; Economou, A. On the non-existence of product-form solutions for queueing networks with retrials. Queueing Syst. 2005, 27, 13–19. [Google Scholar]
- Nazarov, A.A.; Paul, S.V.; Phung-Duc, T.; Morozova, M. Analysis of tandem Retrial Queue with common orbit and Poisson arrival process. Lect. Notes Comput. Sci. 2021, 13104, 441–456. [Google Scholar]
- Nazarov, A.A.; Paul, S.V.; Phung-Duc, T.; Morozova, M. Scaling limits of a tandem retrial queue with common orbit and Poisson arrival process. Lect. Notes Comput. Sci. 2021, 13144, 240–250. [Google Scholar]
- Nazarov, A.A.; Paul, S.V.; Phung-Duc, T.; Morozova, M. Analysis of Tandem Retrial Queue with Common Orbit and MMPP Incoming Flow. Lect. Notes Comput. Sci. 2023, 13766, 270–283. [Google Scholar]
- Nazarov, A.A.; Paul, S.V.; Phung-Duc, T.; Morozova, M. Mathematical Model of the Tandem Retrial Queue M/GI/1/M/1 with a Common Orbit. Commun. Comput. Inf. Sci. 2022, 1605, 131–143. [Google Scholar]
- Avrachenkov, K.; Yechiali, U. On tandem blocking queues with a common retrial queue. Comput. Oper. Res. 2010, 37, 1174–1180. [Google Scholar] [CrossRef] [Green Version]
- Takahara, G. Fixed point approximations for retrial networks. Probab. Eng. Inf. Sci. 1996, 10, 243–259. [Google Scholar] [CrossRef]
- Kim, C.S.; Park, S.H.; Dudin, A.; Klimenok, V.; Tsarenkov, G. Investigation of the BMAP/G/1→/PH/1/M tandem queue with retrials and losses. Appl. Math. Model. 2010, 34, 2926–2940. [Google Scholar] [CrossRef]
- Kumar, B.K.; Sankar, R.; Krishnan, R.N.; Rukmani, R. Performance analysis of multi-processor two-stage tandem call center retrial queues with non-reliable processors. In Methodology and Computing in Applied Probability; Springer: Berlin/Heidelberg, Germany, 2021; pp. 1–48. [Google Scholar]
- Kuznetsov, N.; Myasnikov, D.; Semenikhin, K. Optimal control of data transmission in a mobile two-agent robotic system. J. Commun. Technol. Electron. 2016, 61, 1456–1465. [Google Scholar] [CrossRef]
- Pourbabai, B. Tandem behavior of a telecommunication system with finite buffers and repeated calls. Queueing Syst. 1990, 6, 89–108. [Google Scholar] [CrossRef]
- Pourbabai, B. Tandem behavior of a telecommunication system with repeated calls: A general case without buffers. Eur. J. Oper. Res. 1993, 65, 247–258. [Google Scholar] [CrossRef]
- Moutzoukis, E.; Langaris, C. Two queues in tandem with retrial customers. Probab. Eng. Inf. Sci. 2001, 15, 311–325. [Google Scholar] [CrossRef]
- Reed, J.; Yechiali, U. Queues in tandem with customer deadlines and retrials. Queueing Syst. 2013, 15, 1–34. [Google Scholar] [CrossRef] [Green Version]
- Vinarskiy, M. A model of a source retrial open exponential queueing network with finite shared buffers in multi-queue nodes. In Proceedings of the Eighth International Conference on Advanced Communications and Computation, Barcelona, Spain, 22–26 July 2018; pp. 17–24. [Google Scholar]
- Vinarskiy, M. A source-retrial queuing network with finite shared buffers in multi-queue nodes: A method of approximate analysis. Int. J. Oper. Res. 2021, 42, 443–463. [Google Scholar] [CrossRef]
- Nazarov, A.A.; Moiseeva, S.P. Retrial Queueing Systems; Scientific and Technical Lit.: Tomsk, Russia, 2006; Volume 75. [Google Scholar]
| Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).