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

DOI10.1142/S0217595915500177zbMath1321.90041OpenAlexW2139427061MaRDI QIDQ5265458

Byeong-Yun Chang, Jinpyo Lee, Dong-Won Seo

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

zbMATH Keywords

tandem queuemax-plus algebrablocking probability

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Queues and service in operations research (90B22)

Related Items (1)

Closed-form formulae for moment, tail probability, and blocking probability of waiting time in a buffer-sharing deterministic system

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• A max-algebra approach to modeling and simulation of tandem queueing systems
• Taylor series expansions for Poisson-driven (max,+)-linear systems
• Analytical solution of finite capacity M/D/1 queues
• Max-Plus Linear Stochastic Systems and Perturbation Analysis
• Evaluating the Overflow Probability Using the Infinite Queue
• Tail probability of transient and stationary waiting times in (max,+)-linear systems
• Laplace transform and moments of waiting times in Poisson driven (max,+) linear systems

This page was built for publication: An Approximation Method for Blocking Probabilities in M/D/1/K₁→ ⋅/D/1/K₂Queues