On properties of multicast routing trees

✍ Scribed by Milena Janic; Piet Van Mieghem

• Publisher: John Wiley and Sons
• Year: 2006
• Tongue: English
• Weight: 321 KB
• Volume: 19
• Category: Article
• ISSN: 1074-5351
• DOI: 10.1002/dac.750

✦ Synopsis

In the last several years we witnessed the proliferation of multimedia applications on the Internet. One of the unavoidable techniques to support this type of communication is multicasting. However, even a decade after its initial proposal, multicast is still not widely deployed. One of the reasons is the lack of a solid business model. If the gain and the cost of multicast could be predicted, network operators might be encouraged to deploy multicast on a larger scale. In this paper we propose analytical expressions that could be used to estimate the gain of network-layer multicast. We show that the theoretical model matches extensive simulation and Internet measurement results remarkably well.

Furthermore, we examine the reliability of traceroute data and of traceroutes-based conclusions. We investigate the node degree distributions in the Internet maps obtained from CAIDA and RIPE and we show the divergency of our results with those obtained by other researchers. We further focus on the analysis of multicast trees based on traceroute data. Only few results have been available on the node degree distribution of multicast routing trees which provided contradictory conclusions. Our results seem to indicate that the node degrees follow power laws only for a large number of multicast users. Copyright