Algorithms to determine exact blocking probabilities for multirate tree networks
From MaRDI portal
Publication:3487293
DOI10.1109/26.58760zbMath0706.94028OpenAlexW2132443901MaRDI QIDQ3487293
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
Related Items (9)
Computation and optimization methods for multiresource queues ⋮ Qualitative properties of the Erlang blocking model with heterogeneous user requirements ⋮ Properties of recurrent equations for the full-availability group with BPP traffic ⋮ Computational algorithms for blocking probabilities in circuit-switched networks ⋮ Optimal static pricing for a tree network ⋮ Fast simulation of blocking probabilities in loss networks ⋮ Computing performance measures in a multi-class multi-resource processor-shared loss system ⋮ Monte Carlo Summation Applied to Product-Form Loss Networks ⋮ A decomposition approximation method for multiclass BC
This page was built for publication: Algorithms to determine exact blocking probabilities for multirate tree networks