An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models
DOI10.2307/1427936zbMATH Open0851.60087OpenAlexW2325783104MaRDI QIDQ4862099FDOQ4862099
Authors:
Publication date: 4 November 1996
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1427936
Recommendations
- Exact computation of time and call blocking probabilities in large, multi-traffic, multi-resource loss systems
- scientific article; zbMATH DE number 994726
- Asymptotic Blocking Probabilities in Loss Networks with Subexponential Demands
- Computational algorithms for blocking probabilities in circuit-switched networks
- scientific article; zbMATH DE number 934838
partition functionsloss networksnormalization constantscircuit-switched communication networkscoordinate-convex resource-sharing policiesproduct-form modelsresource-sharing models
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Stochastic network models in operations research (90B15)
Cited In (7)
- A new perspective on the normalization of invariant measures for loss networks on other product form systems.
- Revisiting stochastic loss networks: structures and approximations
- Exact computation of time and call blocking probabilities in large, multi-traffic, multi-resource loss systems
- Computational complexity of loss networks
- An efficient stable recursion to compute multiservice blocking probabilities
- Computational algorithms for blocking probabilities in circuit-switched networks
- Error bounds for asymptotic approximations of the partition function
This page was built for publication: An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862099)
