Sciweavers

Share
NETWORKING
2000

An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks

8 years 11 months ago
An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks
Abstract. The paper deals with tree-structured point-to-multipoint networks, where users from infinite user populations at the leaf nodes subscribe to a variety of channels, offered by one source. The users joining the network form dynamic multicast connections that share the network resources. An exact algorithm for calculating end-to-end call blocking probabilities for dynamic connections is devised for this multicast model. The algorithm is based on the well-known algorithm for calculating blocking probabilities in hierarchical multiservice access networks, where link occupancy distributions are alternately convolved and truncated. The resource sharing of multicast connections requires the modification of the algorithm by using a new type of convolution, the OR-convolution. The exact algorithm for end-to-end call blocking probabilities enables us to study the accuracy of earlier results based on Reduced Load Approximation. The model is further extended to include background traffic,...
Eeva Nyberg, Jorma T. Virtamo, Samuli Aalto
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2000
Where NETWORKING
Authors Eeva Nyberg, Jorma T. Virtamo, Samuli Aalto
Comments (0)
books