An exact end-to-end blocking probability algorithm for multicast networks

Authors:
Eeva Nyberg;Jorma Virtamo;Samuli Aalto
Affiliations:
Networking Laboratory, Helsinki University of Technology, P.O. Box 3000, FIN-02015 HUT, Finland;Networking Laboratory, Helsinki University of Technology, P.O. Box 3000, FIN-02015 HUT, Finland;Networking Laboratory, Helsinki University of Technology, P.O. Box 3000, FIN-02015 HUT, Finland
Venue:
Performance Evaluation
Year:
2003

Citing 5
Cited 2

Multirate resource sharing for unicast and multicast connections

Broadband communications
Multiservice Loss Models for Broadband Telecommunication Networks

Multiservice Loss Models for Broadband Telecommunication Networks
Blocking of dynamic multicast connections in a single link

BC '98 Proceedings of the IFIP TC6/WG6.2 Fourth International Conference on Broadband Communications: The future of telecommunications
Blocking probability of heterogeneous traffic in a multirate multicast switch

IEEE Journal on Selected Areas in Communications
Admission control algorithms for multicast sessions with multiple streams

IEEE Journal on Selected Areas in Communications

Quantitative performance comparison of different content distribution modes

Performance Evaluation
Path-wise performance in a tree-type network: Per-stream loss probability, delay, and delay variance analyses

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the calculation of blocking probabilities in multicast trees with dynamic membership. We extend the work by Karvo et al., where an approximate algorithm based on the reduced load approximation (RLA) was given to calculate end-to-end blocking for infinite sized user populations in multicast networks. The new algorithm for calculating end-to-end call blocking exactly for an arbitrary sized user population is based on the known blocking probability algorithm in hierarchical multiservice access networks, where link occupancy distributions are alternately convolved and truncated. We show that the algorithm can be applied to multicast trees embedded in a network with an arbitrary topology carrying also non-multicast traffic. The resource sharing of multicast connections, however, requires the modification of the algorithm by introducing a new type of convolution, the OR-convolution. In addition, we discuss several different user population models for which the algorithm is applicable.