CN115955430A - Multicast routing method and routing equipment - Google Patents

Abstract

The embodiment of the present application provides a multicast routing method and routing equipment, which relate to the field of communication technology and are used to solve the problem of deploying dual-homing protection on the access side and dual-root 1+1 protection on the multicast routing at the same time. There are four copies of the same traffic, causing the problem of bandwidth redundancy on the public network side, achieving the technical effect of reducing bandwidth redundancy on the public network side and reducing customer operating costs. The first routing message is received by the first node, the first routing message includes an extended community attribute, the extended community attribute includes root node information, and the root node information is used to indicate that the first node has root node capabilities, the first node is a standby leaf node, and the first node is a backup leaf node. A node enables the root node capability, sends root node information to the second node, the second node is the main leaf node, the first node receives the second routing message of the second node, and the second routing message is used to instruct the first node to send Two nodes deliver multicast traffic. The embodiment of the present application is used in the process of multicast routing.

Description

A multicast routing method and routing device

technical field

The embodiments of the present application relate to the field of communication technologies, and in particular, to a multicast routing method and routing equipment.

Background technique

Multicast is to use the multicast routing protocol to establish multicast routing table items hop by hop between the multicast receiver and the multicast source, and finally construct a multicast tree with the multicast source as the root and the multicast receiver as the leaf. Tree structure (that is, multicast distribution tree), multicast traffic starts from the root node and moves towards the direction of leaf nodes, and is replicated on each multicast router until it is sent to the multicast receiver. At present, in the multicast network, when the link between the leaf node and the root node fails, the traffic of the root node will not be transmitted to the leaf node. At this time, the multicast network will undergo a convergence process, that is, refresh the multicast routing table entry, and re-forward multicast traffic from the root node to the leaf node, but this process takes a long time to converge, resulting in a long waiting time for the multicast receiver to receive multicast traffic.

At present, a method of simultaneous deployment of dual-homing protection on the access side and dual-root 1+1 protection is proposed. There are two root nodes directly connected to the multicast source, one primary root node and one backup root node, which are also directly connected to the multicast receiving end. The connection has two leaf nodes, one primary leaf node and one standby leaf node. Two root nodes can forward four copies of multicast traffic to two leaf nodes through four links, including the main link and backup link from the active leaf node to the active and standby root nodes, and the backup link from the standby leaf node to the active and standby nodes. The main link and backup link of the root node, when the main link of the main leaf node fails, the multicast traffic can be forwarded to the receiving end through the remaining three links. However, since this method has four copies of the same traffic on the public network side (between the root node and the leaf node), it will cause bandwidth redundancy on the public network side, resulting in high operating costs for customers.

Contents of the invention

The embodiment of this application provides a multicast routing method and routing equipment, which can only occupy two links on the public network side during the multicast routing process where dual-homing protection and dual-root 1+1 protection are deployed simultaneously on the access side. It can reduce bandwidth redundancy on the public network side and reduce customer operating costs.

In order to achieve the above purpose, the embodiment of the present application adopts the following technical solutions:

In the first aspect, the embodiment of the present application provides a multicast routing method, the method includes: a first node receives a first routing message, the first routing message includes an extended community attribute, the extended community attribute includes root node information, and the root node information uses To indicate that the first node has the root node capability; the first node is a standby leaf node between the multicast source and the multicast receiver; the first node enables the root node capability, and sends root node information to the second node; The node is the main leaf node between the multicast source and the multicast receiver; the first node receives the second routing message from the second node, and the second routing message is used to instruct the first node to deliver multicast traffic to the second node .

Therefore, the multicast routing method provided by the present application carries the extended community attribute in the route, and the extended community attribute includes root node information, so that the first node (i.e., the standby leaf node) has the root node capability, and the first node uses Root Node Capability, as the root node (i.e. standby root node) of the second node (i.e. the primary leaf node) to deliver multicast traffic to the second node. Compared with the existing technology that strictly plans the cost value to control the transmission path of the primary and secondary root traffic, and in the scenario where each site is a multicast source for each other, there are still the same four bandwidth redundancy on the public network side, this application can Let the first node serve as the root node of the second node, make the second node receive multicast traffic from the first node, and realize the backup root traffic of the leaf nodes to share the path between the leaf nodes, so there are only two identical copies on the public network side traffic, which reduces the bandwidth redundancy on the public network side, reduces the customer's operating costs, and can still reduce the bandwidth redundancy on the public network side in the scenario where each site is a multicast source for each other.

In a possible design, the first node receiving the first routing message includes: the first node receiving the first routing message issued through the Border Gateway Protocol BGP, the first routing message is used to select the active leaf node and the standby leaf node primary root node and backup root node. Therefore, the first routing message can determine the primary root node and standby root node of the active leaf node and the standby leaf node. , so that there are the same four copies of bandwidth redundancy on the public network side. This application can configure the main leaf node and the backup leaf node as backup root nodes for each other, so that the backup root traffic of the leaf nodes can share the path between the leaf nodes. Therefore There are only two copies of the same traffic on the public network side, which reduces bandwidth redundancy on the public network side, reduces customer operating costs, and can still reduce bandwidth redundancy on the public network side in the scenario where each site is a multicast source for each other. Remain.

In a possible design, before the first node receives the second routing message of the second node, the method further includes: the first node sends a first tunnel establishment request to the second node, and the first tunnel establishment request is used to establish the first tunnel establishment request. A first tunnel between a node and a second node, the first tunnel is used to transfer multicast traffic between the first node and the second node. Thus, the first node transmits multicast traffic to the second node through the first tunnel between the first node and the second node by sending a tunnel establishment request, so that the backup root traffic of the leaf node is The shared path between leaf nodes reduces bandwidth redundancy on the public network side and reduces operating costs for customers.

In a possible design, when the second node carries an IGMP table and the first node does not carry an IGMP table, the method further includes: the first node receives the second route sent by the second node through the first tunnel After the message, the first node sends a local third routing message to the third node, the third node is the root node directly connected to the multicast source, and the third routing message is used to instruct the third node to deliver the multicast message to the first node flow. Thus, when there is no multicast traffic at the first node, the first node can send the second routing message to the third node (i.e. the root node directly connected to the multicast source) by receiving the second routing message from the second node The local third routing message, so as to lead the multicast traffic at the third node to the first node, so that the first node can transmit the multicast traffic to the second node, and realize that the backup root traffic of the leaf nodes is between the leaf nodes Therefore, the bandwidth redundancy on the public network side is reduced, and the operating cost of customers is reduced.

In a second aspect, the embodiment of the present application provides a multicast routing method, the method comprising: the second node receives root node information of the first node, and the root node information is used to indicate that the first node has a root node capability; the first node is The standby leaf node between the multicast source and the multicast receiver; the second node is the main leaf node between the multicast source and the multicast receiver; the second node sends the second routing message to the first node, and the second The routing message is used to instruct the first node to deliver multicast traffic to the second node.

Thus, in the multicast routing method provided by this application, the second node learns that the first node has the ability to serve as the root node by receiving the root node information sent by the first node, and the second node sends the second routing information to the first node. message, thereby being able to receive multicast traffic from the first node. Compared with the existing technology that strictly plans the cost value to control the transmission path of the primary and secondary root traffic, and in the scenario where each site is a multicast source for each other, the public network still has the same four bandwidth redundancy, this application Let the first node act as the root node of the second node, and the second node obtains multicast traffic from the first node, so that the backup root traffic of the leaf nodes is shared between the leaf nodes, thus reducing the bandwidth redundancy on the public network side , which reduces the customer's operating costs, and can still reduce the bandwidth redundancy on the public network side in the scenario where each site is a multicast source for each other.

In a possible design, the root node information is indicated by an extended community attribute, and the extended community attribute is included in the first routing message. The first routing message is received by the first node through the Border Gateway Protocol BGP. The first routing message The main root node and standby root node used to select the main leaf node and standby leaf node. Therefore, the first routing message can determine the main root node and backup root node of the main leaf node and the backup leaf node. , so that there are the same four copies of bandwidth redundancy on the public network side, this application can configure the main leaf node and the backup leaf node as backup root nodes for each other, so that the backup root traffic of the leaf nodes can share the path between the leaf nodes, so There are only two copies of the same traffic on the public network side, which reduces bandwidth redundancy on the public network side and reduces customer operating costs, and can still reduce bandwidth redundancy on the public network side in the scenario where each site is a multicast source for each other. Remain.

