Optimizing IP Multicast through Delayed Multicast Tree Pruning

This paper studies the system parameters that affect the total cost of managing the multicast group on a router. A Petri net model is first proposed to describe the states and transitions of the multicast group management. Based on this model, a delayed vacation queue, extended from a simple M/M/l queue, is used to analyze the total cost of the multicast group management under various system conditions. The formal analysis reveals that the total cost of the multicast group management is minimized when a router delays a certain time to send its pruning messages to upper stream routers. Furthermore, a formula is derived to calculate the optimal delay time for sending the pruning messages under various system parameters to minimize the multicast group management cost. Finally, cost analysis examples demonstrate how other system parameters, such as multicast member arrival rate and message sending costs, affect the total cost of the multicast group management under various delay times for sending the pruning messages.

[1]  Deborah Estrin,et al.  The STRESS method for boundary-point performance analysis of end-to-end multicast timer-suppression mechanisms , 2002, IEEE/ACM Transactions on Networking.

[2]  David Meyer,et al.  Administratively Scoped IP Multicast , 1998, RFC.

[3]  Kenji Suzuki,et al.  Analysis of Internet multicast traffic performance considering multicast routing protocol , 2000, Proceedings 2000 International Conference on Network Protocols.

[4]  Yasunori Dohi,et al.  New Petri net controller for distributed Petri net , 1998, IECON '98. Proceedings of the 24th Annual Conference of the IEEE Industrial Electronics Society (Cat. No.98CH36200).

[5]  J. J. Garcia-Luna-Aceves,et al.  The ordered core based tree protocol , 1997, Proceedings of INFOCOM '97.

[6]  John Moy,et al.  Multicast Extensions to OSPF , 1994, RFC.

[7]  Sonia Fahmy,et al.  Topology-aware overlay networks for group communication , 2002, NOSSDAV '02.

[8]  Kurt Rothermel,et al.  Optimal branching factor for tree-based reliable multicast protocols , 2002, Comput. Commun..

[9]  Michalis Faloutsos,et al.  Aggregated multicast: an approach to reduce multicast state , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[10]  Prasant Mohapatra,et al.  HostCast: a new overlay multicasting protocol , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[11]  Stephen E. Deering,et al.  Host extensions for IP multicasting , 1986, RFC.

[12]  Sergey Gorinsky,et al.  Robust Congestion Control for Multicast: Challenges and Opportunities , 2003 .

[13]  Bobby Bhattacharjee,et al.  Scalable application layer multicast , 2002, SIGCOMM '02.

[14]  Philippe Jacquet,et al.  Multicast tree structure and the power law , 2006, IEEE Transactions on Information Theory.

[15]  William C. Fenner.  Internet Group Management Protocol, Version 2 , 1997, RFC.

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

[17]  Tom Pusateri.  Distance Vector Multicast Routing Protocol , 2003 .

[18]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[19]  Brendan G. Cain,et al.  Core based trees (cbt version 3) multicast routing , 1998 .

[20]  Tony Ballardie,et al.  Core based trees , 1993 .

[21]  Jun-Hong Cui,et al.  A Viable Solution for Large Scale Multicast Support , 2005 .