Blocking probabilities in multiservice networks with unicast and multicast connections

Abstract

This paper is concerned with blocking probabili- ties in loss networks where both multicast and unicast con- nections are present. Each connection specifies a route and a bandwidth requirement. Multicast connections are point-to- multipont and allow transmission from one source to several receivers, any of which can join the connection at any time. Users that subscribe to the same data stream share one mul- ticast connection so that no additional bandwidth is re- quired. We present a Markov process model of a single net- work link. We also develop a convolution algorithm that finds the blocking probabilities on a single link and a re- duced load approximation for estimating end-to-end block- ing probabilities in a network.