Teletraffic Model for K-fold Multicast Network: Performance Evaluation with Buffer using M/M/n/n+q/N Kendal’s Notation

Md. Mahmudul Hasan
Most. Tajmary Mahfuz


This paper is an extended work of Hasan et al., (2012) where a teletraffic model was shown. In a previous research work, the authors presented a k fold multicast network with optimum output. Multicast has brought a change in network operation by providing bandwidth effective technology and reducing traffic loads. It is popular for performance optimization in a network. In this paper, a new model has been designed to establish a suitable value of the fold k of a k-fold multicast network under different traffic loads under Poisson traffic with finite queue at each node. Stationary distribution has been derived for the network states with the derivation of expressions for the network throughput and the blocking probability of the network. The research has explored that the network throughput increases very fast if the fold number is increased. However, at a certain value of the fold, the blocking probability stops to increase and it becomes constant. The study further discovered that as the offered traffic is increased, the throughput also increases. With the increase of system parameter k, the blocking probability decreases. Moreover, after an optimum value of k, the blocking probability becomes static for a particular value of the offered traffic.