IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v96y2020i1d10.1007_s11134-020-09666-8.html
   My bibliography  Save this article

Tail asymptotics for the $$M_1,M_2/G_1,G_2/1$$ M 1 , M 2 / G 1 , G 2 / 1 retrial queue with non-preemptive priority

Author

Listed:
  • Bin Liu

    (Anhui Jianzhu University)

  • Yiqiang Q. Zhao

    (Carleton University)

Abstract

Stochastic networks with complex structures are key modelling tools for many important applications. In this paper, we consider a specific type of network: retrial queueing systems with priority. This type of queueing system is important in various applications, including telecommunication and computer management networks with big data. The system considered here receives two types of customers, of which Type-1 customers (in a queue) have non-pre-emptive priority to receive service over Type-2 customers (in an orbit). For this type of system, we propose an exhaustive version of the stochastic decomposition approach, which is one of the main contributions made in this paper, for the purpose of studying asymptotic behaviour of the tail probability of the number of customers in the steady state for this retrial queue with two types of customers. Under the assumption that the service times of Type-1 customers have a regularly varying tail and the service times of Type-2 customers have a tail lighter than Type-1 customers, we obtain tail asymptotic properties for the numbers of customers in the queue and in the orbit, respectively, conditioning on the server’s status, in terms of the exhaustive stochastic decomposition results. These tail asymptotic results are new, which is another main contribution made in this paper. Tail asymptotic properties are very important, not only on their own merits but also often as key tools for approximating performance metrics and constructing numerical algorithms.

Suggested Citation

  • Bin Liu & Yiqiang Q. Zhao, 2020. "Tail asymptotics for the $$M_1,M_2/G_1,G_2/1$$ M 1 , M 2 / G 1 , G 2 / 1 retrial queue with non-preemptive priority," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 169-199, October.
    • Handle: RePEc:spr:queues:v:96:y:2020:i:1:d:10.1007_s11134-020-09666-8
    DOI: 10.1007/s11134-020-09666-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-020-09666-8
    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-020-09666-8?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. Asmussen, Søren & Klüppelberg, Claudia & Sigman, Karl, 1999. "Sampling at subexponential times, with queueing applications," Stochastic Processes and their Applications, Elsevier, vol. 79(2), pages 265-286, February.
    2. Jeongsim Kim & Bara Kim, 2016. "A survey of retrial queueing systems," Annals of Operations Research, Springer, vol. 247(1), pages 3-36, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dieter Fiems, 2023. "Retrial queues with constant retrial times," Queueing Systems: Theory and Applications, Springer, vol. 103(3), pages 347-365, April.
    2. Bin Liu & Jie Min & Yiqiang Q. Zhao, 2023. "Refined tail asymptotic properties for the $$M^X/G/1$$ M X / G / 1 retrial queue," Queueing Systems: Theory and Applications, Springer, vol. 104(1), pages 65-105, June.

    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. Bin Liu & Jie Min & Yiqiang Q. Zhao, 2023. "Refined tail asymptotic properties for the $$M^X/G/1$$ M X / G / 1 retrial queue," Queueing Systems: Theory and Applications, Springer, vol. 104(1), pages 65-105, June.
    2. Bin Liu & Yiqiang Q. Zhao, 2022. "Tail Asymptotics for a Retrial Queue with Bernoulli Schedule," Mathematics, MDPI, vol. 10(15), pages 1-13, August.
    3. Se Won Lee & Bara Kim & Jeongsim Kim, 2022. "Analysis of the waiting time distribution in M/G/1 retrial queues with two way communication," Annals of Operations Research, Springer, vol. 310(2), pages 505-518, March.
    4. Anatoly Nazarov & János Sztrik & Anna Kvach & Ádám Tóth, 2020. "Asymptotic sojourn time analysis of finite-source M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs," Annals of Operations Research, Springer, vol. 288(1), pages 417-434, May.
    5. Baltrunas, A. & Daley, D. J. & Klüppelberg, C., 2004. "Tail behaviour of the busy period of a GI/GI/1 queue with subexponential service times," Stochastic Processes and their Applications, Elsevier, vol. 111(2), pages 237-258, June.
    6. Lamia Lakaour & Djamil Aïssani & Karima Adel-Aissanou & Kamel Barkaoui, 2019. "M/M/1 Retrial Queue with Collisions and Transmission Errors," Methodology and Computing in Applied Probability, Springer, vol. 21(4), pages 1395-1406, December.
    7. Yang, Dong-Yuh & Tsao, Chih-Lung, 2019. "Reliability and availability analysis of standby systems with working vacations and retrial of failed components," Reliability Engineering and System Safety, Elsevier, vol. 182(C), pages 46-55.
    8. Debicki, Krzystof & Zwart, Bert & Borst, Sem, 2004. "The supremum of a Gaussian process over a random interval," Statistics & Probability Letters, Elsevier, vol. 68(3), pages 221-234, July.
    9. Anatoly Nazarov & János Sztrik & Anna Kvach & Ádám Tóth, 2022. "Asymptotic Analysis of Finite-Source M/GI/1 Retrial Queueing Systems with Collisions and Server Subject to Breakdowns and Repairs," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1503-1518, September.
    10. Wang, Kuo-Hsiung & Wu, Chia-Huang & Yen, Tseng-Chang, 2022. "Comparative cost-benefit analysis of four retrial systems with preventive maintenance and unreliable service station," Reliability Engineering and System Safety, Elsevier, vol. 221(C).
    11. Evsey V. Morozov & Irina V. Peshkova & Alexander S. Rumyantsev, 2023. "Bounds and Maxima for the Workload in a Multiclass Orbit Queue," Mathematics, MDPI, vol. 11(3), pages 1-15, January.
    12. Alexandra Borodina & Vladimir Mazalov, 2023. "On the Equilibrium in a Queuing System with Retrials and Strategic Arrivals," Mathematics, MDPI, vol. 11(16), pages 1-15, August.
    13. Royi Jacobovic & Nikki Levering & Onno Boxma, 2023. "Externalities in the M/G/1 queue: LCFS-PR versus FCFS," Queueing Systems: Theory and Applications, Springer, vol. 104(3), pages 239-267, August.
    14. P. Jelenković & P. Momčilović, 2003. "Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 587-608, August.
    15. Julia Chirkova & Vladimir Mazalov & Evsey Morozov, 2022. "Equilibrium in a Queueing System with Retrials," Mathematics, MDPI, vol. 10(3), pages 1-15, January.
    16. Robert, Christian Y. & Segers, Johan, 2008. "Tails of random sums of a heavy-tailed number of light-tailed terms," Insurance: Mathematics and Economics, Elsevier, vol. 43(1), pages 85-92, August.
    17. Anatoly Nazarov & János Sztrik & Anna Kvach & Tamás Bérczes, 2019. "Asymptotic analysis of finite-source M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs," Annals of Operations Research, Springer, vol. 277(2), pages 213-229, June.
    18. Dieter Fiems, 2023. "Retrial queues with constant retrial times," Queueing Systems: Theory and Applications, Springer, vol. 103(3), pages 347-365, April.
    19. Faruk Akın & E. Lerzan Örmeci, 2022. "Optimal control of a loss system with feedback," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 381-383, April.
    20. F. G. Badía & C. Sangüesa, 2017. "Log-Convexity of Counting Processes Evaluated at a Random end of Observation Time with Applications to Queueing Models," Methodology and Computing in Applied Probability, Springer, vol. 19(2), pages 647-664, June.

    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:96:y:2020:i:1:d:10.1007_s11134-020-09666-8. 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.