RPIM-SM: extending PIM-SM for RP relocation

The protocol independent multicast-sparse mode (PIM-SM) protocol establishes core-base tree to forward multicast datagrams in a network. In PIM-SM, the core or rendezvous point (RP) of a group is determined at each multicast router by hashing a group address, i.e. a class-D IP address, to one of the candidate RPs. The hash function is characterized by its ability to evenly and uniquely choose the core for a group and remains insensitive to the geographic distribution of the group members and the sources. However, it may result in a multicast tree with high cost. This study presents a relocation mechanism, which is extension to PIM-SM, in which RP could be relocated periodically. When a new RP is found, the original RP informs all members to re-join to the new RP. Simulation results indicate that the extended version, RPIM-SM, reduces about 20% tree cost than PIM-SIM when the group size is medium. Moreover, comparing RPIM-SM with the optimal core-based tree reveals that they have less than 5% difference in tree cost. Furthermore, an increase of the number of candidate RPs brings RPIM-SM even closer to the optimal core-based tree. Results in this study demonstrate that relocation improve the performance of PIM-SM.

[1]  David Thaler,et al.  Distributed Center-Location Algorithms , 1997, IEEE J. Sel. Areas Commun..

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

[3]  David Thaler,et al.  A dynamic bootstrap mechanism for rendezvous-based multicast routing , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  John Matthew Simon Doar Multicast in the Asynchronous Transfer Mode Environment , 1993 .

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

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

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

[8]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[9]  Deborah Estrin,et al.  Protocol Independent Multicast Version 2 Dense Mode Specification , 1999 .

[10]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[11]  Bernard M. Waxman,et al.  Performance evaluation of multipoint routing algorithms , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.