IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v22y2020i4d10.1007_s11009-018-9660-1.html
   My bibliography  Save this article

Limit Theorems for Queueing Systems with Various Service Disciplines in Heavy-Traffic Conditions

Author

Listed:
  • S. A. Grishunina

    (Lomonosov Moscow State University
    National Research University Higher School of Economics)

Abstract

In this paper a multi-server queueing system with regenerative input flow and independent service times with finite means is studied. We consider queueing systems with various disciplines of the service performance: systems with a common queue and systems with individual queues in front of the servers. In the second case an arrived customer chooses one of the servers in accordance with a certain rule and stays in the chosen queue up to the moment of its departure from the system. We define some classes of disciplines and analyze the asymptotical behavior of a multi-server queueing system in a heavy-traffic situation (traffic rate ρ ≥ 1). The main result of this work is limit theorems concerning the weak convergence of scaled processes of waiting time and queue length to the process of the Brownian motion for the case ρ > 1 and its absolute value for the case ρ = 1.

Suggested Citation

  • S. A. Grishunina, 2020. "Limit Theorems for Queueing Systems with Various Service Disciplines in Heavy-Traffic Conditions," Methodology and Computing in Applied Probability, Springer, vol. 22(4), pages 1529-1538, December.
    • Handle: RePEc:spr:metcap:v:22:y:2020:i:4:d:10.1007_s11009-018-9660-1
    DOI: 10.1007/s11009-018-9660-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-018-9660-1
    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/s11009-018-9660-1?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. Yunan Liu & Ward Whitt & Yao Yu, 2016. "Approximations for heavily loaded G/GI/n + GI queues," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(3), pages 187-217, April.
    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. Ward Whitt & Jingtong Zhao, 2017. "Many‐server loss models with non‐poisson time‐varying arrivals," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(3), pages 177-202, 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:spr:metcap:v:22:y:2020:i:4:d:10.1007_s11009-018-9660-1. 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.