Nearly optimal importance sampling for Monte Carlo simulation of loss systems
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Multipoint communication: a survey of protocols, functions, and mechanisms
IEEE Journal on Selected Areas in Communications
Multicasting vs. unicasting in mobile communication systems
WOWMOM '02 Proceedings of the 5th ACM international workshop on Wireless mobile multimedia
Quantitative performance comparison of different content distribution modes
Performance Evaluation
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Hi-index | 0.00 |
This paper presents an efficient algorithm for Monte-Carlo simulation of time blocking probabilities for multi-layer multicast streams with the assumption that blocked calls are lost. Users may join and leave the multicast connections freely, thus creating dynamic multicast trees. The earlier published algorithms are applicable to small networks or networks with few users. The present simulation algorithm is based on the inverse convolution method, and is the only effective way to handle large systems, known to the author.