Scalability Analysis Of Source Routing Multicast For Huge Numbers Of Groups

Source routing multicast has been gathering much more attention rather than traditional IP multicast, since it is thought to be more scalable in terms of the number of groups at the cost of higher traffic loads. This paper introduces a mathematical framework to analyze the scalability of source routing multicast and II multicast by leveraging previous multicast studies. We first analyze the amount of data traffic based on the small-world nature of networks, and show that source routing multicast can be as efficient as IP multicast if a simple header fragmentation technique (sub-grouping) is utilized. We also analyze scalability in terms of group numbers, which are derived under the equal budget assumption. Our analysis shows that source routing multicast is competitive for low bit-rate streams, like those in the publish/subscribe service, but we find some factors that offset the advantage. This is the first work to analytically investigate the scalability of source routing multicast.