Methods for providing rendezvous point router redundancy in sparse mode multicast networks

• US 20030193958A1
• Filed: 04/11/2002
• Published: 10/16/2003
• Est. Priority Date: 04/11/2002
• Status: Abandoned Application

• Current Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Original Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Inventors: Narayanan, Vidya
• Application Number:
  US10/120,820
• Publication Number:
  US 20030193958A1
• Time in Patent Office: Days
• US Class Current: 370/400
• CPC Class Codes: H04L 12/18 for broadcast or conference , e.g. multicast
• CPC Class Codes: H04L 12/185 with management of multicast group membership
• CPC Class Codes: H04L 12/1881 with schedule organisation, e.g. priority, sequence management
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/16 Multipoint routing
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery

Abstract

Router elements R1, R2 of a packet network 100 using a sparse mode multicast protocol are configured as candidate rendezvous points (RPs). The candidate RPs use a virtual IP address. In each shared subnet, there is selected from among the candidate RPs a single designated candidate rendezvous point (DCRP) and zero or more virtual candidate rendezvous points (VCRPs). The DCRP serves as an active candidate RP (and when elected, performs RP functions); and the VCRP(s) serve as backup to the DCRP. The VCRP(s) maintain state information to facilitate rapid takeover of DCRP functionality upon failure of the DCRP. In one embodiment, geographically separate domains 1006, 1008 are each implemented with separate active DCRPs, defining multiple, simultaneously active anycast RPs (DCRP1, DCRP2) with MSDP peering between the DCRPs. The DCRP(s) may include backup VCRP(s) for redundancy.

Claims

1. In a packet network including a plurality of operably connected router elements, whereby in a sparse mode multicast protocol, one or more of the router elements are configured as candidate rendezvous points, and whereby two or more of the candidate rendezvous points share a common link, defining a shared subnet, a method comprising:

selecting, from among the candidate rendezvous points of the shared subnet, a single designated candidate rendezvous point (DCRP) and zero or more virtual candidate rendezvous points (VCRPs).

2. The method of claim 1, wherein the DCRP is eligible to serve as an active rendezvous point (RP) and the VCRPs serving as backup to the DCRP.

3. The method of claim 1, wherein the candidate rendezvous points of the shared subnet share a common IP address.

4. The method of claim 1, accomplished in PIM-SM protocol.

5. The method of claim 1, wherein the step of selecting a single DCRP and zero or more VCRPs comprises:

exchanging indicia of priority between the candidate rendezvous points of the shared subnet;

selecting a DCRP from among one or more candidate rendezvous points having a highest priority; and

designating as VCRPs, zero or more candidate rendezvous points not selected as DCRP.

6. The method of claim 5, further comprising exchanging IP addresses between the candidate rendezvous points of the shared subnet.

7. The method of claim 6, wherein upon any of the candidate rendezvous points having a null priority, the step of selecting a DCRP comprises:

determining the DCRP based on IP addresses of the candidate rendezvous points.

8. The method of claim 6, wherein upon two or more candidate rendezvous points sharing highest priority, the step of selecting a DCRP comprises:

determining the DCRP based on IP addresses of the two or more candidate rendezvous points.

9. The method of claim 6, wherein the steps of exchanging indicia of priority and exchanging IP addresses is accomplished by exchanging hello messages with RP option.

10. The method of claim 1, wherein the step of selecting yields a DCRP and one or more VCRPs, the method further comprising:

detecting failure of the DCRP, the failed DCRP thereby defining a former DCRP; and

selecting an acting DCRP from among the one or more VCRPs, yielding zero or more VCRPs.

11. The method of claim 10, further comprising:

detecting recovery of the former DCRP;

re-selecting the former DCRP as active DCRP;

re-assigning the acting DCRP as a VCRP; and

sending state information from the VCRP to the DCRP.

12. The method of claim 10, further comprising:

detecting recovery of the former DCRP;

assigning the former DCRP as a VCRP; and

