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

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 consta...

Full description

Saved in:
Bibliographic Details
Published in:Asia-Pacific journal of operational research 2015-06, Vol.32 (3)
Main Authors: Seo, Dong-Won, Lee, Jinpyo, Chang, Byeong-Yun
Format: Article
Language:English
Subjects:
Approximation
Computation
Markov analysis
Mathematical analysis
Nodes
Operations research
Probability
Queues
Queuing theory
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0217-5959
1793-7019
0217-5959
DOI:10.1142/S0217595915500177