Abstract
We investigate the stability condition of a multiserver queueing system. Each customer needs simultaneously a random number of servers to complete the service. The times taken by each server are independent. The input flow is assumed to be a regenerative one. The service time has an exponential, phase-type or hyper-exponential distribution. The stability criteria for the models are established. It turns out that the stability conditions do not depend on the structure of the input flow, but only on the rate of the process. However, the distribution of the service times is a very important factor. We give examples which show that the stability condition cannot be expressed only in terms of the mean of the service time.
Similar content being viewed by others
References
Afanasyeva, L.: Stability conditions for retrial queueing systems with regenerative input flow. Fundam. Appl. Math. Moscow State Univ. 22(3), 1–17 (2018)
Afanasyeva, L.G., Bashtova, E.E.: Coupling method for asymptotic analysis of queues with regenerative input and unreliable server. Queueing Syst. 76(2), 125–147 (2014)
Afanaseva L.G., Bulinskaya E.V.: Stochastic processes in queueing theory and inventory theory. MSU (1980) (in Russian)
Afanasyeva, L., Tkachenko, A.: Multichannel queueing systems with regenerative input flow. Theory Probab. Appl. 58(2), 174–192 (2014)
Afanasyeva, L., Tkachenko, A.: Stability conditions for queueing systems with regenerative flow of interruptions. Theory Probab. Appl. 63(4), 2–37 (2018)
Arthurs E., Kaufman J.: Sizing a message store subject to blocking criteria. In: Proceedings of the Third International Symposium on Modeling and Performance Evaluation of Computer Systems: Performance of Computer Systems, pp. 547–564. North-Holland Publishing Co, Amsterdam (1979)
Asmussen, S.: Applied Probability and Queues, vol. 51. Springer-Verlag, Berlin (2003)
Belorusov, T.: Ergodicity of a multichannel queueing system with balking. Theory Probab. Appl. 56(1), 120–126 (2012)
Borovkov, A.A.: Stochastic Processes in Queueing Theory, vol. 4. Springer, Berlin (1976)
Chaiken J.: The number of emergency units busy at alarms which require multiple servers. R-531-NYC/HUD. The Rand Corporation, Santa Monica. CA (1971)
Chelst, K.R., Barlach, Z.: Multiple unit dispatches in emergency services. Manag. Sci. 27, 1390–1409 (1981)
Chen, H.: Fluid approximation and stability of multiclass queueing networks: work-conserving disciplines. Ann. Appl. Probab. 5, 637–665 (1995)
Chen, H., Yao, D.: Fundamentals of Queueing Networks. Springer, Berlin (2001)
Dai, J.: On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Probab. 5, 49–77 (1995)
Dai, J.: A fluid-limit model criterion for instability of multiclass queueing networks. Ann. Appl. Probab. 6, 751–757 (1996)
Feller, W.: An Introduction to Probability Theory and Its Applications, vol. II. Wiley, New York (1966)
Federgruen, A., Green, L.: An \(M|G|c\) queue in which the number of servers required is random. J. Appl. Probab. 21, 3, 583 (1984)
Foss, S., Chernova, N.: On the stability of a partially accessible multi-station queue with state-depending routing. Queueing Syst. 29, 55–73 (1998)
Foss, S., Konstantopoulos, T.: An overview on some stochastic stability methods. J. Oper. Res. Soc. Jpn. 47(4), 275–303 (2004)
Gillent, L., Latouche, G.: Semi-explicit solutions for \(M|PH|1\)-like queueing systems. Eur. J. Oper. Res. 13(2), 151–160 (1983)
Grandell, J.: Doubly Stochastic Poisson Process. Lecture Notes in Mathematics, vol. 529. Springer, Berlin (1976)
Green, L.: Comparing operating characteristics of queues in which customers require a random number of servers. Manag. Sci. 27(1), 65–74 (1980)
Green, L.: Comparing operating characteristics of queues in which customers require a random number of servers. Oper. Res. 28(6), 1335–1346 (1980)
Green, L.: A limit theorem on subintervals on interrenewal times. Oper. Res. 30, 210–215 (1982)
Grishunina, S.: Multiserver queueing system with constant service time and simultaneous service of a customer by a random number of servers. Theory Probab. Appl. 64(3), 456–460 (2018)
Ittimakin, P., Kao, E.P.C.: Stationary waiting time distribution of a queue in which customers require a random number of servers. Oper. Res. 39(4), 633–638 (1991)
Morozov, E., Fiems, D., Bruneel, H.: Stability analysis of multiserver discrete-time queueing systems with renewal-type server interruptions. Perform. Eval. 68(12), 1261–1275 (2011)
Morozov, E., Rumyantsev, A.: Stability analysis of a \(MAP|M|s\) cluster model by matrix-analytic method. In: European Workshop on Performance Engineering, pp. 63–76 (2016)
Neuts, M.F.: Renewal processes of phase-type. Naval Res. Logist. Quart. 25, 445–454 (1978)
Omahen, K.J.: Capacity bounds for multiresource queues. J. ACM (J. Assoc. Comput. Mach.) 24, 646–663 (1977)
Schaack, G., Larson, R.C.: An \(N\) server cutoff priority queue where arriving customers request a random number of servers. Manag. Sci. 35(5), 614–634 (1989)
Seila, A.F.: On waiting times for a queue in which customers require simultaneous service from a random number of servers. Oper. Res. 32(5), 614–639 (1984)
Smith, W.L.: Regenerative stochastic process. Proc. R. Soc. 232, 6–31 (1955)
Thorisson, H.: Coupling: Stationary and Regeneration. Springer, New York (2000)
Van Dyk, N.M.: Blocking of finite inputs which require simultaneous servers with general think and holding times. Oper. Res. Lett. 8(1), 45–52 (1989)
Acknowledgements
Work is partially supported by Russian Foundation for Basic Research Grant 17-01-00468. Authors would like to thank both reviewers for the careful reading of the paper and the useful comments, which led to improvement of the work.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix
Proof of Lemma 1
We begin with the first statement. Let \({\mathcal {J}}=\bigcup \limits _{l=0}^\infty [\theta _l, \theta _l+v_{l})\) so that \(T_1=\min \{s_k>0:s_k\in {\mathcal {J}}\}\). Define the sequence \(\{e_n\}_{n=0}^\infty \) (\(e_0=0\)) letting \(e_n=0\) if \(s_n\in {\mathcal {J}}\) and \(e_n=1\) otherwise. Taking into account the memoryless property of the exponential distribution, the strongly regenerative structure of X and the assumption that \(\{\gamma _n\}_{n=1}^\infty \) is a sequence of iid random variables, one may easily notice that \(\{e_n\}_{n=1}^\infty \) (\(e_0=0\)) is a discrete-time regenerative process (see Ch.10, Sec. 3.5 in [34]). Points of the regeneration of this process are determined by the recursion
Define the events
and let \(P_n={\mathsf {P}}(B_n)\), \(f_n={\mathsf {P}}(A_n)\), \(n=1,2,\ldots \). Then
Since \(A_j\bigcap A_k=\emptyset \) if \(j\ne k\) and \(B_n=\bigcup \limits _{j=1}^n A_j\bigcap B_n\) we have
Taking into account that the moment of arrival to the state zero is a point of regeneration of \(\{e_n\}_{n=1}^\infty \), one may easily get
Therefore, the recursion relations
hold. Then, for the generating functions \(F(z)=\sum \nolimits _{n=1}^\infty z^n f_n\) and \(P(z)=\sum \nolimits _{n=1}^\infty z^n P_n\), the following equality is valid:
and hence
Since
then \({\mathsf {P}}(T_1<\infty )=1\) if and only if
Now we estimate \(P_n={\mathsf {P}}(s_n\in {\mathcal {J}})\) as \(n\rightarrow \infty \). To do this, we define for any (non-random) \(t\geqslant 0\) the function
where \(H(y)=\sum \limits _{l=0}^\infty {\mathsf {P}}(\theta _l\leqslant y)\) is a renewal function for the renewal process \(\{\theta _l\}_{l=0}^\infty \). From the key renewal Theorem (Ch. 3, Par. 6, Th. 10 in [3] and Ch. 10 in [34]), it follows that there exists
Since \(s_n\uparrow \infty \) w.p.1 as \(n\rightarrow \infty \) and \(\{s_k\}_{k=1}^\infty \) and \(\{\theta _n,v_n\}_{n=1}^\infty \) are independent sequences, one may easily prove from (30) the convergence
This means that (29) is fulfilled, and therefore, the first statement is valid. The second statement follows from the fact that \(\nu _1=\min \{k:s_k\in {\mathcal {J}}\}\) is a Markov moment with respect to the filtration \(\{\sigma (\gamma _n,\gamma _{n+1},\ldots )\}_{n=1}^\infty \) (see [3, 9]).
Now we move to the third statement. Because of Remark 1, the strongly regenerative flow X is defined by the sequence \(X_j=(x_j(t),t\in (0,v_j+u_j),v_j,u_j)\, (j=0,1,\ldots )\) of independent random elements with the help of (1). Consider the stochastic flow \(X_{T_1}(t)=X(T_1+t)-X(T_1),t\geqslant 0\). First, we define the random elements \(\{{\tilde{X}}_j\}_{j=0}^\infty \) which determine this process by formula (1). Let \(T_1=s_\nu \) and \(\zeta \) be the number of the regeneration period of X such that \(s_\nu \in [\theta _\zeta ,\theta _\zeta +v_\zeta )\), so that
and
Then
Here \(\{{\tilde{x}}_0(t),t\in (0,{\tilde{v}}_0)\}\) is a Poisson process with rate \(\delta \) not depending on the random element \(X_\zeta \) and \({\tilde{x}}_0(t)=x_\zeta (t)-x_\zeta (v_\zeta )+{\tilde{x}}_0({\tilde{v}}_0)\) for \(t\in ({\tilde{v}}_0,{\tilde{v}}_0+u_\zeta )\). Because of the properties of the exponential distribution (memoryless property), the Poisson process (independence of the increments) and the strongly regenerative process (properties 1 and 2), we see that \({\tilde{X}}_0\) and \(X_0\) have the same distribution. The random element \({\tilde{X}}_j\) for \(j>0\) is given by the formula
Since \(\zeta \) is a Markov moment with respect to the filtration \(\{\sigma (\theta _n,\theta _{n+1},\ldots )\}_{n=1}^\infty \) we get the equality in distribution
This means that the distributions of the processes \(\{X(t),t\geqslant 0\}\) and \(\{X_{T_1}(t),t\geqslant 0\}\) are the same.
Now we will prove the independence of \(\{X(t),t\leqslant T_1\}\) and \(\{X_{T_1}(t),t \geqslant 0\}\). Let us note that the first process is defined by the collection of random elements
and the second one by the collection
Therefore the independence of these processes follows from the independence of the collections \(C_1\) and \(C_2\), which is almost evident.
Now assume that \({\mathsf {E}}\gamma _1<\infty \). Since \(T_1=s_\zeta =\gamma _1+\ldots +\gamma _{\nu _1}\) according to Wald’s identity, we have to prove the finiteness of \({\mathsf {E}}\nu _1\). To do this, define the sequence \(\{\nu _n\}_{n=1}^\infty \) by the recursion formula
Because of the statements 2 and 3 of the Lemma, the sequence \(\{\nu _n-\nu _{n-1}\}_{n=1}^\infty \) consists of iid integer-valued random variables. Therefore, it follows from Blackwell’s Theorem (see Part 1, Par.6, Th.5 in [3], Ch.10, sec.3 in [34]) that there exists the limit
and \(a=({\mathsf {E}}\nu _1)^{-1}\) if \({\mathsf {E}}\nu _1<\infty ,a=0\) if \({\mathsf {E}}\nu _1=\infty \) (Ch.10, par 3.6 in [34]). Since
according to (31) we have \({\mathsf {E}}\nu _1=\alpha {\mathsf {E}}\theta _1\) and therefore \({\mathsf {E}}T_1=\alpha {\mathsf {E}}\gamma _1{\mathsf {E}}\theta _1<\infty \). \(\square \)
Proof of Lemma 3
Here we give only the proof of (14) for the system \(S_1^0\) since the proofs of (13) for \(S_1^0\) and (13) and (14) for the systems \(S_2^0\) and \(S_3^0\) are the same.
Let q(t) be the number of occupied servers in \(S_1^0\) at time t. Denote by \(S^{(j_0)}\) the system \(S_1^0\) under the assumption that the initial state \(q(0)=j_0\) and \(S^{(k)}\) the system \(S_1^0\) if \(q(0)=k,\,k>j_0\). Define the processes \(Z^{(j_0)}(t)\) and \(Z^{(k)}(t)\) as the number of the service completions up to time t in the systems \(S^{(j_0)}\) and \(S^{(k)}\), respectively. We organize the performance of \(S^{(j_0)}\) and \(S^{(k)}\) on one probability space in such a way that
w.p.1 for any \(t\geqslant 0\). Then (14) is a simple corollary of (32).
Let \(\eta _1^{(j_0)}\) and \(\eta ^{(k)}\) be the moments of the first service completion in the systems \(S^{(j_0)}\) and \(S^{(k)}\), respectively.
These random variables have an exponential distribution with rates \(j_0\mu \) and \(k\mu \), respectively. Let \(\{\delta _n\}_{n=1}^\infty \) be a sequence of iid random variables with uniform distribution on [0, 1]. We take
Then \(\eta _1^{j_0}<\eta ^{k}\) w.p.1 and the process \(Z^{(k)}\) has the first jump at time \(\eta ^{k}\) but \(Z^{(j_0)}(t)=0\) for \(0\leqslant t\leqslant \eta ^{(k)}\). Let \({\tilde{\zeta }}_k\) be the number of servers which requires the first customer in the queue in the system \(S^{(k)}\) (at time \(t=0\)). Then \({\tilde{\zeta }}_k\) has values \(\{m-s+1, \text { where } j_0\leqslant s\leqslant k\}\). Firstly, assume that \({\tilde{\zeta }}_k=m-k+1\), i.e., \(s=k\). Then in the system \(S^{(k)}\) at time \(\eta ^{(k)}\) the number of busy servers \(q^{(k)}(\eta ^{(k)})=m\).
For the system \(S^{(j_0)}\), we consider the system \({\tilde{S}}^{(j_0)}\) with the dominating process \({\tilde{Z}}^{(j_0)}\) which has a unit jump at time \(\eta ^{(k)}\).
Then \({\tilde{q}}^{(j_0)}(\eta ^{(k)})=m,\) where \({\tilde{q}}^{(j_0)}\) is the number of occupied servers in the dominating system \({\tilde{S}}^{(j_0)}\). Later we assume that after the moment \(\eta ^{(k)}\) the systems \({\tilde{S}}^{(j_0)}\) and \(S^{(k)}\) have common sequences \(\{\zeta _n\}_{n=1}^\infty \) (the number of required servers) and \(\{\overrightarrow{\eta }_n\}_{n=1}^\infty \) (service times on various servers). Therefore \({\tilde{Z}}^{(j_0)}(t)=Z^{(k)}(t)\) w.p.1 for all \(t\geqslant 0\). Since \(Z^{(j_0)}(t)\leqslant {\tilde{Z}}^{(j_0)}(t)\) w.p.1, inequality (32) is proved.
Now assume that \({\tilde{\zeta }}_k>m-k+1\), i.e., \(s<k\). Based on the memoryless property of the exponential distribution, one may easily see that at time \(\eta ^{(k)}\) we have two systems \(S^{(j_0)}\) and \(S^{(k-1)}\) which were described earlier. We define \(\eta _2^{(j_0)}\) and \(\eta ^{(k-1)}\) with the help of formula (33), taking \(\eta _2^{(j_0)}\), \(\eta ^{(k-1)}\), \(\delta _2\) instead of \(\eta _1^{(j_0)}\), \(\eta ^{(k)}\), \(\delta _1\). If \(s=k-1\) we repeat the steps described for the case \(s=k\). If \(s<k-1\) the process \(Z^{(j_0)}\) equals zero on the time interval \((0, \eta ^{(k)}+\eta ^{(k-1)})\), while \(Z^{(k)}\) has two jumps at times \(\eta ^{(k)}\) and \(\eta ^{(k)}+\eta ^{(k-1)}\). In this case, we also define \(\eta _3^{(j_0)}\) and \(\eta ^{(k-2)}\) by means of formula (33) with \(\delta _3\) instead of \(\delta _2\) and so on. Finally, at some time \(t_0\) we obtain one of two cases:
- 1.
\(q^{(k)}(t_0)=m\) when \({\tilde{\zeta }}_k<m-j_0+1\);
- 2.
\(q^{(k)}(t_0)=j_0\) when \({\tilde{\zeta }}_k=m-j_0+1\).
Here \(q^{(k)}\) is the number of occupied servers in the system \(S^{(k)}\).
In the first case, we proceed in the same way as for the case \({\tilde{\zeta }}_k=m-k+1\)\((s=k)\). In the second case, the states of \(S^{(j_0)}\) and \(S^{(k)}\) are identical but \(Z^{(j_0)}(t_0)=0\), \(Z^{(k)}(t_0)=k-j_0\). Therefore, inequality (32) takes place w.p.1. This completes the proof of the lemma. \(\square \)
Conclusion
In this paper, a multiserver queueing system is considered. In the system, each customer requires a random number of servers simultaneously and service times at the occupied servers are independent random variables. The input flow is assumed to be a regenerative one and the service time has an exponential, phase-type or hyper-exponential distribution. By means of the synchronization method, we establish the stability criterion of such systems. The main contribution of this paper is an extension of the stability criterion to the model with a regenerative input flow. Note that the class of regenerative flows is broad and includes Markov arrival process, doubly stochastic Poisson process with a regenerative process as intensity, Markov modulated process, and others. It turns out that the stability condition depends only on the intensity of the input flow and the structure of this flow does not play any role.
The distribution of the service time plays an important role in the stability condition. We give which show that the stability condition cannot be expressed in terms of the mean of the service time.
Rights and permissions
About this article
Cite this article
Afanaseva, L.G., Grishunina, S.A. Stability conditions for a multiserver queueing system with a regenerative input flow and simultaneous service of a customer by a random number of servers. Queueing Syst 94, 213–241 (2020). https://doi.org/10.1007/s11134-020-09648-w
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-020-09648-w