Search Results

  1. S. Aalto and J. Virtamo, Combinatorial algorithm for calculating blocking probabilities in multicast networks, in Proceedings of the 15th Nordic Teletraffic Seminar, pp. 23-34, 2000, Lund, Sweden (pdf)(bib)
    Abstract: We consider a multicast network model, where a single server node is connected with a collection of user sites by a transport network with tree topology. A predefined set of multicast connections with dynamic membership use this transport network, with the server acting as the source for all these connections and the receivers located at the user sites. Earlier analytic results concerning the calculation of blocking probabilities in this kind of multicast setting have been applicable, due to the so called state space explosion, only for networks with few multicast connections. In this paper we show that, by requiring that the connections be symmetric, the exact calculation of the end-to-end blocking probability becomes feasible even for large networks with many multicast connections.