In a possible design, before the second node sends the second routing message to the first node, the method further includes: the second node receives the first tunnel establishment request of the first node, and the first tunnel establishment request is used to establish the first tunnel establishment request. The first tunnel between the node and the second node, the first tunnel is used to transfer multicast traffic between the first node and the second node. Thus, the second node establishes the first tunnel with the first node by receiving the tunnel establishment request sent by the first node, and the first node transmits multicast traffic to the second node through the first tunnel, so that the leaf The backup root traffic of the node is shared between the leaf nodes, which reduces the bandwidth redundancy on the public network side and reduces the customer's operating costs.

In a possible design, when the second node carries an IGMP table and the first node does not carry an IGMP table, the method further includes: the second node sends a second routing message to the first node through the first tunnel ; The second node receives the multicast traffic delivered by the first node. Therefore, when there is no multicast traffic at the first node, the second node sends a second routing message to the first node through the first tunnel, and obtains multicast traffic from the first node to realize the backup root of the leaf node Traffic is shared between leaf nodes, thus reducing bandwidth redundancy on the public network side and reducing operating costs for customers.

In a possible design, the second node sends a fourth routing message to the fourth node, the fourth node is the main root node of the second node, and the fourth routing message is used to instruct the fourth node to deliver multicast traffic to the second node ; The second node receives the multicast traffic delivered by the fourth node. Therefore, the second node can also send a fourth routing message to the fourth node (ie, the main root node), and obtain multicast traffic (ie, the main root traffic) from the fourth node.

In a third aspect, the embodiment of the present application provides a node, the node is a first node, and the first node includes: a receiving unit for receiving a first routing message, the first routing message includes an extended community attribute, and the extended community attribute Including the root node information, the root node information is used to indicate that the first node has the root node capability; the first node is a standby leaf node between the multicast source and the multicast receiver; the sending unit is used to enable the root node capability, Send root node information to the second node; the second node is the main leaf node between the multicast source and the multicast receiver; the receiving unit is also used to receive the second routing message of the second node, and the second routing message is used for The first node is instructed to deliver multicast traffic to the second node. The beneficial effect achieved in the third aspect can refer to the beneficial effect in the first aspect.

In a possible design, the receiving unit is also used to: receive the first routing message issued by the Border Gateway Protocol BGP, and the first routing message is used to select the main root node and the standby root node of the active leaf node and the standby leaf node.

In a possible design, before the first node receives the second routing message of the second node, the sending unit is further configured to: send a first tunnel establishment request to the second node, and the first tunnel establishment request is used to establish the first tunnel establishment request of the first node The first tunnel with the second node, the first tunnel is used to transfer multicast traffic between the first node and the second node.

In a possible design, the receiving unit is also used for: when the second node carries the network group management protocol IGMP table, and the first node does not carry the IGMP table, receive the second routing message sent by the second node through the first tunnel; The sending unit is also used to send a local third routing message to the third node, the third node is the root node directly connected to the multicast source, and the third routing message is used to instruct the third node to deliver multicast to the first node flow.

In a fourth aspect, the embodiment of the present application provides a node, the node is a second node, and the second node includes: a receiving unit, configured to receive root node information of the first node, and the root node information is used to indicate that the first node It has root node capability; the first node is the standby leaf node between the multicast source and the multicast receiver; the second node is the main leaf node between the multicast source and the multicast receiver; the sending unit is used to The first node sends a second routing message, and the second routing message is used to instruct the first node to deliver multicast traffic to the second node. The beneficial effects achieved in the fourth aspect can be referred to the beneficial effects in the second aspect.

In a possible design, the root node information is indicated by an extended community attribute, and the extended community attribute is included in the first routing message. The first routing message is received by the first node through the Border Gateway Protocol BGP. The first routing message The main root node and standby root node used to select the main leaf node and standby leaf node.

In a possible design, before the second node sends the second routing message to the first node, the receiving unit is further configured to: receive a first tunnel establishment request from the first node, and the first tunnel establishment request is used to establish the first tunnel establishment request of the first node The first tunnel with the second node, the first tunnel is used to transfer multicast traffic between the first node and the second node.

In a possible design, the sending unit is also used for: when the second node carries the network group management protocol IGMP table, and the first node does not carry the IGMP table, send the second routing message to the first node through the first tunnel; receive The unit is also used to receive the multicast traffic delivered by the first node.

In a possible design, the sending unit is also used to send a fourth routing message to the fourth node, where the fourth node is the main root node of the second node, and the fourth routing message is used to instruct the fourth node to transfer the routing message to the second node. Multicast traffic; the receiving unit is also configured to receive multicast traffic delivered by the fourth node.

In the fifth aspect, a computer-readable storage medium includes computer instructions, and when the computer instructions are run on the computer or the processor, the computer or the processor executes any possible design in the above-mentioned first aspect and the first aspect method or the above-mentioned second aspect and any possible design method in the second aspect.

In the sixth aspect, a computer program product, the computer program product includes computer instructions, and when the computer instructions are run on the computer or the processor, the computer or the processor executes any one of the above-mentioned first aspect and the first aspect. The design method of the above-mentioned second aspect and any possible design method in the second aspect.

For the beneficial effects corresponding to the above-mentioned other aspects, please refer to the description about the beneficial effects of the method, and will not repeat them here.

Description of drawings

Fig. 1 is a schematic diagram of a multicast routing;

Fig. 2 is a schematic diagram of a multicast routing;

Fig. 3 is a schematic diagram of a multicast routing;

FIG. 4A is a schematic diagram of a multicast routing;

FIG. 4B is a schematic diagram of a multicast routing;

Fig. 5 is a schematic diagram of a multicast routing;

FIG. 6 is a schematic diagram of an application scenario of a multicast routing method provided by an embodiment of the present application;

FIG. 7 is a schematic diagram of a hardware structure of an electronic device provided in an embodiment of the present application;

FIG. 8 is a schematic flowchart of a multicast routing method provided by an embodiment of the present application;

FIG. 9 is a schematic diagram of a multicast routing provided by an embodiment of the present application;

FIG. 10 is a schematic flowchart of a multicast routing method provided by an embodiment of the present application;

FIG. 11 is a schematic diagram of a transmission path of multicast traffic in a multicast routing method provided by an embodiment of the present application;

FIG. 12 is a schematic diagram of the structure and composition of an electronic device provided by an embodiment of the present application;

FIG. 13 is a schematic diagram of the structure and composition of an electronic device provided by an embodiment of the present application.

Detailed ways

In order to facilitate understanding, descriptions of some concepts related to the embodiments of the present application are provided by way of example for reference. As follows:

Customer edge router (customer edge, CE): customer edge equipment, the customer end router to which the service provider is connected. The CE router provides service access for users by connecting one or more provider edge routers (PE). A CE router is usually an Internet Protocol (IP) router, and it establishes an adjacency relationship with a connected PE router. In the embodiment of the present application, the CE router may be a multicast source or a multicast receiver.

Provider edge router (provider edge, PE): is the edge device of the provider, the edge router of the service provider backbone network, equivalent to the label edge router (label) in the multi-protocol label switching (multi-protocol label switching, MPLS) network edge router, LER). The PE router connects the CE router and the carrier's backbone router (provider, P), and is the most important network node. User traffic flows into the user network through the PE router, or flows to the MPLS backbone network through the PE router. In this embodiment of the present application, the PE router may be a root node or a leaf node directly connected to the CE router.

Provider backbone router (provider, P): is the core layer equipment, provider router, and service provider is the backbone network routing device not connected to any CE router, which is equivalent to label switching router (label switching router, LSR). In the embodiment of the present application, the P router is a P node connecting the root node and the leaf nodes.

Cost (cost) value: refers to the cost of reaching the destination address indicated by a certain route, which can be set manually or automatically. In the embodiment of this application, when routing, the multicast traffic will be delivered according to the path with the smallest cost value.

Dual-homing protection on the access side: Set two leaf nodes directly connected to the multicast receiver in the multicast network, one as the primary leaf node and the other as the backup leaf node, and the root node directly connected to the multicast source will send Both the active leaf node and the standby leaf node transmit multicast traffic. When the link from the root node to the main leaf node is normal, only the main leaf node will pass the multicast traffic to the multicast receiving end, and the standby leaf node will not pass the multicast traffic to the multicast receiving end. In the event of an overall failure of the primary leaf node, the standby leaf node will deliver multicast traffic to the multicast receiver. Therefore, when the main leaf node fails as a whole, the multicast receiving end can quickly receive multicast traffic, avoiding a long waiting time for the multicast receiving end.

