On blocking in loss networks
From MaRDI portal
Publication:3353930
DOI10.2307/1427753zbMATH Open0729.60089OpenAlexW2000090987MaRDI QIDQ3353930FDOQ3353930
Authors: Stan Zachary
Publication date: 1991
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1427753
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cited In (13)
- Insensitivity of blocking probabilities in a circuit-switching network
- Approximation in Large-Scale Circuit-Switched Networks
- Blocking Probability in Link-Frame Systems from the Viewpoint of Overflow Processes
- Modeling dialup internet access: an examination of user-to-modem ratios, blocking probability, and capacity planning in a modem pool.
- Fast simulation of blocking probabilities in loss networks
- Title not available (Why is that?)
- Asymptotically exact analysis of a loss network with channel continuity
- Asymptotic Blocking Probabilities in Loss Networks with Subexponential Demands
- Computational complexity of loss networks
- Multiple Solutions for Blocking Probabilities in Asymmetric Networks
- Blocking probabilities in Erlang loss queues with advance reservation
- Title not available (Why is that?)
- Blocking probabilities in large circuit-switched networks
This page was built for publication: On blocking in loss networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3353930)