Algorithms to determine exact blocking probabilities for multirate tree networks

DOI10.1109/26.58760zbMATH Open0706.94028OpenAlexW2132443901MaRDI QIDQ3487293FDOQ3487293

Authors Danny H. K. Tsang, Keith W. Ross 

Publication date 1990

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/26.58760

zbMATH Keywords

circuit-switched network

Mathematics Subject Classification ID

Cited In (9)

• Fast simulation of blocking probabilities in loss networks
• A decomposition approximation method for multiclass BC
• Properties of recurrent equations for the full-availability group with BPP traffic
• Computation and optimization methods for multiresource queues
• Monte Carlo Summation Applied to Product-Form Loss Networks
• Optimal static pricing for a tree network
• Computational algorithms for blocking probabilities in circuit-switched networks
• Qualitative properties of the Erlang blocking model with heterogeneous user requirements
• Computing performance measures in a multi-class multi-resource processor-shared loss system

This page was built for publication: Algorithms to determine exact blocking probabilities for multirate tree networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3487293)