Dual-root 1+1 protection: Set two root nodes directly connected to the multicast source in the multicast network, one as the primary root node and the other as the backup root node, both the primary root node and the backup root node will communicate with the multicast receiver Directly connected leaf nodes pass multicast traffic. When the link from the main root node to the leaf node is normal, the leaf node will pass the multicast traffic received from the main root node to the multicast receiving end, and the leaf node will not pass the multicast traffic received from the standby root node to the multicast receiving end. broadcast traffic. When the link from the primary root node to the leaf node fails, the leaf node will transmit the multicast traffic received from the standby root node to the multicast receiving end. Therefore, when the link from the main root node to the leaf node fails, the multicast receiving end can quickly receive the multicast traffic, avoiding the long waiting time of the multicast receiving end.

The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application. Among them, in the description of the embodiments of this application, unless otherwise specified, "/" means or means, for example, A/B can mean A or B; "and/or" in this article is only a description of associated objects The association relationship of indicates that there may be three kinds of relationships, for example, A and/or B may indicate: A exists alone, A and B exist simultaneously, and B exists independently. In addition, in the description of this embodiment, unless otherwise specified, "plurality" means two or more.

Hereinafter, the terms "first" and "second" are used for descriptive purposes only, and cannot be understood as indicating or implying relative importance or implicitly specifying the quantity of indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of these features.

Bit index explicit replication internet protocol version 6 encapsulation (BIERv6) of Internet Protocol version 6 network encapsulation is a multicast technology that currently exists in the multicast field. In the Internet protocol version 6 (internet protocol version 6, IPv6) network, that is, the public network is an IPv6 network, the encapsulation of the local IPv6 (native IPv6) network is used to carry multicast services, such as public network multicast and multicast virtual Private network (multicast virtual private network, MVPN) multicast service, etc. The interior gateway protocol (IGP) uses IS-IS for IPv6 to establish a BIERv6 forwarding table, the border gateway protocol (border gateway protocol, BGP) uses the IPv6 transmission control protocol (transmission control protocol, TCP) to establish connections, and uses BGP- MP publishes routes of various address families such as vpnv4, vpnv6, unicast4, unicast6, mvpn4 or mvpn6.

When BIERv6 transmits information at the BGP level, the MVPN over BIERv6 (multicast VPN service iteration to BIERv6 tunnel) control message is used to realize the automatic discovery of MVPN members, establish and maintain the selective operator multicast service interface (provider mmulticast service interface, PMSI) The tunnel transmits the customer multicast route (Customer multicast route, C-multicast route) so as to realize functions such as private network multicast members joining and leaving. Among them, BGP MVPN routes are divided into 7 types, namely multicast virtual private network A-D (multicast virtual private network auto-discovery, MVPN A-D) routes (including 5 types of routes) and C-multicast routes (including 2 types of routes). MVPN A-D routing is mainly used for automatic discovery of MVPN members and assisting MPLS in establishing PMSI tunnels. The C-multicast route is the multicast route from the private network, which is mainly used to initiate private network users to join, leave and guide the transmission of private network multicast data traffic. Among them, the C-multicast route carries C-multicast Import RT, that is, the VRF Route Import Extended Community to the multicast source unicast route. Import RT is mainly used in multiple sender PEs (Sender PEs) to help sender sites PE (Sender Site PE) identifies whether the BGP C-multicast route sent by the receiver site PE (ReceiverSite PE) should be processed by itself, and which VPN instance routing table the route should be installed in. C-multicast routing supports the VPN-IP routing (private network IPv4 unicast routing transmitted by BGP VPNv4) issued by the PE of MVPN, which contains the C-multicast Import RT attribute, which belongs to the extended community attribute of IP type and is mainly used for C-multicast This attribute must be carried when the VPN-IP route of the private network or rendezvous point (RP) is advertised, but other routes do not need to carry this attribute.

Referring to FIG. 1 , the process of multicast routing is roughly introduced. Among them, the VPNv4 route released by the root node (Root) to the leaf node (Leaf) contains the VRF Route Import Extended Community (hereinafter referred to as VRFImport RT) attribute, and the Leaf is sending a BGP C-multicast route (BGP C multicast route) to the Root This attribute will be attached to the route, so when there are multiple Roots, the Root that receives the BGP C-multicast route can identify whether the BGP C-multicast route sent by the Leaf should be handled by itself, and the route Which VPN instance routing table should be installed.

The value format of VRF Import RT is Administrator field: Local Administratorfield, where the value of Administrator field is the local MVPN ID, and the Local Administrator field is the identifier of the Sender PE local VPN instance (VRF Index ID).

As shown in Figure 1, both PE1 and PE2 are roots, and PE3 is a leaf. Both PE1 and PE2 are connected to vpn1 and vpn2, the RF Import RT of vpn1 on PE1 is 1.1.1.9:1, the RF Import RT of vpn2 is 1.1.1.9:2; the RFI Import RT of vpn1 on PE2 is 2.2.2.9:1, vpn2 The RF Import RT is 2.2.2.9:2.

After PE1 and PE2 have established BGP MVPN address family BGP neighbors with PE3, both PE1 and PE2 will advertise the VPNv4 route to the multicast source 192.168.1.2 to PE3. At this time, the VRF Import RT carried in the VPNv4 route advertised by PE1 is 1.1. 1.9:1, the VRF Import RT carried by the VPNv4 route published by PE2 is 2.2.2.9:1, after PE3 receives the VPNv4 route, it will install the preferred route into the routing table of vpn1, and then store the RF Import RT of the route , used to construct a BGP C-multicast route.

Assume that the preferred route is advertised by PE1, that is, the RF Import RT of the route is 1.1.1.9:1. When PE3 receives CE3's PIM join message, it will construct a BGP C-multicast route, and then send it to PE1 and PE2. The route carries the Rt-import attribute, and the value is the previously stored RF Import RT, which is 1.1. 1.9:1. When PE1 receives the BGPC-multicast route, it finds that the Administrator field in the Rt-import attribute of the BGP C-multicast route is 1.1.1.9, which is the local MVPN ID, so it receives this route and finds that the Local Administrator field is 1, so it will This route is installed into the routing table of vpn1.

When PE2 receives the BGP C-multicast route, it finds that the Administrator field in the Rt-import attribute of the BGP C-multicast route is 1.1.1.9, which does not match the local MVPN ID 2.2.2.9, so it discards the BGP C-multicast route, do not process.

In the MVPN over BIERv6 scenario, when a node or link fails, the multicast service can only be restored after the BGP neighbor converges, and the BGP neighbor failure takes a long time to converge, which makes it difficult to meet the requirements of high reliability multicast services . Therefore, by configuring BFD for BGP, the convergence time of BGP faults can be reduced to a certain extent, thereby speeding up the fault convergence of multicast services. To further improve the convergence performance of multicast services, a dual-root 1+1 protection scheme is deployed.

For example, the MVPN over BIERv6 dual-root 1+1 protection scheme is deployed as shown in Figure 2, and two Sender PEs, namely Root1 and Root2, are deployed at the same time. Create PMSI tunnels with themselves as bit forwarding ingress routers (BFIR) in Root1 and Root2 respectively, and Leaf is the leaf node of these two tunnels.

Deploy VPN Fast ReRoute (FRR) in the Leaf so that there are two primary and secondary routes from the Leaf to the same multicast source. The route advertised by Root1 is the active route, and the route advertised by Root2 is the backup route.

Deploy the private network multicast fast rerouting (C-multicast FRR) function in Leaf, and specify the detection method as traffic detection. When the link is normal, the same multicast data traffic is forwarded along the active and standby links at the same time. The leaf node PE1 will receive the primary tunnel traffic with Root1 as the BFIR, and discard the backup tunnel traffic with Root2 as the BFIR.

Based on the above principles, when deploying the MVPN Over BIERv6 dual-root 1+1 protection scheme, it is recommended to ensure that the paths of the active tunnel and the backup tunnel are separated as far as possible, so as to avoid the long-term interruption of multicast services caused by the failure of the two tunnels at the same time. However, the current technical implementation can only be avoided by planning the IGP cost (cost) value, which has relatively large restrictions on scenarios.

