IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i11p2454-d1156239.html
   My bibliography  Save this article

Scaling Limits of a Tandem Queue with Two Infinite Orbits

Author

Listed:
  • Anatoly Nazarov

    (Institute of Applied Mathematics and Computer Science, National Research Tomsk State University, 36 Lenina Ave., Tomsk 634050, Russia)

  • Tuan Phung-Duc

    (Institute of Systems and Information Engineering, University of Tsukuba, 1-1-1 Tennodai, Tsukuba 305-8573, Japan)

  • Svetlana Paul

    (Institute of Applied Mathematics and Computer Science, National Research Tomsk State University, 36 Lenina Ave., Tomsk 634050, Russia)

  • Mariya Morozova

    (Institute of Applied Mathematics and Computer Science, National Research Tomsk State University, 36 Lenina Ave., Tomsk 634050, Russia)

Abstract

This paper considers a tandem queueing network with a Poisson arrival process of incoming calls, two servers, and two infinite orbits by the method of asymptotic analysis. The servers provide services for incoming calls for exponentially distributed random times. Blocked customers at each server join the orbit of that server and retry to enter the server again after an exponentially distributed time. Under the condition of low retrial rates, we prove that the joint stationary distribution of scaled numbers of calls in the orbits weakly converges to a two-variable Normal distribution.

Suggested Citation

  • Anatoly Nazarov & Tuan Phung-Duc & Svetlana Paul & Mariya Morozova, 2023. "Scaling Limits of a Tandem Queue with Two Infinite Orbits," Mathematics, MDPI, vol. 11(11), pages 1-14, May.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:11:p:2454-:d:1156239
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/11/2454/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/11/2454/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Pourbabai, Behnam, 1993. "Tandem behavior of a telecommunication system with repeated calls: II, A general case without buffers," European Journal of Operational Research, Elsevier, vol. 65(2), pages 247-258, 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. Dieter Fiems, 2023. "Retrial queues with constant retrial times," Queueing Systems: Theory and Applications, Springer, vol. 103(3), pages 347-365, April.
    2. Dieter Fiems, 2022. "Retrial queues with generally distributed retrial times," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 189-191, April.

    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:gam:jmathe:v:11:y:2023:i:11:p:2454-:d:1156239. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.