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

The unobserved waiting customer approximation

Author

Listed:
  • Kevin Granville

    (University of Waterloo
    University of Western Ontario)

  • Steve Drekic

    (University of Waterloo)

Abstract

We introduce a new approximation procedure to improve the accuracy of matrix analytic methods when using truncated queueing models to analyse infinite buffer systems. This is accomplished through emulating the presence of unobserved waiting customers beyond the finite buffer that are able to immediately enter the system following an observed customer’s departure. We show that this procedure results in exact steady-state probabilities at queue lengths below the buffer for truncated versions of the classic M/M/1, $$M/M/1+M$$ M / M / 1 + M , $$M/M/\infty $$ M / M / ∞ , and M/PH/1 queues. We also present two variants of the basic procedure for use within a $$M/PH/1+M$$ M / P H / 1 + M queue and a N-queue polling system with exhaustive service, phase-type service and switch-in times, and exponential impatience timers. The accuracy of these two variants in the context of the polling model are compared through several numerical examples.

Suggested Citation

  • Kevin Granville & Steve Drekic, 2021. "The unobserved waiting customer approximation," Queueing Systems: Theory and Applications, Springer, vol. 99(3), pages 345-396, December.
    • Handle: RePEc:spr:queues:v:99:y:2021:i:3:d:10.1007_s11134-021-09706-x
    DOI: 10.1007/s11134-021-09706-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-021-09706-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-021-09706-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. Krishnamoorthy, A. & Babu, S. & Narayanan, Viswanath C., 2009. "The MAP/(PH/PH)/1 queue with self-generation of priorities and non-preemptive service," European Journal of Operational Research, Elsevier, vol. 195(1), pages 174-185, May.
    2. Chakravarthy, Srinivas R., 2012. "Maintenance of a deteriorating single server system with Markovian arrivals and random shocks," European Journal of Operational Research, Elsevier, vol. 222(3), pages 508-522.
    3. Kostia Avrachenkov & Efrat Perel & Uri Yechiali, 2016. "Finite-buffer polling systems with threshold-based switching policy," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(3), pages 541-571, October.
    4. Kevin Granville & Steve Drekic, 2020. "A 2-class maintenance model with dynamic server behavior," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 34-96, April.
    5. Gertsbakh, Ilya, 1984. "The shorter queue problem: A numerical study using the matrix-geometric solution," European Journal of Operational Research, Elsevier, vol. 15(3), pages 374-381, March.
    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. Rodríguez, Joanna & Lillo, Rosa E. & Ramírez-Cobo, Pepa, 2015. "Failure modeling of an electrical N-component framework by the non-stationary Markovian arrival process," Reliability Engineering and System Safety, Elsevier, vol. 134(C), pages 126-133.
    2. J. P. C. Blanc, 1992. "The Power-Series Algorithm Applied to the Shortest-Queue Model," Operations Research, INFORMS, vol. 40(1), pages 157-167, February.
    3. M. Saxena & I. Dimitriou & S. Kapodistria, 2020. "Analysis of the shortest relay queue policy in a cooperative random access network with collisions," Queueing Systems: Theory and Applications, Springer, vol. 94(1), pages 39-75, February.
    4. Levitin, Gregory & Finkelstein, Maxim, 2019. "Optimal loading of elements in series systems exposed to external shocks," Reliability Engineering and System Safety, Elsevier, vol. 192(C).
    5. Nimrod Dvir & Refael Hassin & Uri Yechiali, 2020. "Strategic behaviour in a tandem queue with alternating server," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 205-244, December.
    6. María Luz Gámiz & Delia Montoro-Cazorla & María del Carmen Segovia-García & Rafael Pérez-Ocón, 2022. "MoMA Algorithm: A Bottom-Up Modeling Procedure for a Modular System under Environmental Conditions," Mathematics, MDPI, vol. 10(19), pages 1-19, September.
    7. Hu, Lu & Jiang, Yangsheng & Zhu, Juanxiu & Chen, Yanru, 2015. "A PH/PH(n)/C/C state-dependent queuing model for metro station corridor width design," European Journal of Operational Research, Elsevier, vol. 240(1), pages 109-126.
    8. Danielle Tibi, 2019. "Martingales and buffer overflow for the symmetric shortest queue model," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 153-190, October.
    9. Zhu, Juanxiu & Hu, Lu & Jiang, Yangsheng & Khattak, Afaq, 2017. "Circulation network design for urban rail transit station using a PH(n)/PH(n)/C/C queuing network model," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1043-1068.
    10. Eryilmaz, Serkan, 2017. "δ-shock model based on Polya process and its optimal replacement policy," European Journal of Operational Research, Elsevier, vol. 263(2), pages 690-697.
    11. Przemysław Korytkowski & Tomasz Wiśniewski, 2011. "Performance analysis of commercial offset printing under dynamic priority rules," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 53-64.
    12. Ruiz-Castro, Juan Eloy, 2016. "Markov counting and reward processes for analysing the performance of a complex system subject to random inspections," Reliability Engineering and System Safety, Elsevier, vol. 145(C), pages 155-168.
    13. Sem Borst & Onno Boxma, 2018. "Polling: past, present, and perspective," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 335-369, October.
    14. Vladimir Vishnevsky & Olga Semenova, 2021. "Polling Systems and Their Application to Telecommunication Networks," Mathematics, MDPI, vol. 9(2), pages 1-30, January.
    15. Juan Eloy Ruiz-Castro, 2015. "A preventive maintenance policy for a standby system subject to internal failures and external shocks with loss of units," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(9), pages 1600-1613, July.
    16. Gwiggner, Claus & Nagaoka, Sakae, 2014. "Data and queueing analysis of a Japanese air-traffic flow," European Journal of Operational Research, Elsevier, vol. 235(1), pages 265-275.
    17. Kevin Granville & Steve Drekic, 2020. "A 2-class maintenance model with dynamic server behavior," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 34-96, April.
    18. Jewgeni H. Dshalalow & Ahmed Merie & Ryan T. White, 2020. "Fluctuation Analysis in Parallel Queues with Hysteretic Control," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 295-327, March.
    19. Cha, Ji Hwan & Finkelstein, Maxim, 2016. "New shock models based on the generalized Polya process," European Journal of Operational Research, Elsevier, vol. 251(1), pages 135-141.
    20. Jewgeni H. Dshalalow & Ahmed Merie, 2018. "Fluctuation analysis in queues with several operational modes and priority customers," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 309-333, July.

    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:99:y:2021:i:3:d:10.1007_s11134-021-09706-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.