At present, the simultaneous deployment of dual-homing protection on the access side and dual-root 1+1 protection will result in four copies of the same multicast traffic on the public network side, as shown in Figure 3, Figure 4A, and Figure 4B. Figure 3 shows the scenario where the alternate root traffic of two leaf nodes is shared between two root nodes. For leaf node-1 (Leaf-1), root node-1 (Root-1) is the main root , the link from Root-1 to Leaf-1 is the primary link, the root node-2 (Root-2) is the backup root, and the link from Root-2 to Leaf-1 is the backup link. For leaf node-2 (Leaf-2), Root-2 is the main root, the link from Root-2 to Leaf-2 is the main link, Root-1 is the backup root, and the link from Root-1 to Leaf-2 The road is the backup link. In Figure 3, the traffic on the primary link of Leaf-1 (the link from Root-1 to Leaf-1) is from Root-1 to P-1 and then to Leaf-1, and the traffic on the backup link of Leaf-1 (Root-1 2 to Leaf-1 link) traffic is from Root-2 to Root-1 to P-1 and finally to Leaf-1, the main link of Leaf-2 (Root-2 to Leaf-2 link The traffic in ) is from Root-2 to P-2 and then to Leaf-2, and the traffic in the standby link of Leaf-2 (the link from Root-1 to Leaf-2) is from Root-1 to Root-2 Then to P-2 and finally to Leaf-2. It can be seen that the multicast traffic at the root node has two directions. Taking Root-1 as an example, one direction is from Root-1 to Leaf-1, and the other direction is from Root-1 to Root-2. Therefore, the backup root traffic of Leaf-1 and Leaf-2 will share the path between Root-1 and Root-2, so that there are four copies of the same multicast traffic on the public network side (between the root node and the leaf node).

Figure 4A and Figure 4B show the scenario where the backup root traffic of two leaf nodes is shared between two P nodes, and Figure 4A and Figure 4B represent the same meaning, where the main The backup root is the same as that in Figure 3, and the traffic transmission paths in the main links of Leaf-1 and Leaf-2 are also the same as in Figure 3, so we won't repeat them here. In Figure 4A and Figure 4B, the traffic in the backup link of Leaf-1 (the link from Root-2 to Leaf-1) is from Root-2 to P-2 to P-1 and finally to Leaf-1, Leaf- The traffic on the backup link of 2 (the link from Root-1 to Leaf-2) is from Root-1 to P-1, then to P-2, and finally to Leaf-2. Therefore, the backup links of Leaf-1 and Leaf-2 Root traffic will be shared between P-1 and P-2. It can be seen that the multicast traffic at the P node has two directions. Taking P-1 as an example, one direction is from P-1 to Leaf-1, and the other direction is from P-1 to P-2. Therefore, the backup root traffic of Leaf-1 and Leaf-2 share the path between the two P nodes, and since the multicast traffic at the root node has only one direction, it is equivalent to the link from Root-1 to P-1 There is only one copy of multicast traffic on the Internet, so compared to the bandwidth redundancy in Figure 3, the bandwidth redundancy in Figure 4A and Figure 4B will be reduced, but the connection between the P node and the leaf node on the public network side is still There are four copies of the same multicast traffic.

When dual-homing protection on the access side and dual-root 1+1 protection are deployed at the same time, the ideal scenario is that the backup root traffic of the two leaf nodes shares the path between the two leaf nodes, as shown in Figure 5, where The primary and backup roots of Leaf-1 and Leaf-2 are the same as in Figure 3, Figure 4A and Figure 4B, and the traffic transmission paths in the main links of Leaf-1 and Leaf-2 are also the same as those in Figure 3 and Figure 4A and Figure 4B The same, so I won't go into details here. In Figure 5, the traffic on the link from Root-2 to Leaf-1 is from Root-2 to P-2 to Leaf-2 and finally to Leaf-1, and the traffic on the link from Root-1 to Leaf-2 is From Root-1 to P-1 to Leaf-1 and finally to Leaf-2. It can be seen that the multicast traffic at the leaf node has two directions. Taking Leaf-1 as an example, one direction is from Leaf-1 to Leaf-2, and the other direction is from Leaf-1 to the multicast receiver ( Not shown in Figure 5), so the backup root traffic of Leaf-1 and Leaf-2 will share the path between Leaf-1 and Leaf-2, so that there are only two copies of the same multicast traffic on the public network side, which can effectively Reduce bandwidth redundancy on the public network side and reduce customer operating costs.

In order to control the routing transmission path of multicast traffic, it is necessary to strictly plan the cost value in the multicast network to ensure that the paths of the primary link and the backup link are separated, so as to avoid the long-term interruption of multicast services caused by the simultaneous failure of the primary and backup links Condition. Since the multicast traffic will be transmitted according to the path with the smallest cost value during routing, in order to make the routing transmission path of the multicast traffic as shown in Figure 5, that is, the alternate root traffic of the two leaf nodes is shared between the two leaf nodes. When planning the cost value, it is necessary to make the cost value of the link between the two leaf nodes smaller than the cost value of the link between the two root nodes and the cost value of the link between the two P nodes . For example, in Figure 5, set the cost value of the link between the two leaf nodes to 800, set the cost value of the link between the two P nodes to 1000, and set the cost value of the link between the two root nodes to The value is set to 1000. Since the link from Root-2 to Leaf-1 uses the path from Root-2 to P-2 to Leaf-2 and finally to Leaf-1, the cost value of the multicast traffic is the smallest, so this Planning the cost value can make the backup root traffic of the two leaf nodes share the path between the two leaf nodes.

However, planning the cost value in the multicast network still cannot avoid the problem of bandwidth redundancy on the public network side in some scenarios. The identity of the multicast receiver can be switched, that is, the multicast source can also be the multicast receiver, and the multicast receiver can also be the multicast source. Therefore, if the cost value in the multicast network is planned as shown in Figure 5, when When the identities of the multicast source and the multicast receiver are swapped, the scene in Figure 3 that the standby root traffic of the two leaf nodes is shared between the two root nodes still occurs, so that there are four copies of the same multicast traffic on the public network side. traffic, which cannot solve the problem of bandwidth redundancy on the public network side.

Therefore, this application proposes a multicast routing method. Considering that in the prior art, when dual-homing protection on the access side and dual-root 1+1 protection are deployed at the same time, there are four copies of the same traffic on the public network side, resulting in bandwidth redundancy on the public network side. In the scenario of multicast routing where dual-homing protection and dual-root 1+1 protection are deployed at the same time, by making the leaf nodes mutually designated root nodes, the backup root traffic of the leaf nodes can share the path between the leaf nodes, making the public network side There are only two copies of the same traffic, so the bandwidth redundancy on the public network side is reduced, the customer’s operating costs are reduced, and the bandwidth redundancy on the public network side can still be reduced in the scenario where each site is a multicast source for each other .

As shown in Figure 6, the multicast routing method proposed in the embodiment of the present application can be applied to the scenario of multicast routing, specifically the scenario of multicast routing where dual-homing protection and dual-root 1+1 protection are deployed at the same time on the access side , this scenario includes multiple routers. Specifically, some routers among the multiple routers can be CE routers, some routers can be PE routers, some routers can be P routers, etc. CE routers can be multicast sources or group The PE router can be the root node directly connected to the multicast source, or the leaf node directly connected to the multicast receiver. In Figure 6, the multicast network includes two P routers, two CE routers, and four PE routers as an example. Among the two CE routers, one CE router is used as the multicast source, and the other CE router is used as the multicast receiver. The broadcast source is used to provide services for the multicast receiver and deliver the multicast traffic to the multicast receiver. The multicast receiver is used to provide service access for users and receive the multicast traffic delivered by the multicast source. Two of the four PE routers serve as root nodes. The two root nodes include a primary root node and a backup root node. The other two serve as leaf nodes. The two leaf nodes include a primary Receive the multicast traffic of the multicast source, and deliver the multicast traffic of the multicast source to the leaf node, and the leaf node is used to deliver the multicast traffic to the multicast receiver. For example, the multicast source can be understood as a TV station, and the multicast receiver can be understood as a user. When a user orders a TV program, it is equivalent to the user ordering a TV program from the main leaf node. The multicast traffic of the TV station (the data of the TV program ) will be passed to two leaf nodes through two root nodes, and the main leaf node in the two leaf nodes will pass the multicast traffic to the user.

The multicast routing method proposed in the embodiment of this application can be applied to the BIERv6 MVPN introduced above, and can also be applied to MVPNs such as BIERv4 and MPLS, which are not limited in this application.

As shown in FIG. 7 , an embodiment of the present application proposes a schematic diagram of a hardware structure of an electronic device. The electronic device may be a routing device, such as the electronic device 700 shown in FIG. 7 . The electronic device 700 may include a processor 701, a memory 702, a communication interface 703, and the like.

It can be understood that, the structure illustrated in the embodiment of the present application does not constitute a specific limitation on the electronic device 700 . In other embodiments of the present application, the electronic device 700 may include more or fewer components than shown in the illustration, or combine some components, or separate some components, or arrange different components. The illustrated components can be implemented in hardware, software or a combination of software and hardware.

