IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v103y2023i1d10.1007_s11134-022-09851-x.html
   My bibliography  Save this article

The periodic steady-state solution for queues with Erlang arrivals and service and time-varying periodic transition rates

Author

Listed:
  • B. H. Margolius

    (Cleveland State University)

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.

Suggested Citation

  • B. H. Margolius, 2023. "The periodic steady-state solution for queues with Erlang arrivals and service and time-varying periodic transition rates," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 45-94, February.
    • Handle: RePEc:spr:queues:v:103:y:2023:i:1:d:10.1007_s11134-022-09851-x
    DOI: 10.1007/s11134-022-09851-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-022-09851-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-022-09851-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Illés Horváth & András Mészáros & Miklós Telek, 2020. "Numerical Inverse Transformation Methods for Z-Transform," Mathematics, MDPI, vol. 8(4), pages 1-18, April.
    2. Schwarz, Justus Arne & Selinka, Gregor & Stolletz, Raik, 2016. "Performance analysis of time-dependent queueing systems: Survey and classification," Omega, Elsevier, vol. 63(C), pages 170-189.
    3. Baek, Jung Woo & Moon, Seung Ki & Lee, Ho Woo, 2014. "A time-dependent busy period queue length formula for the M/Ek/1 queue," Statistics & Probability Letters, Elsevier, vol. 87(C), pages 98-104.
    4. Maritas, D. G. & Xirokostas, D. A., 1977. "The M/Ek/r machine interference model steady state equations and numerical solutions," European Journal of Operational Research, Elsevier, vol. 1(2), pages 112-123, March.
    5. Winfried K. Grassmann, 2011. "A New Method for Finding the Characteristic Roots of E n /E m /1 Queues," Methodology and Computing in Applied Probability, Springer, vol. 13(4), pages 873-886, December.
    6. Leonenko, G.M., 2009. "A new formula for the transient solution of the Erlang queueing model," Statistics & Probability Letters, Elsevier, vol. 79(3), pages 400-406, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiaoyuan Liu & Brian Fralix, 2019. "On Lattice Path Counting and the Random Product Representation, with Applications to the Er/M/1 Queue and the M/Er/1 Queue," Methodology and Computing in Applied Probability, Springer, vol. 21(4), pages 1119-1149, December.
    2. Pei, Zhi & Dai, Xu & Yuan, Yilun & Du, Rui & Liu, Changchun, 2021. "Managing price and fleet size for courier service with shared drones," Omega, Elsevier, vol. 104(C).
    3. Yacov Satin & Rostislav Razumchik & Ivan Kovalev & Alexander Zeifman, 2023. "Ergodicity and Related Bounds for One Particular Class of Markovian Time—Varying Queues with Heterogeneous Servers and Customer’s Impatience," Mathematics, MDPI, vol. 11(9), pages 1-15, April.
    4. Baek, Jung Woo & Moon, Seung Ki & Lee, Ho Woo, 2014. "A time-dependent busy period queue length formula for the M/Ek/1 queue," Statistics & Probability Letters, Elsevier, vol. 87(C), pages 98-104.
    5. Andersen, Anders Reenberg & Nielsen, Bo Friis & Reinhardt, Line Blander & Stidsen, Thomas Riis, 2019. "Staff optimization for time-dependent acute patient flow," European Journal of Operational Research, Elsevier, vol. 272(1), pages 94-105.
    6. Ad Ridder, 2022. "Rare-event analysis and simulation of queues with time-varying rates," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 545-547, April.
    7. Ansari, Sardar & Yoon, Soovin & Albert, Laura A., 2017. "An approximate hypercube model for public service systems with co-located servers and multiple response," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 143-157.
    8. Yacov Satin & Alexander Zeifman & Alexander Sipin & Sherif I. Ammar & Janos Sztrik, 2020. "On Probability Characteristics for a Class of Queueing Models with Impatient Customers," Mathematics, MDPI, vol. 8(4), pages 1-15, April.
    9. Ekaterina Markova & Yacov Satin & Irina Kochetkova & Alexander Zeifman & Anna Sinitcina, 2020. "Queuing System with Unreliable Servers and Inhomogeneous Intensities for Analyzing the Impact of Non-Stationarity to Performance Measures of Wireless Network under Licensed Shared Access," Mathematics, MDPI, vol. 8(5), pages 1-13, May.
    10. Hu, Lu & Zhao, Bin & Zhu, Juanxiu & Jiang, Yangsheng, 2019. "Two time-varying and state-dependent fluid queuing models for traffic circulation systems," European Journal of Operational Research, Elsevier, vol. 275(3), pages 997-1019.
    11. Giorno, Virginia & Nobile, Amelia G., 2022. "On some integral equations for the evaluation of first-passage-time densities of time-inhomogeneous birth-death processes," Applied Mathematics and Computation, Elsevier, vol. 422(C).
    12. Tsiligianni, Christiana & Tsiligiannis, Aristeides & Tsiliyannis, Christos, 2023. "A stochastic inventory model of COVID-19 and robust, real-time identification of carriers at large and infection rate via asymptotic laws," European Journal of Operational Research, Elsevier, vol. 304(1), pages 42-56.
    13. Zeifman, A. & Satin, Y. & Kiseleva, K. & Korolev, V. & Panfilova, T., 2019. "On limiting characteristics for a non-stationary two-processor heterogeneous system," Applied Mathematics and Computation, Elsevier, vol. 351(C), pages 48-65.
    14. Mahes, Roshan & Mandjes, Michel & Boon, Marko & Taylor, Peter, 2024. "Adaptive scheduling in service systems: A Dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 312(2), pages 605-626.
    15. B. D. Sivazlian & K. H. Wang, 1990. "Diffusion approximation to the G/G/R machine repair problem with warm standby spares," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(5), pages 753-772, October.
    16. Alexander Zeifman & Yacov Satin & Ivan Kovalev & Rostislav Razumchik & Victor Korolev, 2020. "Facilitating Numerical Solutions of Inhomogeneous Continuous Time Markov Chains Using Ergodicity Bounds Obtained with Logarithmic Norm Method," Mathematics, MDPI, vol. 9(1), pages 1-20, December.
    17. Li, Dongmin & Hu, Qingpei & Wang, Lujia & Yu, Dan, 2019. "Statistical inference for Mt/G/Infinity queueing systems under incomplete observations," European Journal of Operational Research, Elsevier, vol. 279(3), pages 882-901.
    18. Raik Stolletz, 2022. "Optimization of time-dependent queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 481-483, April.
    19. Yacov Satin & Alexander Zeifman & Anastasia Kryukova, 2019. "On the Rate of Convergence and Limiting Characteristics for a Nonstationary Queueing Model," Mathematics, MDPI, vol. 7(8), pages 1-11, July.
    20. Zeifman, A.I. & Razumchik, R.V. & Satin, Y.A. & Kovalev, I.A., 2021. "Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy," Applied Mathematics and Computation, Elsevier, vol. 395(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:103:y:2023:i:1:d:10.1007_s11134-022-09851-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.