A Markov chain model for replicate-at-send multicasting in shared-memory ATM switches

Replicate-at-send multicasting has the best performance of the multicasting schemes for shared-memory ATM switches. Specifically replicate-at-send-distinct address queue multicasting is the most adopted implementation because of its low hardware requirements. We present an analytical model for shared-memory switches with replicate-at-send-distinct address queue multicasting. Under various input traffic conditions the analytical model is shown to be accurate when compared to simulation results. We demonstrate that the model is accurate for a range of loads, with different ratios of multicast traffic and for a range of fanout sizes