Processor 701 may include one or more processing units. For example: the processor 701 may include a graphics processing unit (graphics processing unit, GPU), a central processing unit (central processing unit, CPU), a controller, and/or a neural network processor (neural network processing unit, NPU), etc. Wherein, different processing units can be independent components, and can also be integrated in one or more processors. In some embodiments, the electronic device 700 may also include one or more processors 701. In the embodiment of the present application, the processor 701 may execute or read instructions or information stored in the memory 702, and process information transmitted by the communication interface 703.

Wherein, the processor 701 is the nerve center and command center of the electronic device 700 . According to the instruction opcode and timing signal, the operation control signal can be generated to complete the control of fetching and executing instructions.

Memory 702 may be used to store one or more computer programs comprising instructions. The processor 701 may run the above-mentioned instructions stored in the memory 702, so that the electronic device 700 executes the calculation method of the load factor of the data center provided in some embodiments of the present application, etc. Memory 702 may include code storage and data storage. Wherein, the data storage area can store data created during the use of the electronic device 700 and the like. In addition, the memory 702 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more disk storage components, flash memory components, universal flash storage (universal flash storage, UFS) and the like. In the embodiment of the present application, the memory 702 may store multicast routing entries, configuration codes, and the like.

The communication interface 703 can be used to communicate with external equipment, and can be one or more devices integrating at least one communication processing module. In the embodiment of the present application, the communication interface 703 may communicate with communication interfaces of other nodes.

Using the above-mentioned electronic device 700 provided by the present application, in the multicast routing method proposed by the present application for the electronic device 700 in conjunction with the accompanying drawings, in the multicast routing, by making the leaf nodes mutually designated root nodes, so that the leaf nodes The process of the backup root traffic co-pathing between the leaf nodes is introduced.

As shown in FIG. 8, it is a schematic flow diagram of a multicast routing method provided by the embodiment of the present application, and the method is applied to electronic equipment. Taking the hardware structure of the electronic device 700 shown in FIG. 7 as an example, the method includes:

Step 801, the first node receives a first routing message.

Wherein, the first node is a leaf node directly connected with the multicast receiving end, as a standby leaf node between the multicast source and the multicast receiving end, the first node may be a PE router. The first routing message is the routing message issued by the second node to the first node. The second node is a leaf node directly connected to the multicast receiving end, and serves as the main leaf node between the multicast source and the multicast receiving end. The second node may be a PE router. The first routing message includes the extended community attribute, which can be understood as carrying the extended community attribute in the first routing message. For example, when the multicast network is a BIERv6 network, the IPv6 extended community attribute carried in the first routing message is VRF Route Import Extended Community, in addition, BGP VPNv4 unicast routing information etc. can also be included in the first routing message. The extended community attribute includes root node information, which can be understood as the extended community attribute can be used to identify the root node. The root node information can be, for example, the root node identifier. The root node information is used to indicate that the first node has the root node capability. It can be understood that the first node can serve as the root node of the leaf node and transmit multicast traffic to the leaf node. It can also be understood as The next hop node of the route from the leaf node to the multicast source may be the first node.

In some embodiments, the first node receiving the first routing message includes: the first node receiving the first routing message published through the Border Gateway Protocol BGP.

Wherein, the first routing message is a routing message issued by the second node through a border gateway protocol (border gateway protocol, BGP), and the first routing message may be a multicast virtual private network A-D (multicast virtual private network auto-discovery, MVPN A-D) Route messages. MVPN A-D routing is used for automatic discovery of MVPN members and assisting MPLS in establishing provider multicast service interface (PMSI) tunnels. Carrying extended community attributes in MVPN A-D routes can make the nodes that MVPN A-D routes pass through Both carry root node information, so that these nodes have the ability to be root nodes, which can be regarded as paving the way for the subsequent designated root. Therefore, the main root node and backup root corresponding to the leaf node can be selected by carrying the extended community attribute in the MVPN A-D route. node, it can be understood that the first routing message is used to select the primary root node and standby root node of the primary leaf node and standby leaf node.

Exemplarily, as shown in Figure 9, the first node may be leaf node-2 (standby leaf node), and leaf node-2 receives the MVPN A-D route issued by BGP, and the MVPN A-D route carries the extended community attribute, the extended community The attribute carries the root node information, so the leaf node-2 has the ability to be the root node.

Step 802, the first node enables the root node capability, and sends root node information to the second node.

Wherein, the second node is a leaf node directly connected with the multicast receiving end, as the main leaf node between the multicast source and the multicast receiving end, and the second node may be a PE router. After the first node has the root node capability, the first node enables the root node capability, sends root node information to the second node, and the second node receives the root node information of the first node. It can be understood that the first node can serve as the first node The root node of the second node, that is, the first node is the designated root node, so that the second node can know that the first node has the ability to be a root node. Specifically, the first node first enables the root node capability, and then associates by specifying the MVPN-id of the backup root. The node first executes the code assigned sender-enable that enables the capability of the root node, and then executes the code backup root mvpn MVPN-id associated with the MVPN-id of the backup root, so that the capability of the root node can be enabled and the MVPN-id of the backup root can be associated , and then send root node information to the second node, which is equivalent to designating the first node as the designated root node of the second node (designated backup root node).

Exemplarily, as shown in Figure 9, the first node can be a leaf node-1 (main leaf node), and the leaf node-2 enables the root node capability, and sends root node information to the leaf node-1, so that the leaf node -1 can learn that leaf node-2 has the ability to be the root node, so leaf node-2 is selected as the backup root.

After the second node receives the root node information of the first node, it can know that the first node has the ability to be a root node, so it can select the first node as the root node (standby root node) of the second node.

Step 803, the first node receives the second routing message from the second node.

Wherein, the second node sends a second routing message to the first node, and the second routing message is used to instruct the first node to deliver multicast traffic to the second node. For example, the second routing message can be a customer-multicast route (customer-multicast route, C-multicast route) message for user-side multicast, also known as C-multicast routing message, including the joining information of multicast members in the C-multicast routing message, C group Multicast routing is used to initiate private network users to join, leave and guide private network multicast data traffic transmission. The extended community attribute included in the first routing message in step 801 is the extended community attribute required when performing C multicast routing, it can be understood that the extended community attribute can be used to determine the root node when performing C multicast routing, so as to Root node sends C multicast routing message. The second node sends the C multicast route to the first node. After the first node receives the second route message from the second node, the first node can pass the multicast traffic to the second node, which is equivalent to the first node as the second node. The root node of a node can be understood as the first node as the backup root node of the second node.

Exemplarily, as shown in Figure 9, the leaf node-1 sends the second routing message to the leaf node-2, and the leaf node-2 receives the second routing message of the leaf node-1, so the leaf node-2 can transmit the multicast The traffic is sent to leaf node-1 as the root node (standby root node) of leaf node-1.

In some embodiments, before step 803, the method further includes: the first node sends a first tunnel establishment request to the second node, and the second node receives the first tunnel establishment request of the first node.

Wherein, the first tunnel establishment request can be, for example, an MVPN AD route, and the first tunnel establishment request is used to establish a first tunnel between the first node and the second node. The first tunnel can be, for example, a PMSI tunnel, and the first tunnel uses To transmit multicast traffic between the first node and the second node, it can be understood that leaf node-1 needs to transmit multicast traffic to leaf node-2 through the first tunnel.

