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, allowing the analysis of networks carrying mixed traffic e.g. multicast and unicast traffic.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chan W.C., Geraniotis E., Tradeoff Between Blocking and Dropping in Multicasting Networks, IEEE International Conference on Communications, Conference Record, Converging Technologies for Tomorrow’s Applications pp. 1030–1034, 1996.
Hui J., “Switching and traffic theory for integrated broadband networks”, Kluwer Academic Publishers, Boston, 1990.
Karvo J., Virtamo J., Aalto S., Martikainen O., Blocking of dynamic multicast connections in a single link, Proc. of Broadband Communications’ 98, ed. P. Kühn, R. Ulrich, IFIP, pp. 473–483, 1998.
Karvo J., Virtamo J., Aalto S., Martikainen O., Blocking of Dynamic Multicast Connections, In 4th INFORMS Telecommunications Conference, Boca Raton, Florida, March 1998. To appear in Telecommunication Systems.
Kelly F.P., “Reversibility and Stochastic Networks”, John Wiley & Sons, 1979.
Kim C.K., Blocking Probability of Heterogeneous Traffic in a Multirate Multicast Switch, IEEE Journal on Selected Areas in Communications 14(2), 1996, pp. 374–385.
Listanti M., Veltri L., Blocking Probability of Three-Stage Multicast Switches, IEEE International Conference on Communications, Conference Record, 1998, pp. 623–629.
Ross K. W., “Multiservice Loss Models for Broadband Telecommunication Net-works”, Springer-Verlag, London, 1995.
Shacham N., Yokota H., Admission Control Algorithms for Multicast Sessions with Multiple Streams IEEE Journal on Selected Areas in Communications 15(3), 1997, pp. 557–566.
Stasiak M. and Zwierzykowski P., Analytical Model of ATM Node with Multicast Switching, Mediterranean Electrotechnical Conference, 1998, pp. 683–687.
Yang Y., On Blocking Probability of Multicast Networks, IEEE Transactions on Communications 46(7), pp. 957–968, July 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nyberg, E., Virtamo, J., Aalto, S. (2000). An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks. In: Pujolle, G., Perros, H., Fdida, S., Körner, U., Stavrakakis, I. (eds) Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks. NETWORKING 2000. Lecture Notes in Computer Science, vol 1815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45551-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-45551-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67506-8
Online ISBN: 978-3-540-45551-6
eBook Packages: Springer Book Archive