Abstract
Multicast connections have a bandwidth saving nature. This means that a multicast connection --- in taking the form of a tree with streams merging at the nodes --- requires much less capacity from the network links than a bunch of separate point-to-point connections providing the same connectivity. In this paper, we consider dynamic multicast connections that can be used to model, for example, TV or radio delivery on a telecommunications network, such as an ATM network with virtual circuits. We show how to calculate the blocking probabilities of requests to join such a tree. First, we consider the blocking probabilities occurring in a single link. The resulting model is able to capture heterogeneous capacity requirements for different multicast channels. Then we extend the results to a whole network using the reduced load approximation. The accuracy of the approximation method is studied by simulations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