Exemplarily, as shown in Figure 9, the leaf node-2 sends the first tunnel establishment request to the leaf node-1, and after the leaf node-1 receives the first tunnel establishment request sent by the leaf node-2, it sends a tunnel establishment request to the leaf node-2. Send the first tunnel establishment request response. Taking the BIERv6 network scenario as an example, the root node (leaf node-2) sends an Intra-AS I-PMSI A-D route to the root node ((leaf node-1) through the BGP neighbor relationship. This route carries the following information, MVPN RT( RouteTarget), PMSI Tunnel Attribute. After the leaf node receives the route sent by the root node, it responds to Leaf A-Droute. The route carries the following information, Sub-domain-id, BFR-ID, BFR-prefix. The root node receives After the route sent by the leaf node, record the leaf node members of the MVPN, and set the bit position corresponding to each leaf node in the BIERv6 bit string corresponding to the tunnel to 1, so as to add each leaf node to the BIERv6 I-PMSI tunnel, so that the root node (leaf node- 2) The first tunnel with the leaf node (leaf node-1) is established.

In some embodiments, when the second node carries an Internet Group Management Protocol (Internet Group Management Protocol, IGMP) table and the first node does not carry the IGMP table, the second node sends the second routing message to the first node through the first tunnel, The first node sends a local third routing message to the third node, and the second node receives the multicast traffic delivered by the first node.

Wherein, the IGMP table is used to transfer the joining information of the multicast member, and the joining information of the multicast member may be, for example, PIM (C-*, C-G) or PIM (C-S, C-G), which is used to guide the multicast traffic. Under normal circumstances, when a multicast member joins the multicast network (generally joins the multicast network from the main leaf node directly connected to the multicast receiving end), an IGMP table will be generated at the main leaf node, using In addition, the remote backup profile (RBP) in the IGMP table will also back up an IGMP table at the standby leaf node, so that the standby leaf node can also know the multicast members join information. When the leaf node receives the joining message of the multicast member, it will generate a PIM Join message through the PIM protocol, and then publish the C multicast route to the multicast source through the BGP neighbor relationship. It can be understood that when the leaf node has a multicast member joining The leaf node needs to obtain multicast traffic from the multicast source and pass it to the multicast receiver. Therefore, if the leaf node does not carry the IGMP table, the leaf node cannot obtain the joining information of the multicast member, and thus cannot obtain the group traffic from the multicast source. broadcast traffic. When the second node carries the IGMP table and the first node does not carry the IGMP table, it can be understood that the second node can obtain multicast traffic from the multicast source, but the first node cannot obtain multicast traffic from the multicast source, that is There is no multicast traffic at the first node, so the first node needs to direct the multicast traffic from the multicast source to the first node, specifically, direct the multicast traffic to the first node from the root node directly connected to the multicast source A node that enables the root node to pass the multicast traffic to the first node.

Since there is no multicast traffic at the first node, when the second node sends the second routing message to the first node through the first tunnel, the second node cannot obtain the multicast traffic from the first node. At this point, the first node will convert the second routing message received from the second node into a local third routing message. The third routing message can be, for example, a C multicast routing message for leading multicast traffic. The first node sends a local third routing message to the third node. The third node is the root node directly connected to the multicast source. The third node can be a PE router. It can be understood that the first node receives the third routing message through the first tunnel. After the second routing message sent by the second node, a local third routing message is sent to the third node, and the third routing message is used to instruct the third node to deliver multicast traffic to the first node, which is equivalent to the first node sending multicast traffic from the first node The multicast traffic obtained at the three nodes is transmitted to the second node, and the second node receives the multicast traffic transmitted by the first node.

Exemplarily, as shown in Figure 9, the third node can be root node-2 or root node-1, taking the third node as root node-2 as an example, when leaf node-1 carries an IGMP table, leaf node-2 When the IGMP table is not carried, leaf node-1 sends a second routing message to leaf node-2 to direct multicast traffic from leaf node-2, and leaf node-2 receives the second routing message sent by leaf node-1 , will convert the second routing message into the local third routing message, and the leaf node-2 will send the local third routing message to the root node-2 to guide the multicast traffic from the root node-2, and then send the multicast traffic from the root node-2 The multicast traffic received at node-2 is transmitted to leaf node-1, and leaf node-1 receives the multicast traffic transmitted by leaf node-2.

In some embodiments, the second node sends a fourth routing message to the fourth node, and the second node receives the multicast traffic delivered by the fourth node.

Wherein, the fourth node is the root node directly connected with the multicast source, and as the main root node of the second node, the fourth node can be a PE router. The fourth routing message may be, for example, a C multicast routing message, which is used to induce multicast traffic. It can be understood that the fourth routing message is used to instruct the fourth node to deliver multicast traffic to the second node.

Exemplarily, as shown in Figure 9, the fourth node can be the root node-1, and for the leaf node-1, the root node-1 can be used as the main root node of the leaf node-1, and the leaf node-2 can be used as the leaf node -1 specifies the backup root node. Leaf node-1 will send the fourth routing message to root node-1, receive the multicast traffic delivered by root node-1, leaf node-1 will also send the second routing message to leaf node-2, and receive leaf node-2 Passed multicast traffic.

Both the first node and the second node in the embodiment of the present application are leaf nodes directly connected to the multicast receiving end, and the first node and the second node can be mutually designated roots, that is, the first node can be used as the root node of the second node Specify the backup root node, and the second node can also be the designated backup root node of the first node.

Therefore, the multicast routing method provided in the embodiment of the present application can be applied to electronic devices, such as routers. When performing multicast routing, and the access-side dual-homing protection and dual-root 1+1 protection are deployed at the same time, this application carries the extended community attribute in the MVPNA-D route, so that the leaf node has the root node capability, so that through the configuration Make the two leaf nodes mutually designated backup root nodes, and the backup root traffic is shared between the two leaf nodes. Compared with selecting the active and standby root nodes of the leaf nodes through unicast routing in the prior art, the root node directly connected to the multicast source is selected as the active and standby root nodes of the leaf nodes, and the cost value needs to be strictly planned. Control the transmission path of the primary and backup root traffic, so there is a problem of bandwidth redundancy on the public network side. The solution of this application can make only two copies of the same traffic exist on the public network side, effectively reducing the bandwidth redundancy on the public network side. It reduces the customer's operating costs, and can still reduce the bandwidth redundancy on the public network side in the scenario where each site is a multicast source for each other.

As shown in Figure 10, taking the multicast routing including multicast source, multicast receiver, two leaf nodes, two root nodes and two P nodes as an example, the two leaf nodes are respectively leaf node-1 and leaf node-2, the two root nodes are root node-1 and root node-2, and the two P nodes are P-1 and P-2 respectively. The multicast routing method proposed in this application will be described in detail below.

Step 1001, the leaf node-1 publishes the MVPN A-D route to the root node-1 and the leaf node-2 at the same time.

Among them, the MVPN A-D route includes extended community attributes, and the extended community attributes include root node information. It can be understood that root node-1 and leaf node-2 carry root node information and have the ability to serve as root nodes.

Step 1002, root node-1 and leaf node-2 enable root node capabilities, and send root node information to leaf node-1.

It can be understood that root node-1 and leaf node-2 are configured with codes that enable root node capabilities, root node-1 and leaf node-2 run the code to enable root node capabilities, and send root nodes to leaf node-1 Information, so that the leaf node-1 can know that both the root node-1 and the leaf node-2 have the ability to be the root node.

Step 1003, the leaf node-1 advertises the C multicast route to the root node-1 and the leaf node-2.

Wherein, the extended community attribute carried in the MVPN A-D route in step 801 is the extended community attribute required when performing C multicast routing, and the root node can be determined through the extended community attribute when performing C multicast routing. It can be understood that when leaf node-1 advertises C multicast routes, it can determine that the primary root node is root node-1 and the backup root node is leaf node-2 according to the extended community attribute carried in the MVPN A-D route, so that the root node- 1 and leaf node-2 publish C multicast routes, so that root node-1 and leaf node-2 deliver multicast traffic to leaf node-1.

So far, the multicast network has completed routing publishing, which can be understood as the multicast network has completed the selection of the primary and backup roots of the leaf node-1, wherein the primary root node is the root node-1, and the backup root node (also known as the designated root node ) is the leaf node -2. Next, after the route is released, the inclusive provider multicast service interface tunnel (I-PMSI Tunnel) and the selective provider multicast service interface tunnel (Selective Provider Multicast Service Interface Tunnel, S-PMSI Tunnel) The processing in PMSI Tunnel). Among them, I-PMSI tunnel and S-PMSI tunnel are two types of tunnels in multicast routing. When the multicast traffic transmitted in the I-PMSI tunnel reaches the threshold, it will switch to the S-PMSI tunnel for traffic transmission.

In the I-PMSI tunneling process, there are step 1004, step 1005, step 1006 and step 1007.

Step 1004, the root node-1 sends an Intra-AS I-PMSI A-D route (Intra-AS I-PMSI A-D route) to the leaf node-1.

Step 1005, the leaf node-1 sends the leaf node automatic discovery route (Leaf A-Droute) to the root node-1.

Step 1004 and step 1005 can be understood as establishing the I-PMSI tunnel between the root node-1 and the leaf node-1, so that when the multicast traffic sent by the multicast source reaches the root node-1, the root node-1 can pass through the I-PMSI tunnel. -PMSI tunnel transmits multicast traffic to leaf node-1.

Step 1006, the leaf node-2 sends the I-PMSI A-D route to the leaf node-1.

Step 1007, the leaf node-1 sends the Leaf A-D route to the leaf node-2.

Steps 1006 and 1007 can be understood as establishing an I-PMSI tunnel between leaf node-2 and leaf node-1, so that leaf node-2 can transmit multicast traffic to leaf node-1 through the I-PMSI tunnel.

