A Note on Evaluating the Overflow Probability Using the Infinite Queue

DOI10.1287/MNSC.41.8.1402zbMATH Open0862.90061OpenAlexW1984549303MaRDI QIDQ4896424FDOQ4896424

Authors: Benjamin Avi-Itzhak, Shlomo Halfin 

Publication date: 20 October 1996

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

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

Recommendations

• Evaluating the Overflow Probability Using the Infinite Queue
• Bursty traffic and finite capacity queues
• A note on queues with M/G/\(\infty\) input
• Overflow probability for a discrete-time queue with non-stationary multiplexed input

zbMATH Keywords

queueingATM networksbursty trafficapproximation of overflow probability

Mathematics Subject Classification ID

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

Cited In (6)

• On the accuracy of the OPC approximation for a symmetric overflow loss model
• A new method for approximating blocking probability in overflow loss networks
• On the Overflow Process from a Finite Markovian Queue
• On the estimation of buffer overflow probabilities from measurements
• Properties of the interrupted Poisson approximation
• Letter to the Editor—An Abridged Table for Infinite Queues

This page was built for publication: A Note on 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 Q4896424)