Improvement of Multicast Routing Protocol Using Petri Nets

Protocol Independent Multicast – Sparse Mode (PIM-SM) is the preferred multicast routing protocol currently. But it has the deficiency of high overhead of control messages and it needs to be improved. Stochastic Petri Nets is a soft computing technique that has been widely used in the area of performance evaluation. We improve PIM-SM protocol in this paper by use of Stochastic Petri Nets. The improvement mainly focuses on Register message, Join/Prune message and Bootstrap message. Experiments and analysis using Petri nets suggest that our improvement results in better performance than the current standard of PIM-SM protocol.

[1]  Wolfgang Reisig,et al.  Bibliography of Petri nets , 1986, European Workshop on Applications and Theory of Petri Nets.

[2]  Michael J. Donahoo,et al.  Scalable multicast representative member selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Eitan Altman,et al.  Optimal on-line estimation of the size of a dynamic multicast group , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  J. Bibb Cain,et al.  Performance and Resource Cost Comparisons for the CBT and PIM Multicast Routing Protocols , 1997, IEEE J. Sel. Areas Commun..

[5]  David Thaler,et al.  Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification , 1997, RFC.

[6]  John W. Byers,et al.  Smooth multirate multicast congestion control , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Piet Van Mieghem,et al.  Stability of a multicast tree , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Andrew Adams,et al.  Protocol Independent Multicast - Dense Mode (PIM-DM): Protocol Specification (Revised) , 2005, RFC.

[9]  Tony Ballardie,et al.  Core Based Trees (CBT) Multicast Routing Architecture , 1997, RFC.

[10]  Piet Van Mieghem,et al.  On the efficiency of multicast , 2001, TNET.

[11]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[12]  Deborah Estrin,et al.  Protocol independent multicast-sparse mode (pim-sm): specification , 1997 .

[13]  Ke Xu,et al.  Performance analysis of multicast routing protocol PIM-SM , 2005, Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop (AICT/SAPIR/ELETE'05).

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

[15]  Michel Diaz,et al.  Modeling and Analysis of Communication and Cooperation Protocols Using Petri Net Based Models , 1982, Comput. Networks.

[16]  Wuxu Peng,et al.  Improving the PIM routing protocol with adaptive switching mechanism between its two sparse sub-modes , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[17]  Gérard Berthelot,et al.  Petri Nets Theory for the Correctness of Protocols , 1982, PSTV.

[18]  Ying-Dar Lin,et al.  Extension of RP relocation to PIM-SM multicast routing , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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