So far, the I-PMSI tunnel between root node-1 and leaf node-1 and the I-PMSI tunnel between leaf node-2 and leaf node-1 have been established, and leaf node-1 communicates with root node-1 and leaf node -2 After sending the customer multicast route (Customer multicast route, C-multicast route), the root node-1 and the leaf node-2 can transmit multicast traffic to the leaf node-1 through the I-PMSI tunnel.

When the multicast traffic in the I-PMSI tunnel reaches the threshold, the multicast traffic can be switched from the I-PMSI tunnel to the S-PMSI tunnel for delivery, there are steps 1008, 1009, 1010 and 1011.

Step 1008, the root node-1 sends a selective operator multicast service interface automatic discovery route (S-PMSI A-D route) to the leaf node-1, wherein the S-PMSI A-D route will carry the multicast service tunnel attribute (PMSI TunnelAttribute).

Step 1009, the leaf node-1 sends the Leaf A-D route to the root node-1.

Step 1008 and step 1009 can be understood as establishing an S-PMSI tunnel between the root node-1 and the leaf node-1, so that when the multicast traffic sent by the multicast source reaches the root node-1, the root node-1 can pass through the S-PMSI tunnel. -PMSI tunnel transmits multicast traffic to leaf node-1.

Step 1010, leaf node-2 sends S-PMSI A-D route to leaf node-1, wherein S-PMSI A-D route will carry PMSI Tunnel Attribute.

Step 1011, the leaf node-1 sends the Leaf A-D route to the leaf node-2.

Step 1010 and step 1011 can be understood as establishing an S-PMSI tunnel between leaf node-2 and leaf node-1, so that when the multicast traffic sent by the multicast source reaches leaf node-2, leaf node-2 can pass S-PMSI tunnel The PMSI tunnel transmits multicast traffic to leaf node-1.

So far, the S-PMSI tunnel between the root node-1 and the leaf node-1 and the S-PMSI tunnel between the leaf node-2 and the leaf node-1 have been established. When the multicast traffic in the I-PMSI tunnel reaches the threshold , the root node-1 and the leaf node-2 can switch the I-PMSI tunnel to the S-PMSI tunnel, and pass the multicast traffic to the leaf node-1 through the S-PMSI tunnel.

The above step 1001-step 1011 is the normal process when there are multicast members joining in leaf node-1 and leaf node-2. If there are multicast members joining in leaf node-1, there is no multicast member in leaf node-2. Add, that is, when the leaf node-1 carries the IGMP table, and the leaf node-2 does not carry the IGMP table, there are still steps 1012, 1013 and 1014.

Step 1012, leaf node-1 sends C-multicast route to root node-1 and leaf node-2.

Step 1012 can be understood as leaf node-1 directs multicast traffic from root node-1 and leaf node-2, but since leaf node-2 does not carry an IGMP table, leaf node-2 does not have multicast traffic, and leaf node-2 does not carry multicast traffic. Node-1 cannot receive multicast traffic from leaf node-2.

Step 1013, the leaf node-2 enables the root node capability, and converts the C-multicast route sent from the leaf node-1 to the leaf node-2 into a local C-multicast route and sends it to the root node-2.

Step 1013 can be understood as leaf node-2 leading multicast traffic from root node-2, and then leaf node-2 can deliver the multicast traffic to leaf node-1.

Step 1014, leaf node-2 splices the tunnel from root node-2 to leaf node-2 and the new tunnel from leaf node-2 to leaf node-1.

Step 1014 can be understood as doing tunnel splicing at the leaf node-2, so that the multicast traffic at the root node-2 can be transmitted to the new tunnel with leaf node-2 as the root node and leaf node-1 as the leaf node, That is, the multicast traffic at the root node-2 can be delivered to the leaf node-1. Tunnel splicing, for example, can be performed through loopback processing, which is not limited in this application.

After the tunnel splicing is completed, the transmission path of the multicast traffic is shown in Figure 11. The root node-1 is the primary root of the leaf node-1, and the leaf node-2 is the designated backup root of the leaf node-1. The root node-1 transmits a multicast traffic to the leaf node-1 as the main root traffic of the leaf node-1, and the leaf node-2 transmits a multicast traffic to the leaf node-1 as the backup root traffic of the leaf node-1 , wherein the multicast traffic transmitted from leaf node-2 to leaf node-1 is received from root node-2.

In the above step 1001-step 1014, the main leaf node is leaf node-1, and the standby leaf node is leaf node-2. The main leaf node can also be leaf node-2, and the standby leaf node can also be leaf node-2. For leaf node-1, refer to the above step 1001-step 1014 for the specific process, which will not be described in detail here.

Therefore, the multicast routing method provided by the embodiment of the present application can be applied to electronic devices, such as routers. When multicast routing is performed and dual-homing protection on the access side and dual-root 1+1 protection are deployed at the same time, only two copies of the same traffic can exist on the public network side, effectively reducing bandwidth redundancy on the public network side and reducing Customer's operating costs. And in the special scenario where there are multicast members joining at leaf node-1 and no multicast members joining at leaf node-2, it is also possible to send C multicast routes to root node-2 through leaf node-2, so that leaf node- 2 receives multicast traffic, so that leaf node-2 can transmit multicast traffic to leaf node-1, so that the backup root traffic can share the path between the two leaf nodes, effectively reducing the bandwidth redundancy on the public network side. Reduced operating costs for customers.

It can be understood that, in order to realize the above-mentioned functions, the above-mentioned electronic equipment includes corresponding hardware structures and/or software modules for performing each function. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of the examples described in the embodiments disclosed herein, the embodiments of the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed by hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art may use different methods to implement the described functions for each specific application, but such implementation should not be considered as exceeding the scope of the embodiments of the present application.

The embodiment of the present application can divide the above-mentioned electronic device into functional modules according to the above-mentioned method example, for example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one processing module. The above-mentioned integrated modules can be implemented in the form of hardware or in the form of software function modules. It should be noted that the division of modules in the embodiment of the present application is schematic, and is only a logical function division, and there may be other division methods in actual implementation.

In the case of dividing each functional module corresponding to each function, FIG. 12 shows a possible composition diagram of the electronic device 1200 involved in the above-mentioned embodiment, and the electronic device 1200 can be understood as the electronic device involved in the above-mentioned embodiment. 700, the electronic device 1200 can be understood as the first node (leaf node-2) or the second node (leaf node-1) involved in the foregoing embodiments. As shown in Figure 12, the electronic device 1200 may include: a receiving unit 1201 and a sending unit 1202.

Wherein, the receiving unit 1201 can be used to support the electronic device 1200 to execute the above step 801, step 803, etc., and/or other processes for the technologies described herein.

The sending unit 1202 may be used to support the electronic device 1200 to execute the above step 802, etc., and/or other processes for the technology described herein.

It should be noted that all relevant content of each step involved in the above method embodiments can be referred to the functional description of the corresponding functional module, and will not be repeated here.

The electronic device 1200 provided in this embodiment is used to execute the above-mentioned multicast routing method, so it can achieve the same effect as the above-mentioned implementation method.

In the case of using an integrated unit, as shown in FIG. 13 , the embodiment of the present application discloses an electronic device 1300, and the electronic device 1300 may be the electronic device 700 in the above embodiment. The electronic device 1300 may include a processing module, a storage module and a communication module. Wherein, the processing module can be used to control and manage the actions of the electronic device 1300, for example, it can be used to support the electronic device 1300 to perform the above-mentioned steps of judging whether the node has the root node capability, enabling the root node capability, and transmitting multicast traffic, etc. The storage module can be used to support the electronic device 1300 to store program codes, data, and the like. The communication module can be used to support communication between the electronic device 1300 and other devices, for example, it can be used to support the electronic device 1300 to perform the steps performed by the receiving unit 1201 and the sending unit 1202.

Certainly, the unit modules in the above-mentioned electronic device 1300 include but are not limited to the above-mentioned processing module, storage module and communication module.

Wherein, the processing module may be a processor or a controller. It may implement or execute the various illustrative logical blocks, modules and circuits described in connection with the present disclosure. The processor can also be a combination that realizes computing functions, such as a combination of one or more microprocessors. The storage module may be a memory. Specifically, the communication module can be a device that interacts with other external devices. For example, the processing module is a processor 701, the storage module can be a memory 702, and the communication module can be a communication interface 703. The electronic device 1300 provided in this embodiment of the present application may be the electronic device 700 shown in FIG. 7 . Wherein, the above-mentioned processor 701, memory 702, communication interface 703, etc. may be connected together, such as through a bus.

