IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v254y2016i1p161-168.html
   My bibliography  Save this article

Queueing network MAP−(GI/∞)K with high-rate arrivals

Author

Listed:
  • Moiseev, Alexander
  • Nazarov, Anatoly

Abstract

An analysis of the open queueing network MAP−(GI/∞)K is presented in this paper. The MAP−(GI/∞)K network implements Markov routing, general service time distribution, and an infinite number of servers at each node. Analysis is performed under the condition of a growing fundamental rate for the Markovian arrival process. It is shown that the stationary probability distribution of the number of customers at the nodes can be approximated by multi-dimensional Gaussian distribution. Parameters of this distribution are presented in the paper. Numerical results validate the applicability of the obtained approximations under relevant conditions. The results of the approximations are applied to estimate the optimal number of servers for a network with finite-server nodes. In addition, an approximation of higher-order accuracy is derived.

Suggested Citation

  • Moiseev, Alexander & Nazarov, Anatoly, 2016. "Queueing network MAP−(GI/∞)K with high-rate arrivals," European Journal of Operational Research, Elsevier, vol. 254(1), pages 161-168.
    • Handle: RePEc:eee:ejores:v:254:y:2016:i:1:p:161-168
    DOI: 10.1016/j.ejor.2016.04.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716302302
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.04.011?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.

    Citations

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


    Cited by:

    1. Anatoly Nazarov & Alexander Dudin & Alexander Moiseev, 2022. "Pseudo Steady-State Period in Non-Stationary Infinite-Server Queue with State Dependent Arrival Intensity," Mathematics, MDPI, vol. 10(15), pages 1-12, July.
    2. Cheung, Eric C.K. & Rabehasaina, Landy & Woo, Jae-Kyung & Xu, Ran, 2019. "Asymptotic correlation structure of discounted Incurred But Not Reported claims under fractional Poisson arrival process," European Journal of Operational Research, Elsevier, vol. 276(2), pages 582-601.
    3. Ekaterina Pankratova & Svetlana Moiseeva & Mais Farkhadov, 2022. "Infinite-Server Resource Queueing Systems with Different Types of Markov-Modulated Poisson Process and Renewal Arrivals," Mathematics, MDPI, vol. 10(16), pages 1-16, August.

    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:eee:ejores:v:254:y:2016:i:1:p:161-168. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.