sending state information from the DCRP to the VCRP.

13. In a packet network including a designated candidate rendezvous point (DCRP) and a virtual candidate rendezvous point (VCRP) on a shared subnet, the DCRP serving as an active rendezvous point (RP) for a multicast group according to a sparse mode multicast protocol, a method comprising:

receiving, by the DCRP, a control message comprising one of a Join message and Prune message associated with the multicast group;

determining, by the DCRP, whether the control message was received by the VCRP; and

if the control message was determined not to be received by the VCRP, sending the control message from the DCRP to the VCRP.

14. The method of claim 13 further comprising:

receiving, by the VCRP, a control message comprising one of a Join message and a Prune message associated with the multicast group;

determining, by the VCRP, whether the control message was received by the DCRP; and

if the control message was determined not to be received by the DCRP, sending the control message from the VCRP to the DCRP.

15. The method of claim 13 further comprising:

receiving, by the VCRP from the DCRP, a group information message associated with the multicast group;

extracting, by the VCRP, state information from the group information message.

16. The method of claim 15, wherein the group information message comprises:

a multicast IP address associated with the multicast group;

an IP address of at least one of a sending host and a receiving host of the multicast group; and

indicia of one of a Join message and Prune message.

17. In a packet network including a designated candidate rendezvous point (DCRP) and a virtual candidate rendezvous point (VCRP) on a shared subnet, the DCRP serving as an active rendezvous point (RP) for a multicast group according to a sparse mode multicast protocol, a method comprising:

receiving, by the DCRP, a data packet associated with the multicast group;

extracting, by the DCRP, state information from the data packet; and

sending the state information from the DCRP to the VCRP.

18. The method of claim 17 further comprising:

receiving, by the VCRP from the DCRP, a group information message associated with the multicast group;

extracting, by the VCRP, state information from the group information message.

19. The method of claim 18, wherein the group information message comprises:

a multicast IP address associated with the multicast group;

an IP address of at least one of a sending host and a receiving host of the multicast group; and

indicia of a data message.

20. In a packet network including a plurality of operably connected router elements, whereby in a sparse mode multicast protocol, one or more of the router elements are configured as candidate rendezvous points, and whereby a plurality of sets of candidate rendezvous points share respective common links, defining a plurality of shared subnets, a method comprising:

selecting, from among the candidate rendezvous points of each of the shared subnets, a single designated candidate rendezvous point (DCRP) and zero or more virtual candidate rendezvous points (VCRPs).

21. The method of claim 20, further comprising:

establishing a reliable message exchange protocol between the DCRP of each of the shared subnets.

22. The method of claim 21, wherein the step of establishing a reliable message exchange protocol comprises establishing an MSDP peering between the DCRP of each of the shared subnets.

23. The method of claim 20, further comprising:

detecting failure of a DCRP on at least one of the shared subnets, the failed DCRP thereby defining a former DCRP; and

selecting an acting DCRP from among the one or more VCRPs on the shared subnet of the former DCRP, yielding zero or more VCRPs on the shared subnet of the former DCRP.

24. The method of claim 23, further comprising:

establishing a reliable message exchange protocol between the acting DCRP and the DCRP of each of the other shared subnets.

25. The method of claim 24, wherein the step of establishing a reliable message exchange protocol comprises establishing an MSDP peering between the acting DCRP and the DCRP of each of the other shared subnets.

26. The method of claim 23, further comprising:

detecting recovery of the former DCRP;

re-selecting the former DCRP as active DCRP on the shared subnet of the former DCRP;

re-assigning the acting DCRP as a VCRP on the shared subnet; and

sending state information from the VCRP to the DCRP.

27. The method of claim 26, further comprising:

establishing a reliable message exchange protocol between the re-selected DCRP and the DCRP of each of the other shared subnets.

28. The method of claim 27, wherein the step of establishing a reliable message exchange protocol comprises establishing an MSDP peering between the re-selected DCRP and the DCRP of each of the other shared subnets.