IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v27y2025i3d10.1007_s11009-025-10200-7.html
   My bibliography  Save this article

On Erlang Queue with Multiple Arrivals and its Time-Changed Variant

Author

Listed:
  • Rohini Bhagwanrao Pote

    (Indian Institute of Technology Bhilai)

  • Kuldeep Kumar Kataria

    (Indian Institute of Technology Bhilai)

Abstract

We introduce and study a queue with the Erlang service system and whose arrivals are governed by a counting process in which there is a possibility of more than one arrival at any instant. We call it the Erlang queue with multiple arrivals. We derive a system of differential equations for its transient probabilities. Its probability generating function is obtained from which the explicit expressions of its transient probabilities are derived. Also, the probability of zero customers at any instant is obtained. Further, we define the queue length process for Erlang queue with multiple arrivals and obtain a system of differential equations for its mean queue length. We derive the explicit expression for the mean queue length and the second moment of the queue length process. Also, we study a time-changed variant of it by subordinating it with an independent inverse stable subordinator for which we obtain its state probabilities, mean queue length and distribution of busy period.

Suggested Citation

  • Rohini Bhagwanrao Pote & Kuldeep Kumar Kataria, 2025. "On Erlang Queue with Multiple Arrivals and its Time-Changed Variant," Methodology and Computing in Applied Probability, Springer, vol. 27(3), pages 1-36, September.
    • Handle: RePEc:spr:metcap:v:27:y:2025:i:3:d:10.1007_s11009-025-10200-7
    DOI: 10.1007/s11009-025-10200-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-025-10200-7
    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-025-10200-7?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:27:y:2025:i:3:d:10.1007_s11009-025-10200-7. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.