An approximation method for blocking probabilities in M/D/1/K₁ /D/1/K₂ queues
From MaRDI portal
Publication:5265458
DOI10.1142/S0217595915500177zbMATH Open1321.90041OpenAlexW2139427061MaRDI QIDQ5265458FDOQ5265458
Authors: Dong-Won Seo, Jinpyo Lee, Byeong-Yun Chang 
Publication date: 28 July 2015
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595915500177
Recommendations
- An Approximation Method for Tandem Queues with Blocking
- An approximate analysis of tandem queues with general blocking nodes
- Approximate analysis of single-server tandem queues with finite buffers
- Approximation of throughput in tandem queues with multiple servers and blocking
- A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity
Numerical mathematical programming methods (65K05) Queues and service in operations research (90B22)
Cites Work
- Title not available (Why is that?)
- An approximate analysis of open tandem queueing networks with blocking and general service times
- Approximate analysis for queueing networks with finite capacity and customer loss
- Title not available (Why is that?)
- Laplace transform and moments of waiting times in Poisson driven (max,+) linear systems
- Max-Plus Linear Stochastic Systems and Perturbation Analysis
- Taylor series expansions for Poisson-driven (max,+)-linear systems
- Analytical solution of finite capacity M/D/1 queues
- Evaluating the Overflow Probability Using the Infinite Queue
- Tail probability of transient and stationary waiting times in (max,+)-linear systems
- A max-algebra approach to modeling and simulation of tandem queueing systems
Cited In (2)
This page was built for publication: An approximation method for blocking probabilities in \(M/D/1/K_{1} \to \cdot /D/1/K_{2}\) queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265458)
