Cost analysis and optimization for IP multicast group management

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/1 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 upstream routers. Furthermore, a formula is derived to calculate the optimal delay time for sending the pruning messages to minimize the multicast group management cost. To validate this cost analysis model, an IP multicast group management module is added to the NS-2 simulator to simulate the IP multicast group management. The simulation results under various system parameters are consistent with the results obtained by formal analyses, validating the proposed cost analysis model.

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

[2]  Brad Cain,et al.  Internet Group Management Protocol, Version 3 , 2002, RFC.

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

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

[5]  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).

[6]  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.

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

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

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

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

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

[12]  Tony Ballardie,et al.  Core Based Trees (CBT version 2) Multicast Routing - Protocol Specification - , 1997, RFC.

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

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

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

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

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

[18]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[19]  Yongjun Li,et al.  Optimizing IP Multicast through Delayed Multicast Tree Pruning , 2006, 2006 3rd International Conference on Broadband Communications, Networks and Systems.

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

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

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

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

[24]  EstrinDeborah,et al.  The STRESS method for boundary-point performance analysis of end-to-end multicast timer-suppression mechanisms , 2004 .

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