论文信息 - Performance analysis of multicast routing algorithms

Performance analysis of multicast routing algorithms

This paper provides a theoretical performance analysis of different classes of multicast routing algorithms, namely the Shortest Path Tree, the Steiner Tree, compact routing and greedy routing. Our motivation is to determine the routing scheme which would yield the best trade-off between the stretch of the multicast routing paths, the memory space required to store the routing information and routing table as well as the communication cost. For this purpose, we also confront these results to those obtained by simulation on the CAIDA map of the Internet topology comprising 32k nodes.

[1] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[2] B. Huffaker,et al. Distance Metrics in the Internet , 2002, Anais do 2002 International Telecommunications Symposium.

[3] Martin Suter,et al. Small World , 2002 .

[4] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.

[5] Fan Chung Graham,et al. The Average Distance in a Random Graph with Given Expected Degrees , 2004, Internet Math..

[6] Dimitri Papadimitriou,et al. Dynamic Compact Multicast Routing on Power-Law Graphs , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[7] Eli Upfal,et al. A trade-off between space and efficiency for routing tables , 1989, JACM.

[8] Ittai Abraham,et al. Compact Multicast Routing , 2009, DISC.

[9] Christophe Diot,et al. Deployment issues for the IP multicast service and architecture , 2000, IEEE Netw..

[10] Mark E. J. Newman,et al. The Structure and Function of Complex Networks , 2003, SIAM Rev..

[11] Mark Handley,et al. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification , 1997, RFC.