IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v32y2015i03ns0217595915500177.html
   My bibliography  Save this article

An Approximation Method for Blocking Probabilities in M/D/1/K1 → ⋅/D/1/K2 Queues

Author

Listed:
  • Dong-Won Seo

    (School of Management and Management Research Institute, Kyung Hee University, 26, Kyungheedae-ro, Dongdaemun-gu Seoul 130-701, Korea)

  • Jinpyo Lee

    (College of Business Administration, Hongik University, 72-1, Sangsu-dong, Mapo-gu, Seoul 121-791, Korea)

  • Byeong-Yun Chang

    (School of Business, Ajou University, 206, World cup-ro, Yeongtong-gu, Suwon 443-749, Korea)

Abstract

Obtaining exact blocking probabilities for tandem queues with finite capacities is not a trivial problem. In this paper, we propose a computational approximation method using max-plus algebra for computing blocking probability in a Poisson-driven 2-node tandem queue with finite capacities and constant service times. The blocking probability of a finite-capacity queueing system can be obtained from either the tail probability of stationary waiting time or the difference between two expected stationary waiting times at the first node of the corresponding extended 3-node tandem queue. The computational results in this study show that the proposed approach provides a good approximation of the blocking probability, and in particular, it works well under moderately to heavily loaded situations. The proposed approach is not limited to a particular blocking policy, system structure, or service time; hence, it is applicable to general queues with finite buffer capacities and various blocking policies.

Suggested Citation

  • Dong-Won Seo & Jinpyo Lee & Byeong-Yun Chang, 2015. "An Approximation Method for Blocking Probabilities in M/D/1/K1 → ⋅/D/1/K2 Queues," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(03), pages 1-12.
    • Handle: RePEc:wsi:apjorx:v:32:y:2015:i:03:n:s0217595915500177
    DOI: 10.1142/S0217595915500177
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595915500177
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595915500177?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.

    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:wsi:apjorx:v:32:y:2015:i:03:n:s0217595915500177. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.