Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking
From MaRDI portal
Recommendations
- Blocking probabilities for large multirate erlang loss systems
- Blocking probabilities in large circuit-switched networks
- Exact and asymptotic solutions for models of new telecommunication services
- Computational algorithms for blocking probabilities in circuit-switched networks
- Asymptotic expansions for large closed and loss queueing networks
Cited in
(14)- On the accuracy of the OPC approximation for a symmetric overflow loss model
- Monte Carlo Summation Applied to Product-Form Loss Networks
- The delay analysis in a noisy general cut-through switching network
- Mathematical theory of queueing networks
- Computational algorithms for blocking probabilities in circuit-switched networks
- Computational complexity of loss networks
- Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward
- Computing performance measures in a multi-class multi-resource processor-shared loss system
- ASYMPTOTIC EVALUATION OF BLOCKING PROBABILITIES IN A HIERARCHICAL CELLULAR MOBILE NETWORK
- Fast engset computation
- Multiple Solutions for Blocking Probabilities in Asymmetric Networks
- scientific article; zbMATH DE number 3967617 (Why is no real title available?)
- Fast simulation of blocking probabilities in loss networks
- Quasi-reversible multiclass queues with order independent departure rates
This page was built for publication: Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4722971)
