On the Accuracy of the OPC Approximation for a Symmetric Overflow Loss Model

DOI10.1080/15326349.2013.783284zbMath1282.60093OpenAlexW2066043209WikidataQ61606322 ScholiaQ61606322MaRDI QIDQ2841132

Eric W. M. Wong, Zvi Rosberg, Moshe Zukerman, Andrew Zalesky, William Moran

Publication date: 24 July 2013

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349.2013.783284

zbMATH Keywords

blocking probabilityteletrafficoverflow priority classificationErlang fixed-point approximationoverflow loss models

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Traffic problems in operations research (90B20) Inequalities for sums, series and integrals (26D15) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (1)

On the Accuracy of the OPC Approximation for a Symmetric Overflow Loss Model

Cites Work

• Loss networks
• Sharp and simple bounds for the Erlang delay and loss formulae
• A new method for approximating blocking probability in overflow loss networks
• On the Accuracy of the OPC Approximation for a Symmetric Overflow Loss Model
• On critically loaded loss networks
• Limit theorems for loss networks with diverse routing
• Blocking probabilities in large circuit-switched networks
• Congestion in Blocking Systems-A Simple Approximation Technique
• A Method of Moments for the Analysis of a Switched Communication Network's Performance
• Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking
• The Interrupted Poisson Process As An Overflow Process

This page was built for publication: On the Accuracy of the OPC Approximation for a Symmetric Overflow Loss Model