Performance analysis of a random packet selection policy for multicast switching
Mazhar Ali, Shaying Yang · IEEE Transactions on Communications · 1996
This paper studies a random packet selection policy for multicast switching. An input packet generates a fixed number of primary copies plus a random number of secondary copies. Assuming a constant number of contending packets during a slot, the system is modeled as a discrete time birth process. A difference equation describing the dynamics of this process is derived, the solution of which gives a closed form expression for the distribution of the number of packets chosen. Then this result is extended to the steady state distribution through a Markov chain analysis. It is shown that the old packets have larger fanout than the fresh packets and the copy distribution of the mixed packets is determined. The packet and copy throughput taking into account the old packets have been obtained. We determined the mean packet delay as well as an upperbound for packet loss probabilities for finite buffer sizes. The asymptotic distribution of the number of packets is also given for large switch sizes under saturation by applying results from the renewal theory. Finally, simulations are done to determine the performance of the switch under mixed (unicast plus multicast) traffic.