Abstract
We study a queueing system with Erlang arrivals with k phases and Erlang service with m phases. Transition rates among phases vary periodically with time. For these systems, we derive an analytic solution for the asymptotic periodic distribution of the level and phase as a function of time within the period. The asymptotic periodic distribution is analogous to a steady-state distribution for a system with constant rates. If the time within the period is considered part of the state, then it is a steady-state distribution. We also obtain waiting time and busy period distributions. These solutions are expressed as infinite series. We provide bounds for the error of the estimate obtained by truncating the series. Examples are provided comparing the solution of the system of ordinary differential equation with a truncated state space to these asymptotic solutions involving remarkably few terms of the infinite series. The method can be generalized to other level independent quasi-birth-death processes if the singularities of the generating function are known.
Similar content being viewed by others
Code Availability
Not applicable.
References
Adan, I., Zhao, Y.: Analyzing \(GI/E_r/1\) queues. Oper. Res. Lett. 19(4), 183–190 (1996). https://doi.org/10.1016/0167-6377(96)00024-7
Arizono, I., Ohta, H., Deutsch, S., Wang, C.C.: An analysis of the \(E_l/E_k/1\) queueing system by restricted minimal lattice paths. J. Oper. Res. Soc. 46(2), 245–253 (1995). https://doi.org/10.1057/jors.1995.29
Baek, J., Moon, S., Lee, H.: A time-dependent busy period queue length formula for the \(M/E_k/1\) queue. Statist. Probab. Lett. 87, 98–104 (2014). https://doi.org/10.1016/j.spl.2014.01.004
Breuer, L.: The periodic \(BMAP/PH/c\) queue. Queueing Syst. 38, 67–76 (2001). https://doi.org/10.1023/A:1010872128919
Dollard, J., Friedman, C.: Product Integration with Applications to Differential Equations (with an appendix by P.R. Masani), Encyclopedia of Mathematics and its Applications, vol. 10. Addison-Wesley (1979)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009). https://doi.org/10.1017/CBO9780511801655
Foh, C.H., Zukerman, M.: A new technique for performance evaluation of random access protocols. In: Proceedings of the 2002 IEEE International Conference on Communications, vol. 3, pp. 2284–2288 (2002). https://doi.org/10.1109/ICC.2002.997253
Gayon, J.P., de Véricourt, F., Karaesmen, F.: Stock rationing in an m/e r /1 multi-class make-to-stock queue with backorders. IIE Trans. 41(12), 1096–1109 (2009). https://doi.org/10.1080/07408170902800279
Gill, R., Johansen, S.: A survey of product-integration with a view toward application in survival analysis. Ann. Stat. 18(4), 1501–1555 (1990)
Grafakos, L.: Classical Fourier Analysis. Springer (2014). https://doi.org/10.1007/978-1-4939-1194-3
Grassmann, W.K.: A new method for finding the characteristic roots of \(E_n/E_m/1\) queues. Methodol. Comput. Appl. Probab. 13, 873–886 (2011). https://doi.org/10.1007/s11009-010-9199-2
Griffiths, J., Leonenko, G., Williams, J.: The transient solution to \(M/E_k/1\) queue. Oper. Res. Lett. 34, 349–354 (2006). https://doi.org/10.1016/J.ORL.2005.05.010
Horváth, I., Mészáros, A., Telek, M.: Numerical inverse transformation methods for z-transform. Mathematics (2020). https://doi.org/10.3390/math8040556
Jayasuriya, A., Green, D., Asenstorfer, J.: Modelling service time distribution in cellular networks using phase-type service distributions. In: Proceedings of the 2001 IEEE International Conference on Communications, vol. 2, pp. 440–444. ICC2001 (2001)
Kleinrock, L.: Queueing Systems: Theory, vol. I. Wiley (1975)
Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modelling, 1st edition. ASA SIAM (1999). https://doi.org/10.1137/1.9780898719734
Laub, A.J.: Matrix Analysis for Scientists and Engineers. Society for Industrial and Applied Mathematics, Philadelphia (2005). https://doi.org/10.5555/1062366
Leonenko, G.: A new formula for the transient solution of the erlang queueing model. Stat. Probab. Lett. 79(3), 400–406 (2009). https://doi.org/10.1016/j.spl.2008.09.014
Luh, H., Liu, H.Y.: A note on simple eigenvalues of matrix polynomials in queueing models with Erlang distributions. J. Appl. Math. Comput. 21, 57–67 (2006). https://doi.org/10.1007/BF02896388
Margolius, B.: Asymptotic Estimates for Queueing Systems with Time-Varying Periodic Transition Rates, pp. 307–326. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-11102-1_14
Margolius, B.H.: Eulerian polynomials and quasi-birth-death processes with time-varying-periodic rates. In: Contemporary Mathematics, vol. 774, pp. 175–193. American Mathematical Society (2021)
Maritas, D., Xirokostas, D.: The \(M/E_k/1\) machine interference model steady state equations and numerical solutions. Eur. J. Oper. Res. 1(2), 112–123 (1977). https://doi.org/10.1016/0377-2217(77)90077-7
Medhi, J.: Stochastic Models in Queueing Theory, 2nd edn. Academic Press (2003). https://doi.org/10.1016/B978-0-12-487462-6.X5000-0
Parthasarathy, P.: A transient solution to an \(M/M/1\) queue: a simple approach. Adv. Appl. Probab. 19, 997–998 (1987). https://doi.org/10.2307/1427113
Pazy, A.: Semigroups of Linear Operators and Applications to Partial Differential Equations. Springer (1983)
Poyntz, C., Jackson, R.: The steady-state solution for the queueing process \(E_k/E_m/r\). Oper. Res. Q. 24(4), 615–625 (1973). https://doi.org/10.1017/S0305004100028620
Saaty, T.L.: Elements of Queueing Theory with Applications. McGraw-Hill Book Company, Inc. (1961)
Schwarz, J.A., Selinka, G., Stolletz, R.: Performance analysis of time-dependent queueing systems: survey and classification. Omega 63, 170–189 (2016). https://doi.org/10.1016/j.omega.2015.10.013
Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms: Introdu Analysi Algorithms. Addison-Wesley (2013)
Smith, W.L.: On the distribution of queueing times. Math. Proc. Cambridge Philos. Soc. 49(3), 449–461 (1953). https://doi.org/10.1017/S0305004100028620
Syski, R.: Introduction to Congestion Theory in Telephone Systems. Oliver and Boyd Ltd (1960)
Takács, L.: Transient behavior of queueing processes with Erlang input. Trans. Am. Math. Soc. 100(1), 1–28 (1961). https://doi.org/10.1090/S0002-9947-1961-0181024-9
Truslove, A.: Length for the \(E_k/G/1\) queue with finite waiting room. Adv. Appl. Probab. 7, 215–226 (1975). https://doi.org/10.2307/1425861
Wang, K.H., Kuo, M.Y.: Profit analysis of the \(M/E_r/1\) machine repair problem with a non-reliable service station. Comput. Ind. Eng. 32(3), 587–594 (1997). https://doi.org/10.1016/S0360-8352(96)00313-0
Wegert, E.: Complex Function Explorer. https://www.mathworks.com/matlabcentral/fileexchange/45464-complex-function-explorer (2021)
Weisstein, E.W.: Kronecker Product. From Mathworld—A Wolfram Web Resource. https://mathworld.wolfram.com/KroneckerProduct.html (2021)
Weisstein, E.W.: Kronecker Sum. From Mathworld—A Wolfram Web Resource. https://mathworld.wolfram.com/KroneckerSum.html (2021)
Whitt, W.: Time-varying queues. Queue. Models Service Manag. 1(2), 79–164 (2018)
Wilf, H.: Generating Functionology. https://www2.math.upenn.edu/~wilf/DownldGF.html (2004)
Acknowledgements
The author would like to thank two anonymous referees and the editor of this journal for helpful comments and suggestions.
Funding
Not applicable.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflicts of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary Information
Below is the link to the electronic supplementary material.
Appendix: Evolution operators
Appendix: Evolution operators
A Banach space is a complete normed vector space.
Let X be a Banach space. For every t. \(0\le t\le T\) let \(A(t):D(A(t))\subset X\rightarrow X\) be a linear operator in X. Consider the initial value problem
A X valued function \(u:[s,T]\rightarrow X\) is a classical solution of (58) if u is a continuous function on [s, T], \(u(t)\in D(A(t))\), for \(s<t\le T\), u is continuously differentiable on \(s<t\le T\) and satisfies (58).
Theorem 4
(Pazy) [25] Let X be a Banach space for every t, \(0\le t\le T\). Let A(t) be a bounded linear operator on X. If the function \(t\rightarrow A(t)\) is continuous in the uniform operator topology then for every \(x\in X\) the initial value problem (58) has a unique classical solution u.
Definition 3
We define the evolution operator of the initial value Problem (58) by \(xU(t,s)=u(t)\) for \(0\le s \le t\le T\) where u is the solution of (58).
The evolution operator is also called a solution operator or propagator in the literature. If we meet the conditions in theorem 4, then our evolution operator has the following properties:
Theorem 5
(Evolution operator properties) [25] For every \(0\le s\le t\le T\), U(t, s) is a bounded linear operator and
-
1.
\(||U(t,s)||\le \exp \left\{ \int _s^t A(\tau )d\tau \right\} \).
-
2.
\(U(t,t)=I\), \(U(t,s)=U(t,r)U(r,s)\) for \(0\le s\le r\le t\le T\).
-
3.
\((t,s)\rightarrow U(t,s)\) is continuous in the uniform operator topology for \(0\le s\le t\le T\).
-
4.
\(\frac{\partial U(t,s)}{\partial t}=U(t,s)A(t)\) for \(0\le s\le t\le T\).
-
5.
\(\frac{\partial U(t,s)}{\partial s}=-A(s)U(t,s)\) for \(0\le s\le t\le T\).
Definition 4
A two parameter family of bounded linear operators U(t, s), \(0\le s\le t\le T\), on X is called an evolution system if the following two conditions are met:
-
1.
\(U(s,s)=I\), \(U(t,r)U(r,s)=U(t,s)\) for \(0\le s\le r\le t\le T\).
-
2.
\((t,s)\rightarrow U(t,s)\) is strongly continuous for \(0\le s\le t\le T\).
In this paper, we observe evolution operators in one of two contexts: 1) the u(t) are probability vectors, x is the probability distribution at some initial time s, and \(\mathbf{A}(t)\) is an infinite-dimensional matrix with bounded non-negative entries; or 2) u(z, t) are vectors of probability generating functions and A(z, t) are finite dimensional matrices with parameter z defined in Eq. (19).
The evolution operator is a generalization of the exponential function. If x and A are scalars, U(t, s) is a scalar exponential function. If x is a vector and \(A(t)=A\) an appropriately dimensioned matrix, then U(t, s) is the matrix exponential \(\mathrm{e}^{A(t-s)}\). The matrix exponential may be defined in terms of its Taylor series expansion:
When A(t) depends on time, we have the Peano series representation for U(t, s). Define
with \(\mathcal {I}_0=I\), then:
In the event that \(A(t)=A\) is a constant matrix, the Peano series given in Eq. (60) yields the matrix exponential \(\mathrm{e}^{A(t-s)}\).
U(t, s) solves the Volterra equation
If the matrix A(t) is finite, then U(t, s) is given by the product integral
This product integral is sometimes called the time-ordered exponential from s to t, or the multiplicative integral. See Dollard and Friedman [5] or Gill and Johansen [9].
There are several examples in the body of the paper.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Margolius, B.H. The periodic steady-state solution for queues with Erlang arrivals and service and time-varying periodic transition rates. Queueing Syst 103, 45–94 (2023). https://doi.org/10.1007/s11134-022-09851-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-022-09851-x