Congestion probabilities in a circuit-switched integrated services network
Performance Evaluation
Computational algorithms for blocking probabilities in circuit-switched networks
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Computational complexity of loss networks
Theoretical Computer Science - Special issue on probabilistic modelling
Efficient decomposition methods for the analysis of multi-facility blocking models
Journal of the ACM (JACM)
Superfast parallel discrete event simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Optical networks: a practical perspective
Optical networks: a practical perspective
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
MPLS and the evolving Internet architecture
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Nonstationary analysis of circuit-switched communication networks
Performance Evaluation
Hi-index | 0.00 |
Two general-purpose decomposition methods to calculate the blocking probabilities of connection-oriented networks are presented. The methods are based on either the call status or the link status of the networks, and can significantly reduce the required computational times. A heuristic is presented to simplify the application of the proposed decomposition methods on networks with irregular topologies. Numerical examples are given to demonstrate the applications of the proposed methods.