The embodiment of the present application also provides an electronic device, including one or more processors and one or more memories. The one or more memories are coupled with one or more processors, the one or more memories are used to store computer program codes, the computer program codes include computer instructions, and when the one or more processors execute the computer instructions, the electronic device performs Perform the above related method steps to realize the multicast routing method in the above embodiment.

The embodiment of the present application also provides a computer-readable storage medium, the computer-readable storage medium stores computer program codes, and when the computer instructions run on the computer or the processor, the computer or the processor executes the above-mentioned embodiment broadcasting routing method.

The embodiment of the present application also provides a computer program product, the computer program product includes computer instructions, when the computer instructions are run on the computer or processor, the computer or processor is made to perform the above-mentioned related steps, so as to realize the above-mentioned embodiments A broadcast routing method performed by an electronic device.

Wherein, the electronic equipment, computer storage medium, and computer program product provided in this embodiment all include the corresponding method provided above, therefore, the beneficial effect that it can achieve can refer to the beneficial effect in the corresponding method provided above. effect, which will not be repeated here.

Through the description of the above embodiments, those skilled in the art can understand that for the convenience and brevity of the description, only the division of the above-mentioned functional modules is used as an example for illustration. In practical applications, the above-mentioned functions can be assigned by different The functional modules are completed, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.

In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the modules or units is only a logical function division, and there may be other division methods during actual implementation. For example, multiple units or components can be Incorporation or may be integrated into another device, or some features may be omitted, or not implemented. In another point, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be in electrical, mechanical or other forms.

The unit described as a separate part may or may not be physically separated, and the part shown as a unit may be one physical unit or multiple physical units, that is, it may be located in one place, or may be distributed to multiple different place. Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

If the integrated unit is realized in the form of a software function unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the software product is stored in a storage medium Among them, several instructions are included to make a device (which may be a single-chip microcomputer, a chip, etc.) or a processor (processor) execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage media include: U disk, mobile hard disk, read only memory (read only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disc, etc., which can store program codes. .

The above content is only the specific implementation of the application, but the scope of protection of the application is not limited thereto. Anyone familiar with the technical field can easily think of changes or replacements within the technical scope disclosed in the application. covered within the scope of protection of this application. Therefore, the protection scope of the present application should be determined by the protection scope of the claims.

Claims (20)

1. A multicast routing method, the method comprising:

a first node receives a first routing message, wherein the first routing message comprises an extended community attribute, the extended community attribute comprises root node information, and the root node information is used for indicating that the first node has root node capability; the first node is a standby leaf node between a multicast source and a multicast receiving end;

enabling the root node capability by the first node, and sending the root node information to a second node; the second node is a main leaf node between the multicast source and the multicast receiving end;

and the first node receives a second routing message of the second node, wherein the second routing message is used for instructing the first node to transmit multicast traffic to the second node.

2. The method of claim 1, wherein receiving, by the first node, the first routing message comprises:

and the first node receives the first routing message published by a Border Gateway Protocol (BGP), and the first routing message is used for selecting a main root node and a standby root node of the main leaf node and the standby leaf node.

3. The method according to claim 1 or 2, wherein before the first node receives the second routing message of the second node, the method further comprises:

the first node sends a first tunnel establishment request to the second node, wherein the first tunnel establishment request is used for establishing a first tunnel between the first node and the second node, and the first tunnel is used for transmitting multicast traffic between the first node and the second node.

4. The method of claim 3, wherein when the second node carries a network group management protocol, IGMP, table and the first node does not carry the IGMP table, the method further comprises:

after the first node receives the second routing message sent by the second node through the first tunnel, the first node sends a local third routing message to a third node, where the third node is a root node directly connected to the multicast source, and the third routing message is used to instruct the third node to transmit multicast traffic to the first node.

5. A multicast routing method, the method comprising:

a second node receives root node information of a first node, wherein the root node information is used for indicating that the first node has root node capability; the first node is a standby leaf node between a multicast source and a multicast receiving end; the second node is a main leaf node between the multicast source and the multicast receiving end;

and the second node sends a second routing message to the first node, wherein the second routing message is used for indicating the first node to transmit the multicast flow to the second node.

6. The method of claim 5,

the root node information is indicated by an extended community attribute, the extended community attribute is included in a first routing message, the first routing message is received by the first node through a Border Gateway Protocol (BGP), and the first routing message is used for selecting a main root node and a standby root node of the main leaf node and the standby leaf node.

7. The method according to claim 5 or 6, wherein before the second node sends the second routing message to the first node, the method further comprises:

the second node receives a first tunnel establishment request of the first node, wherein the first tunnel establishment request is used for establishing a first tunnel between the first node and the second node, and the first tunnel is used for transmitting multicast traffic between the first node and the second node.

8. The method of claim 7, wherein when the second node carries an IGMP table and the first node does not carry the IGMP table, the method further comprises:

the second node sends the second routing message to the first node through the first tunnel;

and the second node receives the multicast traffic transmitted by the first node.

9. The method of claim 8,

the second node sends a fourth routing message to the fourth node, the fourth node is the primary root node of the second node, and the fourth routing message is used for indicating the fourth node to transmit multicast traffic to the second node;

and the second node receives the multicast traffic transmitted by the fourth node.

10. A node, wherein the node is a first node, and wherein the first node comprises:

a receiving unit, configured to receive a first routing message, where the first routing message includes an extended community attribute, where the extended community attribute includes root node information, and the root node information is used to indicate that the first node has root node capability; the first node is a standby leaf node between a multicast source and a multicast receiving end;

a sending unit, configured to enable the root node capability, and send the root node information to a second node; the second node is a main leaf node between the multicast source and the multicast receiving end;

the receiving unit is further configured to receive a second routing message of the second node, where the second routing message is used to instruct the first node to transmit the multicast traffic to the second node.

11. The node of claim 10, wherein the receiving unit is further configured to:

and receiving the first routing message issued through a Border Gateway Protocol (BGP), wherein the first routing message is used for selecting a main root node and a standby root node of the main leaf node and the standby leaf node.

12. The node according to claim 10 or 11, wherein before the first node receives the second routing message of the second node, the sending unit is further configured to:

sending a first tunnel establishment request to the second node, where the first tunnel establishment request is used to establish a first tunnel between the first node and the second node, and the first tunnel is used to transfer multicast traffic between the first node and the second node.

13. The node of claim 12, wherein the receiving unit is further configured to: when the second node carries a network group management protocol IGMP table and the first node does not carry the IGMP table,

receiving the second routing message sent by the second node through the first tunnel;

the sending unit is further configured to send a local third routing message to a third node, where the third node is a root node directly connected to the multicast source, and the third routing message is used to instruct the third node to transmit multicast traffic to the first node.

14. A node, wherein the node is a second node, and wherein the second node comprises:

a receiving unit, configured to receive root node information of a first node, where the root node information is used to indicate that the first node has root node capability; the first node is a standby leaf node between a multicast source and a multicast receiving end; the second node is a main leaf node between the multicast source and the multicast receiving end;

a sending unit, configured to send a second routing message to the first node, where the second routing message is used to instruct the first node to transmit a multicast traffic to the second node.

15. The node of claim 14,

the root node information is indicated by an extended community attribute, the extended community attribute is included in a first routing message, the first routing message is received by the first node through a Border Gateway Protocol (BGP), and the first routing message is used for selecting a main root node and a standby root node of the main leaf node and the standby leaf node.

16. The node according to claim 14 or 15, wherein before the second node sends the second routing message to the first node, the receiving unit is further configured to:

receiving a first tunnel establishment request of the first node, where the first tunnel establishment request is used to establish a first tunnel between the first node and the second node, and the first tunnel is used to transfer multicast traffic between the first node and the second node.

17. The node of claim 16, wherein the sending unit is further configured to: when the second node carries a network group management protocol IGMP table and the first node does not carry the IGMP table,

sending the second routing message to the first node through the first tunnel;

the receiving unit is further configured to receive the multicast traffic transmitted by the first node.

18. The node of claim 17,

the sending unit is further configured to send a fourth routing message to the fourth node, where the fourth node is the root node of the second node, and the fourth routing message is used to instruct the fourth node to transmit multicast traffic to the second node;

the receiving unit is further configured to receive the multicast traffic transmitted by the fourth node.

19. A computer readable storage medium comprising computer instructions which, when run on a computer or processor, cause the computer or processor to perform the method of any of claims 1-4 or 5-9 above.

20. A computer program product comprising computer instructions which, when run on a computer or processor, cause the computer instructions to perform the method of any one of claims 1 to 4 or 5 to 9 when run on the computer or processor.

Images