Skip to main content
SpringerLink
Log in

Asymptotics in priority queues: from finite to infinite capacities

  • Published:
Queueing Systems Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Notes

  1. We assume the input processes (arrival process, etc.) to be sufficiently regular so that they do not impact the asymptotics in a direct way (for instance, in case of power-law service times, the asymptotics of the system content inherit these power laws). Note further that some border cases (\(c\cdot n^{-1/2}R^{-n}\), \(c\cdot nR^{-n}\)) are also possible, but these only occur for very specific parameter combinations, so we will not discuss these here.

  2. The paths leading to exponential and non-exponential asymptotics have been coined jitter and bridge paths respectively in large deviations.

References

  1. Abate, J., Whitt, W.: Asymptotics for M/G/1 low-priority waiting-time tail probabilities. Queueing Syst. 25(1–4), 173–233 (1997)

    Article  Google Scholar 

  2. Demoor, T.: Priority queues with limited capacity. PhD thesis, Ghent University (2014)

  3. Foley, R., McDonald, D.: Large deviations of a modified Jackson network: Stability and rough asymptotics. Ann. Appl. Probab. 15(1B), 519–541 (2005)

    Google Scholar 

  4. Haque, L., Zhao, Y., Liu, L.: Sufficient conditions for a geometric tail in a QBD process with many countable levels and phases. Stoch. Models. 21(1), 77–99 (2005)

    Article  Google Scholar 

  5. Laevens, K., Bruneel, H.: Discrete-time multiserver queues with priorities. Perform. Eval. 33(4), 249–275 (1998)

    Article  Google Scholar 

  6. Li, H., Zhao, Y.: Exact tail asymptotics in a priority queue - characterizations of the non-preemptive model. Queueing Syst. 68(2), 165–192 (2011)

    Article  Google Scholar 

  7. Li, H., Zhao, Y.: A kernel method for exact tail asymptotics - Random walks in the quarter plane. Queueing Models Serv. Manag. 1(1), 95–129 (2018)

    Google Scholar 

  8. Walraevens, J., Bruneel, H., Maertens, T., Fiems, D., Wittevrongel, S.: Delay analysis of multiclass queues with correlated train arrivals and a hybrid priority/FIFO scheduling discipline. Appl. Math. Model. 45, 823–839 (2017)

    Article  Google Scholar 

  9. Walraevens, J., Steyaert, B., Bruneel, H.: Performance analysis of a single-server ATM queue with a priority scheduling. Comput. Op. Res. 30(12), 1807–1829 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Telecommunications and Information Processing, Ghent University, Ghent, Belgium

    Joris Walraevens

Authors
  1. Joris Walraevens
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joris Walraevens.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Walraevens, J. Asymptotics in priority queues: from finite to infinite capacities. Queueing Syst 100, 361–363 (2022). https://doi.org/10.1007/s11134-022-09774-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-022-09774-7

Search

Navigation