Abstract
This paper considers a retrial tandem queue with single orbit, Poisson arrivals of incoming calls and without intermediate buffer. The first server provides services for incoming calls for an arbitrary random time, while the second server does for an exponentially distributed random time. Blocked customers at either the first server or the second server join the orbit and stay there for an exponentially distributed time before retrying to enter the first server again. Under an asymptotic condition when the mean of retrial intervals is extremely large, we derive a diffusion limit, which is further utilized to obtain an approximation to the number of customers in the orbit in stationary regime.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
1 Introduction
The new feature of retrial queues in comparison with the conventional ones is that blocked customers that cannot find an idle server upon arrival join the orbit and retry for service after some random time. These models have been extensively studied in the literature; see the books [1, 2] and survey papers [3, 4]. The paper [4] summarizes major analytical results on retrial queues up to 1990 for both single server and multiserver models. Reference [3] presents a careful survey on single server retrial models with and without impatient customers. Furthermore, a survey of recent results for retrial queues is presented in [5].
The analysis of retrial queues is more difficult in comparison with that of counterparts with infinite buffer because each orbiting customer independently retries leading to a total retrial rate that is proportional to the number of customers in the orbit.
Tandem queues are simple networks of queues connected in a line topology are widely used in many applications such as computer communication, manufacturing and service systems. For example, in call centers, customers first connect to IVR (Interactive Voice Response) unit and then to operators [6]. Some other applications can be found in transmitting multimedia information [7], and in [8] for modelling a multi-agent robotic system, etc.
To our knowledge, only a little attention was paid the study of on tandem queues with retrials due to the complex of these models. In [9], the authors consider a tandem system of two sequentially connected servers without an intermediate buffer. In this system the blocking phenomenon occurs at the first server when a customer finishes the service a the first server but sees the second server busy. Customers that cannot enter the first server because the server is busy or blocked join the orbit and retry to enter the first server according to a constant retrial rate policy. Furthermore, [10] presents an approximate analysis for a tandem queue with a common orbit and constant retrial rate.
As a closely related paper, Phung-Duc [11] obtained an explicit solution for a simple model where only blocked customers the first server joins the orbit while blocked customers at the second server are lost. In this line, [12] presented a matrix-analytic solution for a model with Batch Markovian Arrival Process (BMAP) and general service time distribution at the first server and customers from the first server are lost if the second server is busy.
Furthermore, in our recent papers, we obtained the approximation of the stationary probability distribution of the number of calls in the orbit by methods of asymptotic analysis [13] and asymptotic diffusion analysis [14] for a special case with exponential distributions for service times in both servers. Further related papers can be found in [15, 16]. In [16] a fixed point approximation is proposed for a tandem retrial queue. Pourbabai [15] investigates the tandem behavior in telecommunication systems with finite buffer and with repeated calls of constant retrial time. In [15], an approximation method is proposed.
In this paper, we study the two-phase tandem retrial queue system with one orbit and arbitrary service time distribution at the first server by the method of asymptotic diffusion analysis under the condition when the delay of calls in the orbit is extremely large. To the best of our knowledge, this is the first work dealing with a tandem retrial queue with classical (linear) retrial rate and arbitrary service time distribution at the first server, where blocked customers at the first or the second server enters orbit.
The remaining parts of the paper are organized as follows. In Sect. 2, we present the description of the model in detail. In Sect. 3, we write down the set of Kolmogorov differential equations while Sects. 4 and 5 show to the first order analysis (fluid limit) and the second order analysis (diffusion limit). Section 6 shows the use of the diffusion limit to approximate queue-length distribution in the orbit in the steady-state. Section 7 demonstrates some numerical examples.
2 Analytical Model
We consider a tandem retrial queue with two sequentially connected servers where customers arrive at the server according to a Poisson process with rate \(\lambda \) (see the Fig. 1). In this paper, customers and calls are interchangeably used. If the server is idle upon the arrival of a call, the call occupies it immediately for a random time with the distribution function B(x) and then moves to the second server. In the case that the second server is free, the call occupies it for a random time exponentially distributed with mean \(1/\mu \). On the other hand, if the first server is busy upon arrival of a customer, this customer immediately goes to the orbit staying there for a period of time which is exponentially distributed with parameter \(\sigma \) and then tries to enter the first server again. Upon the service completion at the first server, if the second server is busy, the call immediately goes to the same orbit, staying there for a random period of time which is exponentially distributed mean \(1/\sigma \) and trying to enter the first server for service again. This process is repeated until the call successfully receives services from both servers and leave the system.
We define the following notations for further analysis.
The process \(\textit{k}(\textit{t})\) - the state of servers at time \(\textit{t}\): 0, if both servers are free; 1, if the first server is busy and the second one is free; 2, if the first server is free and the second one is busy; 3, if both servers are busy;
The process z(t) - the remainder of service at the first server at time t;
The process \(\textit{i}(\textit{t})\) - number of retrial customers in the orbit at time \(\textit{t}\).
The purpose of the study is twofold: 1) to obtain the fluid and diffusion limit of \(\textit{i}(\textit{t})\) and 2) based on the diffusion limit, to build an approximation to the steady-state distribution of \(\textit{i}(\textit{t})\).
3 Kolmogorov Backward Equations
We define probabilities
The process \(\{k(t), i(t)\}\), \(k = 0, 2\), \(\{k(t), i(t), z(t)\}\), \(k= 1, 3\) is a Markov chain. Kolmogorov backward equations for (1) are given as follows.
We define partial characteristic functions, using \(\textit{j}=\sqrt{-1}\)
We rewrite (2) using \(H_k(u,t), k=0,2, H_k(u,z,t), k=1,3\) and add all the resulted equations with \(z \rightarrow \infty \). We obtain following equations for further research in next sections.
We are going to solve (4) under \(\sigma \rightarrow 0\).
4 Fluid Limit
By denoting \(\sigma = \varepsilon \) and performing substitution in (4)
we obtain
which we will solve under the assumption that functions \(F_k(w, \tau , \varepsilon )\), \(F_k(w, z, \tau , \varepsilon )\) and their derivatives have limits as \(\varepsilon \rightarrow 0\).
Theorem 1
We have
where \(x=x(\tau )\) satisfies
and where \(b_1=\int _0^\infty xdB(x)\) and \(B^*(\mu )=\int _0^\infty e^{-\mu x}dB(x)\).
Proof
We take the limit \(\varepsilon \rightarrow 0\) in (6)
We assume that (9) has a solution in the form
where \(x = x(\tau )\) expresses \(\lim _{\sigma \rightarrow 0} \sigma i(\tau /\sigma )\). Substituting (10) into (9), we obtain
Summing up the first equation with the third, the second equation with the fourth of (11), we have
We denote
Then from (13) we obtain
Letting \(z \rightarrow \infty \) and denoting \(r_k(\infty ,x)=r_k(x)\), \(k=1,3\), we have
where \(b_1=\int _0^\infty xdB(x)\). Because \(r_0(x)+r_1(x)+r_2(x)+r_3(x)=1\), from the last equality we obtain
Taking into account the first equation of (11), we write
We write the solution of the fourth differential equation of system (11) in the form
Let us send \(z \rightarrow \infty \) in this equation to have
The integrand satisfies the condition
where \(B^*(\mu )=\int _0^\infty e^{-\mu x}dB(x)\). Solution (14), taking into account (15), we rewrite under \(z \rightarrow \infty \) in the form
We obtain equations for the stationary probability distribution \(r_k(x)\), \(k=\overline{0,3}\) of the states of servers
Let us substitute \(r_k(x)\) into (12) in order to obtain
which coincides with (8).
Since \(x(\tau )\) represents the asymptotic value (\(\varepsilon \rightarrow 0\)) of \( \sigma i(\tau /\sigma )\), (7) holds. So, Theorem 1 is proved.
Let us denote
a(x) plays an important role for our analysis. First, as it is shown in Theorem 1, a(x) represents the dynamic of \(x(\tau )\), which is the limit under \(\sigma \rightarrow 0\) for \(\sigma i(\tau /\sigma )\). Second, as it will be shown, a(x) expresses the drift coefficient for the diffusion process that represents a scaled version of i(t).
5 Diffusion Limit
We carry out the following substitution in (4)
For \(H_k^{(1)}(u,t)\) and \(H_k^{(1)}(u,z,t)\), \(k=\overline{0,3}\), considering (18), we obtain
Because \(H^{(1)}(u,t)\) is the characteristic function of \(i(t)-\frac{1}{\sigma }x(\sigma t)\), we make the substitutions as follows.
By defining \(\sigma = \varepsilon ^2\) in (20) and substituting
we obtain
which we will solve under the assumption that \(F_k^{(1)}(w, \tau , \varepsilon )\), \(F_k^{(1)}(w, z, \tau , \varepsilon )\) and their derivatives have limits as \(\varepsilon \rightarrow 0\).
Theorem 2
\(F^{(1)}_k(w,\tau )\) is given by
where \(\varPhi (w,\tau )\) satisfies
and \(r_k(x)\) is defined in (16). a(x) is defined by (18) and b(x) is given by
where
and \(g_k(x)\), \(k=\overline{0,3}\) are defined by
and where \(b_2= \int _0^\infty x^2dB(x)\).
Proof
The methodology of the proof is similar to that used in paper [14] before.
As it will be shown a(x) in (18) and b(x) in (25) are coefficients of a diffusion process. Later we will show their role in the approximation of the stationary distribution of i(t).
Remark 1
The results in Theorem 2 show that in the heavy traffic regime (\(\sigma \rightarrow 0\)) i(t) and the state of the servers are independent as their joint characteristic function is decomposed as a product of the orbit part and the server part.
6 Approximation of the Stationary Distribution Based on Diffusion Limit
In this section, we apply the diffusion limit to find the probability distribution of i(t) under \(\sigma \rightarrow 0\) in our system. This general method is also used other related work e.g. [14].
Lemma 1
Under \(\sigma \rightarrow 0\)
is the solution of
We consider
where \(\varepsilon =\sqrt{\sigma }\) as before.
Lemma 2
The process \(l(\tau )\) is the solution of
up to an infinitesimal of order \(\epsilon ^{2}\).
Under the steady-state regime, we consider \(l(\tau )\)
Theorem 3
The density s(l) of \(l(\tau )\) is given by
where C is some constant that satisfies the normalization condition.
7 Numerical Examples
Let us consider G(i) in the form
and define P(i) as
We use P(i) to approximate \(P\{i(t) = i\}\).
We consider a particular case of B(x) as a Gamma distribution with parameters of shape \(\alpha =2\) and of scale \(\beta =2\). We consider \(\lambda =0.5\) and \(\mu =1\).
Figure 2 presents the approximation of the probability distribution of the i(t) with different values of calls’ delay time in the orbit: P1 - the approximation with \(\sigma =0.5\), P2 - the approximation with \(\sigma =0.3\), P3 - the approximation with \(\sigma =0.1\).
This figure shows the feasibility of our proposed approach.
8 Conclusion
In this paper, we have investigated the tandem retrial queue with two connected servers and without intermediate buffer. The first server provides services for calls for an arbitrary random time, while the second does for an exponentially distributed random time. Under the condition that \(\sigma \rightarrow 0\), we have obtained diffusion limit of a scaled version of i(t). The stationary probability density distribution of this diffusion process is used to approximate the stationary distribution of i(t).
In further research, we plan to compare our approximate results with simulation
References
Falin, G., Templeton, J.G.: Retrial Queues, vol. 75. CRC Press, Boca Raton (1997)
Artalejo, J.R., Gómez-Corral, A.: Retrial Queueing Systems. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78725-9
Yang, T., Templeton, J.: A survey on retrial queues. Queueing Syst. 2, 203–233 (1987)
Falin, G.: A survey of retrial queues. Queueing Syst. 7, 127–168 (1987)
Phung-Duc, T.: Retrial queueing models: a survey on theory and applications. In: Stochastic Operations Research in Business and Industry. Springer (2007)
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. Methodol. Comput. Appl. Probab. 24, 1–48 (2021)
Vishnevsky, V.M., Larionov, A.A., Semyonova, O.V.: Evaluating the performance of a high-speed wireless tandem network using centimeter and millimeter-wave radio channels in road safety management systems. Manage. Probl. (4) (2013)
Kuznetsov, N.A., Myasnikov, D.V., Semenikhin, K.V.: Optimal control of data transmission in a mobile two-agent robotic system. J. Commun. Technol. Electron. 61(12), 1456–1465 (2016). https://doi.org/10.1134/S1064226916120159
Moutzoukis, E., Langaris, C.: Two queues in tandem with retrial customers. Probab. Eng. Inf. Sci. 15(3), 311–325 (2001)
Avrachenkov, K., Yechiali, U.: On tandem blocking queues with a common retrial queue. Comput. Oper. Res. 37(7), 1174–1180 (2010)
Phung-Duc, T.: An explicit solution for a tandem queue with retrials and losses. Oper. Res. Int. J. 12(2), 189–207 (2012)
Kim, C.S., Park, S.H., Dudin, A., Klimenok, V., Tsarenkov, G.: Investigation of the bmap/g/1\(\rightarrow \cdot \)/ph/1/m tandem queue with retrials and losses. Appl. Math. Model. 34(10), 2926–2940 (2010)
Nazarov, A., Paul, S., Phung-Duc, T., Morozova, M.: Scaling limits of a tandem retrial queue with common orbit and poisson arrival process. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2021. LNCS, vol. 13144, pp. 240–250. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-92507-9_20
Nazarov, A., Paul, S., Phung-Duc, T., Morozova, M.: Analysis of tandem retrial queue with common orbit and poisson arrival process. In: Ballarini, P., Castel, H., Dimitriou, I., Iacono, M., Phung-Duc, T., Walraevens, J. (eds.) EPEW/ASMTA -2021. LNCS, vol. 13104, pp. 441–456. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91825-5_27
Pourbabai, B.: Tandem behavior of a telecommunication system with finite buffers and repeated calls. Queueing Syst. 6, 89–108 (1990)
Takahara, G.: Fixed point approximations for retrial networks. Probab. Eng. Inf. Sci. 10, 243–259 (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Paul, S., Nazarov, A., Phung-Duc, T., Morozova, M. (2022). Mathematical Model of the Tandem Retrial Queue M | GI | 1 | M | 1 with a Common Orbit. In: Dudin, A., Nazarov, A., Moiseev, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM 2021. Communications in Computer and Information Science, vol 1605. Springer, Cham. https://doi.org/10.1007/978-3-031-09331-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-031-09331-9_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-09330-2
Online ISBN: 978-3-031-09331-9
eBook Packages: Computer ScienceComputer Science (R0)