Evaluating the Overflow Probability Using the Infinite Queue

DOI10.1287/MNSC.39.10.1238zbMATH Open0792.60095OpenAlexW2138826825MaRDI QIDQ4287698FDOQ4287698

Authors: Masakiyo Miyazawa, Genji Yamazaki, Hirotaka Sakasegawa 

Publication date: 12 April 1994

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.39.10.1238

Recommendations

• A Note on Evaluating the Overflow Probability Using the Infinite Queue
• Approximation of the Overflow Process from a G/M/N/K Queueing System
• A two-moment approximation for the \(GI/G/c\) queue with finite capacity
• Diffusion approximation for first overflow time in \(GI/G/m\) system with finite capacity

zbMATH Keywords

approximation formulaoverflow probabilitystationary assumption

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cited In (9)

• An approximation method for blocking probabilities in \(M/D/1/K_{1} \to \cdot /D/1/K_{2}\) queues
• Approximation of the Overflow Process from a G/M/N/K Queueing System
• Multi-server, Finite Waiting Room,M/G/c/KOptimization Models
• On the accuracy of the OPC approximation for a symmetric overflow loss model
• Properties and performance modelling of finite buffer \(M/G/1/K\) networks
• Topological network design of general, finite, multi-server queueing networks
• Optimal design and performance modelling of \(M/G/1/K\) queueing systems
• Closed-form approximations for the URLLC capacity using \(G/G/s\) queues
• A Note on Bounds and Error Bounds for Nonexponential Batch Arrival Systems

This page was built for publication: Evaluating the Overflow Probability Using the Infinite Queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287698)