CN115883452A - Communication method and communication device - Google Patents

Abstract

A communication method and a communication device are provided, the method includes: a first node acquires a first multicast message, the first multicast message includes a second node's multicast routing identifier and the second node in the first multicast tree The multicast routing identifier of the child node in the second node is a non-leaf child node of the first node in the first multicast tree, and the first multicast tree is used to indicate the forwarding path of the first multicast message; in the second When a node fails or a link between the first node and the second node fails, the first node processes the first multicast message based on the target backup path to obtain a second multicast message, and the second multicast message includes the target The indication information of the backup path, the second multicast message includes the multicast routing identifier of the child node of the second node in the first multicast tree; the first node sends the second multicast message to the third node, and the third node is The first hop node in the target backup path. When the first node and the second node cannot communicate normally, they can quickly switch to the backup path without wasting bandwidth.

Description

A communication method and communication device

technical field

The present application relates to the communication field, and more specifically, to a communication method and a communication device.

Background technique

Multicast-oriented fast reroute (multicast-only fast reroute, MoFRR) is an end-to-end dual-feed selective reception protection scheme, each edge node can send join (join) signaling to the multicast source through an orthogonal path, The upstream node needs to generate table entries hop by hop to establish a backup path. The multicast source sends the main traffic and the backup traffic to the edge nodes at the same time, and the edge nodes can preferentially select the main traffic. When the edge node does not receive the main traffic within a certain time threshold, the edge node can receive the backup traffic. In this technical solution, each edge node of each multicast service occupies double bandwidth of the network, and there is a problem of bandwidth waste.

Contents of the invention

The present application provides a communication method and a communication device, which can quickly switch to a backup path when two nodes cannot communicate normally without wasting bandwidth.

In the first aspect, the present application provides a communication method, which can be executed by the first node, or can also be executed by components (such as chips, chip systems, etc.) configured in the first node. Not limited.

Exemplarily, the method includes: the first node acquires a first multicast packet, the first multicast packet includes multicast routing information of the second node, and the multicast routing information of the second node includes the multicast routing information of the second node The routing identifier and the multicast routing identifier of the child node of the second node in the first multicast tree, the second node is a non-leaf child node of the first node in the first multicast tree, and the first multicast tree is used to indicate the first multicast tree The forwarding path of a multicast packet, wherein the multicast routing identifier of a node is used to determine the next hop of the node; when the first node cannot communicate normally with the second node, the failure to communicate normally includes the second node failure or a link failure between the first node and the second node, the first node processes the first multicast message based on the target backup path to obtain the second multicast message, and the second multicast message includes the target backup path The indication information of the path, and the second multicast packet includes the multicast routing identifier of the child node of the second node in the first multicast tree; the first node sends the second multicast packet to the third node, and the third node is The first hop node in the target backup path, and the third node is not in the first multicast tree.

It should be understood that when the child node of the second node in the first multicast tree is a non-leaf child node in the first multicast tree, the multicast routing identifier of the child node of the second node in the first multicast tree may be Included in the multicast routing information of the child node, the multicast routing information of the child node may include the multicast routing identifier and addressing field of the child node, and the addressing field may be used by the node to determine the child node of the node The position of the multicast routing information of the second node; when the child node of the second node in the first multicast tree is a leaf node in the first multicast tree, the multicast routing information of the second node may include the second node in the first multicast tree The multicast routing identifier of the child node in the multicast tree, the multicast routing information of the second node may not include the addressing field of the second node's child node in the first multicast tree.

Based on the above scheme, a backup path that can bypass the faulty node or faulty link is pre-stored on the nodes participating in the multicast packet forwarding. When the first node perceives that the second node has a device failure or When the link fails, you can search for the target backup path in the pre-stored backup paths, encapsulate the target backup path into a message, and send the message based on the target backup path. When the first node and the second node cannot communicate normally, they can quickly switch to the target backup path, encapsulate the target backup path into a message, and continue to send messages based on the target backup path. This method will not waste bandwidth , and can also provide a reliable guarantee mechanism for multicast.

With reference to the first aspect, in some possible implementation manners, the second multicast packet includes the multicast routing identifier of the second node, and the multicast routing identifier of the child node of the second node is included in the multicast routing identifier of the second node. information.

Based on the above solution, the first node can send the second multicast packet to the third node, and the third node can forward the multicast packet to the third node based on the indication information of the forwarding path of the multicast packet in the second packet The second node, therefore, the second node is still a node in the multicast message forwarding path, and the second node can also forward the multicast message to the child nodes of the second node.

With reference to the first aspect, in some possible implementation manners, the second multicast packet does not include the multicast routing identifier of the second node.

Based on the above solution, the first node can send the second multicast packet to the third node, and the third node can forward the multicast packet to the third node based on the indication information of the forwarding path of the multicast packet in the second packet The child node of the second node will not forward the message to the second node, so the second node is no longer a node in the forwarding path of the multicast message, and there is no need to pass the group through the second node The multicast message is forwarded to the child nodes of the second node. Therefore, no matter whether the second node has a device failure or a link between the first node and the second node fails, the forwarding of the multicast message will not be affected.

With reference to the first aspect, in some possible implementation manners, the method further includes: the first node generates a first forwarding table based on one or more backup paths, and the first forwarding table includes each of the one or more backup paths The indication information of each backup path and the adjacent nodes of the first node and the interface identifiers of the adjacent nodes of the first node, the indication information of each backup path and the adjacent nodes of the first node and the adjacent nodes of the first node Corresponding to the interface identifier, one or more backup paths include the target backup path.

Based on the above scheme, when the first node and the second node cannot communicate normally, the first node can quickly determine the target backup path from the first forwarding table maintained on the first node, and encapsulate the indication information of the target backup path into In the second multicast message, the second multicast message is sent to the third node.

With reference to the first aspect, in some possible implementation manners, the first forwarding table further includes a backup next hop, where the backup next hop corresponds to an interface identifier of a neighboring node of the first node.

Based on the above solution, when the first node and the second node cannot communicate normally, the first node can quickly determine the target backup path and the third node from the first forwarding table maintained on the first node, and transfer the target backup path The indication information is encapsulated into the second multicast packet, and the second multicast packet is sent to the third node.

In combination with the first aspect, in some possible implementation manners, the first node processes the first multicast message based on the target backup path to obtain the second multicast message, and further includes: the first node determines the first forwarding table The indication information of the backup path corresponding to the first interface of the second node is the indication information of the target backup path, and the first interface of the second node is the interface corresponding to the second node and the child node of the second node in the first multicast tree ; The first node encapsulates the indication information of the target backup path into the second multicast message based on the first multicast message.

Based on the above scheme, when the first node and the second node cannot communicate normally, the first node can quickly find the indication information of the target backup path from the first forwarding table maintained on the first node, based on the indication of the target backup path The information processes the first multicast message, and encapsulates the indication information of the target backup path into the multicast message, thereby obtaining the second multicast message.

With reference to the first aspect, in some possible implementation manners, the sending of the second multicast packet by the first node to the third node further includes: the first node determines the first interface corresponding to the second node in the first forwarding table The backup next hop is the third node, and the first interface of the second node is the interface corresponding to the second node and the child node of the second node in the first multicast tree; the first node sends the second group broadcast report to the third node arts.

Based on the above solution, when the first node and the second node cannot communicate normally, after the first node obtains the second multicast message, the first node can quickly determine the third node from the first forwarding table maintained on the first node , and send the second multicast packet to the third node.

With reference to the first aspect, in some possible implementation manners, the method further includes: the first node generates a second forwarding table based on one or more backup paths, and the second forwarding table includes each of the one or more backup paths The indication information of each backup path and the interface identifier of the first node, the indication information of each backup path corresponds to the interface identifier of the first node, and one or more backup paths include the target backup path.

Based on the above solution, when the first node and the second node cannot communicate normally, the first node can quickly determine the target backup path from the second forwarding table maintained on the first node, and encapsulate the indication information of the target backup path into In the second multicast message, the second multicast message is sent to the third node.

With reference to the first aspect, in some possible implementation manners, the second forwarding table further includes a backup interface identifier, and the backup interface identifier corresponds to the interface of the first node.

Based on the above scheme, when the first node and the second node cannot communicate normally, the first node can quickly determine the target backup path and the backup interface from the second forwarding table maintained on the first node, and send the indication of the target backup path to The information is encapsulated into the second multicast message, and the second multicast message is sent to the third node through the backup interface.

In combination with the first aspect, in some possible implementations, the first node processes the first multicast packet based on the target backup path to obtain the second multicast packet, and further includes: the first node determines the second forwarding table The indication information of the backup path corresponding to the first interface of the first node is the indication information of the target backup path, and the first interface of the first node is the interface corresponding to the second node among the interfaces of the first node; The groupcast packet encapsulates the indication information of the target backup path into the second multicast packet.

Based on the above scheme, when the first node and the second node cannot communicate normally, the first node can quickly find the indication information of the target backup path from the second forwarding table maintained on the first node, based on the indication of the target backup path The information processes the first multicast message, and encapsulates the indication information of the target backup path into the multicast message, thereby obtaining the second multicast message.

With reference to the first aspect, in some possible implementation manners, the sending of the second multicast packet by the first node to the third node further includes: the first node determines the first interface corresponding to the first node in the second forwarding table The node corresponding to the backup interface is the third node, and the first interface of the first node is the interface corresponding to the second node among the interfaces of the first node; The three nodes send the second multicast packet.

Based on the above scheme, when the first node and the second node cannot communicate normally, after the first node obtains the second multicast message, the first node can quickly determine the The third node, and sends the second multicast packet to the third node.

With reference to the first aspect, in some possible implementation manners, the one or more backup paths are received by the first node from the controller, and the first node, the second node, and the third node are all connected to the controller.

With reference to the first aspect, in some possible implementation manners, the one or more backup paths are calculated by the first node based on connection relationships of all nodes in the topology where the first node is located.

With reference to the first aspect, in some possible implementations, the first multicast packet is received by the first node from the controller or the previous hop node of the first node, and the multicast routing information of the second node is included in the In the multicast information of a node.

In combination with the first aspect, in some possible implementation manners, the first multicast message is generated by the first node based on the connection relationships of all nodes in the topology where the first node is located, and the first multicast message does not include the first multicast message. The multicast routing identifier of a node.

With reference to the first aspect, in some possible implementation manners, the indication information of the target backup path includes multicast routing information of the third node, and the routing multicast information of the third node includes the multicast routing identifier of the third node and the multicast routing information of the third node. The multicast routing information of the non-leaf child nodes of the three nodes in the second multicast tree, where the second multicast tree is used to indicate the forwarding path of the second multicast message.

With reference to the first aspect, in some possible implementation manners, the format of the indication information of the target backup path may also be based on the segment routing (segment routing, SR) technology and the sixth version of the Internet Protocol (internet protocolversion 6, IPv6) Corresponding formats generated by SR technology or multi-protocol label switching (multi-protocol label switching, MPLS) technology, etc.

In a second aspect, the present application provides a communications device that can implement the method in the foregoing first aspect or any possible implementation manner of the first aspect. The apparatus comprises corresponding means for carrying out the method described above. The units included in the device may be implemented by software and/or hardware. The device can be, for example, the first node, or a chip, a chip system, or a processor that supports the first node to implement the above method, or a logic module or software that can realize all or part of the functions of the first node.

In a third aspect, the present application provides a communication device, where the communication device includes a processor. The processor is coupled with the memory, and can be used to execute the computer program in the memory, so as to realize the first aspect and the communication method in any possible implementation manner of the first aspect.

Optionally, the communication device further includes a memory.

Optionally, the communication device further includes a communication interface, and the processor is coupled to the communication interface.

In a fourth aspect, the present application provides a system-on-a-chip, which includes at least one processor, configured to support the implementation of the functions involved in the above-mentioned first aspect and any possible implementation of the first aspect, for example, receiving or Process the data and/or messages involved in the above method.

In a possible design, the chip system further includes a memory, the memory is used to store program instructions and data, and the memory is located inside or outside the processor.

The system-on-a-chip may consist of chips, or may include chips and other discrete devices.

In a fifth aspect, the present application provides a computer-readable storage medium, where a computer program (also referred to as code, or instruction) is stored on the computer storage medium, and when the computer program is run by a processor, the The above first aspect and the method in any possible implementation manner of the first aspect are executed.

In a sixth aspect, the present application provides a computer program product, the computer program product including: a computer program (also called code, or instruction), when the computer program is executed, the above-mentioned first aspect and the first In one aspect the method in any one of the possible implementations is performed.

It should be understood that, the second aspect to the sixth aspect of the present application correspond to the technical solution of the first aspect of the present application, and the beneficial effects obtained by each aspect and the corresponding feasible implementation manners are similar, so details are not repeated here.

Description of drawings

FIG. 1 is a schematic diagram of a scenario applicable to a communication method provided by an embodiment of the present application;

FIG. 2 is a schematic diagram of an entity topology connection and a multicast tree provided by an embodiment of the present application;

FIG. 3 is a schematic diagram of another entity topology connection and multicast tree provided by the embodiment of the present application;

FIG. 4 is a schematic diagram of another entity topology connection provided by the embodiment of the present application;

FIG. 5 is a schematic diagram of multicast packet transmission between routers provided in an embodiment of the present application;

FIG. 6 is a schematic flow chart applicable to the communication method provided by the embodiment of the present application;

FIG. 7 is a schematic diagram of a first multicast message applicable to the communication method provided by the embodiment of the present application;

FIG. 8 is another schematic diagram of the first multicast message applicable to the communication method provided by the embodiment of the present application;

FIG. 9 is a schematic diagram of the failure of normal communication between the first node and the second node provided by the embodiment of the present application;

FIG. 10 is a schematic diagram of a second multicast tree applicable to the communication method provided by the embodiment of the present application;

FIG. 11 is a schematic diagram of a second multicast message applicable to the communication method provided by the embodiment of the present application;

FIG. 12 is another schematic diagram of a second multicast tree applicable to the communication method provided by the embodiment of the present application;

FIG. 13 is another schematic diagram of a second multicast message applicable to the communication method provided by the embodiment of the present application;

FIG. 14 is a schematic diagram of the topological connection of nodes provided in the embodiment of the present application;

FIG. 15 is a schematic diagram of the indication information of the target backup path provided by the embodiment of the present application;

16 is a schematic diagram of the first multicast message provided by the embodiment of the present application before the first node and the second node cannot communicate normally;

FIG. 17 is a schematic diagram of the comparison of the second multicast message before and after the first node and the second node fail to communicate normally according to the embodiment of the present application;

FIG. 18 is a schematic diagram of a topology connection between nodes and entities, a multicast tree, and a multicast message provided by an embodiment of the present application;

FIG. 19 is a schematic diagram of another topology connection of nodes and entities, a multicast tree, and a multicast message provided by the embodiment of the present application;

FIG. 20 is a schematic block diagram of a communication device provided by an embodiment of the present application;

Fig. 21 is a schematic block diagram of another communication device provided by an embodiment of the present application.

Detailed ways

The technical solution in this application will be described below with reference to the accompanying drawings.

The terms "first", "second" and the like in the specification and claims of the present application are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It is to be understood that the data so used are interchangeable under appropriate circumstances such that the embodiments of the application described herein can be practiced in sequences other than those illustrated or described herein. Furthermore, the terms "comprising" and "having", as well as any variations thereof, are intended to cover a non-exclusive inclusion, for example, a process, method, system, product or device comprising a sequence of steps or elements is not necessarily limited to the expressly listed instead, may include other steps or elements not explicitly listed or inherent to the process, method, product or apparatus.

In the embodiments of the present application, "at least one" means one or more, and "multiple" means two or more. "And/or" describes the association relationship of associated objects, indicating that there may be three types of relationships, for example, A and/or B, which can mean: A exists alone, A and B exist simultaneously, and B exists alone, where A, B can be singular or plural. The character "/" generally indicates that the contextual objects are an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one item (unit) of a, b, or c may represent: a, b, c; a and b; a and c; b and c; or a and b and c. Where a, b, c can be single or multiple.

This application can be applied to a scenario where a sender needs to carry the same data in a message and send it to multiple receivers. Referring to FIG. 1 , the message can be sent from the sender, and arrive at multiple receivers via multiple multicast nodes (hereinafter referred to as nodes). The message may be called a multicast message, and the data in the multicast message transmitted between different nodes is the same. Wherein, the sending end may be, for example, a server, and the receiving end may be, for example, a client. The node has the ability to send and forward multicast packets, and can perform multicast forwarding of received multicast packets or multicast transmission of generated multicast packets. A node can consist of one entity or multiple entities. An entity can belong to only one node, or it can belong to multiple nodes. Exemplarily, in (a) in FIG. 2 and (b) in FIG. 2 , the network topology diagram of the entity is on the left, and the multicast tree is on the right. Referring to (a) in FIG. 2 , node Z includes multiple entities, which are entity A, entity B, entity C, entity D, and entity E, and node E includes one entity, namely entity E. It can be seen that entity E belongs to both node Z and node E. Referring to (b) in FIG. 2 , node X includes multiple entities, which are entity A and entity B. It can be seen that entity A and entity B belong to both node Z and node X.

It should be noted that, for the convenience of description, in the embodiment of this application, if an entity only belongs to one node, then the node and the entity use the same identifier. At this time, the address of the entity can also be described as the address of the node , the action performed by the node is also the action performed by the entity. Therefore, when the address of a node is mentioned below, it refers to the address of the entity in the node. For example, a node that only includes entity A is called node A. At this time, the address of node A is equivalent to the address of entity A, and a node that only includes entity B is called node B. At this time, the address of node B is equivalent to the address of node entity B the address of.

In this application, an entity may also be referred to as a functional entity. Entities can be physical entities or virtual entities. Physical entities can be, for example, routers, switches, servers, hosts, network cards, line cards, chips, dies of chips, terminals (for example, mobile terminals), internal modules of equipment, etc., and virtual entities can be, for example, virtual machines and containers. , process, thread, etc. When the entity is a physical entity, the node may also be called a multicast device.

In order to make the method provided by this application more clear, some concepts involved in this application are briefly introduced first.

1. Multicast tree

The multicast tree is based on a specific routing protocol (for example, protocol independent multicast (PIM), interior gateway protocol (IGP), etc.) or other methods (for example, manual configuration, controller calculation, etc.) Network topology is a path from source node to all destination nodes generated for a specific combination of source node and destination node. The path is a tree structure with the source node as the root node and the destination node as the leaf node, called multicast tree. The multicast tree may also be called a multicast distribution tree (multicast distribution tree, MDT). For example, referring to Figure 3, the left side is a network topology diagram of an entity, if the source node is node B, and the destination node is node C, node D, and node E, a part of the multicast tree generated by the combination of the source node and the destination node An example of this can be seen on the right in Figure 3.

It should be noted that the sending end and/or the receiving end may be a node in the multicast tree, or may not be a node in the multicast tree. If it is the former, the source node can be the sending end, and the destination node can be the receiving end. For the convenience of description, unless otherwise specified, in the embodiments of the present application, the sending end and the receiving end are nodes in the multicast tree as an example to illustrate the methods provided in the embodiments of the present application. If the receiving end is not a node in the multicast tree, after the data reaches the leaf node, the leaf node sends the received data to the receiving end connected to it.

In addition, the modules other than the network card in a server can be considered as a node (assumed to be node a), the network card in the server can be considered as another node (assumed to be node b), then node b can be considered as the node of node a child nodes. A module other than a line card in a router can be considered as a node (assumed to be node c), and a line card in a router can be considered as another node (assumed to be node d), then node d can be considered as a node of node c child nodes. Exemplarily, referring to FIG. 4 , A is a router, node A0 in FIG. 4 is a module other than a line card in the router, and node A1 , node A2 and node A3 are three line cards in the router. A can send multicast packets to node B, node C, node D, node E, node F and node G respectively through the interfaces on the three line cards. At this time, node A1, node A2, and node A3 may be child nodes of node A0. A can also be a server. At this time, node A1, node A2, and node A3 are three network cards in the server. A can send data to node B, node C, node D, node E, and Node F and node G send multicast packets.

2. Child nodes

A child node of a node refers to a node in the multicast tree to which a packet of the node can be reached through one-hop multicast (that is, after only one multicast forwarding). Wherein, the one-hop multicast refers to searching the multicast forwarding table once. For example, node R in FIG. 3 is a child node of node B, node S is a child node of node R, and node E is a child node of node R. It should be noted that if a multicast packet sent by a node supporting multicast in the multicast tree reaches another node in the multicast tree that supports multicast after passing through one or more nodes that do not support multicast, then The latter multicast-supporting node is a child node of the previous multicast-supporting node, that is to say, the previous multicast-supporting node arrives at the next multicast-supporting node through one-hop multicast. For example, referring to Figure 5, Router A and Router C are routers that support multicast, and Router B is a router that does not support multicast. At this time, Router A sends the multicast packet to Router C through Router B, and Router A Both router C and router C are nodes in the multicast tree, so router C is a child node of router A.

When a child node of a node is a leaf node of the multicast tree, the child node can be called the leaf node of the node; when a child node of a node is not a leaf node of the multicast tree, the child node can be called the The node's non-leaf child nodes.

In the description of the present application, unless otherwise specified, the child nodes of a node mentioned in the following application refer to the child nodes of the node in the multicast tree. Subnodes may also have other names, for example, multicast subnodes, etc., which are not limited in this application.

It should be noted that a node to which an entity belongs may be a child node of another node to which the entity belongs. Exemplarily, referring to (b) in FIG. 2 , node X to which entity A (or entity B) belongs is a child node of node Z to which entity A (or entity B) belongs. Of course, a node to which an entity belongs may not be a child node of another node to which this node belongs.

3. Multicast routing information, multicast routing identifier

In the embodiment of the present application, the multicast routing information of a node is carried in the multicast message forwarded between nodes. The multicast routing identifier of a node is included in the multicast routing information of this node. The multicast routing identifier of a node can be used by the node to determine the next hop node of the node, or, in other words, the multicast routing information of a node The routing identifier can be used to guide the node to perform multicast routing forwarding. It should be understood that the multicast routing information is embedded in the multicast message, and the multicast routing information in the tree-shaped recursive structure included in the multicast message can describe the message forwarding information of a certain multicast tree or a subtree of the multicast tree.

In the MoFRR technology, each edge node can send join signaling to the multicast source through an orthogonal path, and the upstream node needs to generate table entries hop by hop to establish a backup path. The multicast source sends the main traffic and the backup traffic to the edge nodes at the same time, and the edge nodes can preferentially select the main traffic. When the edge node does not receive the main traffic within a certain time threshold, the edge node can receive the backup traffic. In this technical solution, each edge node of each multicast service occupies double bandwidth of the network, and there is a problem of bandwidth waste. Therefore, the embodiment of the present application proposes a communication method and a communication device. The multicast message sent between nodes can be a multicast message structure based on a multicast tree, and maintenance on nodes participating in multicast forwarding can bypass The backup path of a faulty node or faulty link. When a certain two nodes in a multicast tree cannot communicate normally, the node as the last hop of the two nodes can search for its pre-stored backup path. Encapsulate the backup path into a new multicast packet, and send the new multicast packet based on the backup path. It should be understood that the payload data in the new multicast message remains unchanged from the previous multicast message, but the forwarding path indicated in the packet header is different from the previous multicast message.

The communication method provided by the embodiment of the present application will be described below with reference to the accompanying drawings.

Fig. 6 is a schematic flowchart of a communication method provided by an embodiment of the present application. The method 600 includes steps 610 to 630 , and the steps 610 to 630 will be described in detail below.

In step 610, the first node acquires a first multicast packet.

Wherein, the first multicast packet may include multicast routing information of the second node. The multicast routing information of the second node may include the multicast routing identifier of the second node and the multicast routing identifier of the subnode of the second node in the first multicast tree, and the second node is the first node in the first multicast tree. The node's non-leaf child nodes. The first multicast tree may be used to indicate a forwarding path of the first multicast packet.

It should be noted that the first node may be a non-leaf child node in the first multicast tree, and the second node is a non-leaf child node of the first node, so it can be seen that the first node may be a non-leaf child node of the first multicast tree. The penultimate hop node in the message forwarding path and any node before the penultimate hop node.

When the subnode of the second node in the first multicast tree is a non-leaf subnode in the first multicast tree, the multicast routing identifier of the subnode of the second node in the first multicast tree may be included in the In the multicast routing information of the child node, the multicast routing information of the child node may include the multicast routing identifier and addressing field of the child node, and the addressing field may be used for the node to determine the multicast routing information of the child node of the node. The location of the routing information.

When the child node of the second node in the first multicast tree is a leaf node in the first multicast tree, the multicast routing information of the second node may include the child node of the second node in the first multicast tree For the multicast routing identifier, the multicast routing information of the second node may not include the addressing fields of the second node's child nodes in the first multicast tree.

For example, the multicast tree shown on the right side in FIG. 3 is an example of the first multicast tree. When node B is the first node and node R is the second node, node S is a non-leaf child node of node R, and node E is a leaf child node of node R. The multicast routing information of node R can include the multicast routing information of node S, and the multicast routing information of node S can include the multicast routing identifier and addressing fields of node S, and the child nodes of node S (such as node C and node D) multicast routing information or multicast routing identification, this addressing field can be used for node S to determine the position of the multicast routing information or multicast routing identification of the child nodes of node C and node D; the multicast information of node R The multicast routing identifier of node E may be included, and the addressing field of node E may not be included.

As mentioned above, the multicast routing identifier of a node can be used by the node to determine the next-hop node of the node. It can also be said that the multicast routing identifier of a node can be used to guide the node to perform multicast routing forwarding.

A possible situation is that the first node receives the first multicast packet from the controller or the last hop node of the first node. In this case, the first multicast packet may include the multicast information of the first node, and the multicast routing information of the second node may be included in the multicast information of the first node.

It should be understood that when the first node receives the first multicast packet from the controller, the first node may be a source node, or in other words, the first node is the root node in the first multicast tree, for example, the right node in FIG. 3 The multicast tree shown on the side can be the first multicast tree, node B can be the first node, and node R can be the second node; when the first node receives the first multicast message from its previous hop node When , the first node is not the root node of the first multicast tree, and the first node is not a leaf node in the first multicast tree, or in other words, the first node may not be the source node in the forwarding path of the multicast packet, Nor is it the destination node in the forwarding path of the multicast message. For example, the multicast tree shown on the right side in FIG. 3 can be a sub-multicast tree of the first multicast tree. More specifically, the The multicast tree shown can be a part after the last hop node of node B in the first multicast tree, at this time, node B can be the first node, and node R can be the second node; In the case where the shown multicast tree may be the first multicast tree, node B is the root node (or source node), node R may be the first node, and node S may be the second node.

Exemplarily, for the first multicast message shown in FIG. 7 , it is assumed that the second node has M1 non-leaf child nodes, which are respectively denoted as node 2 ₀ , node 2 ₁ , node 2 ₂ , ..., node 2 _M1-1 , the first multicast message may include a message header and payload, the message header of the first node may include the multicast information of the first node, and the multicast information of the first node may include the first The multicast routing identifier of the node and the multicast routing information of the second node, the multicast routing information of the second node includes the multicast routing identifier of the second node, and node 2 ₀ , node 2 ₁ , node 2 ₂ , ... , Multicast routing information of node 2 _M1-1 . Further, the multicast routing information of each node in node 2 ₀ , node 2 ₁ , node 2 ₂ , ..., node 2 _M1-1 includes the multicast routing information of their respective non-leaf child nodes. For example, assuming that there are M2 non-leaf child nodes of node 2 ₀ , the multicast routing information of node 2 ₀ includes the multicast routing identifier of node 2 ₀ , the first non-leaf child node of node 2 ₀ , the second non-leaf child nodes, ..., the multicast routing information of the M2th non-leaf child nodes. Each non-leaf child node of node ₂₀ further includes the multicast routing information of its own non-leaf child node, and so on. Node 2 ₁ , node 2 ₂ , ..., node 2 _M1-1 are similar, and for the sake of brevity, details are not repeated here.

Another possible situation is that the first node generates the first group of broadcasts based on the connection relationship of all nodes in the topology where the first node is located (for example, the topology between nodes shown on the left side of FIG. 3 ). arts. In this case, the first multicast packet does not include the multicast routing identifier of the first node.

Exemplarily, for the first multicast message shown in FIG. 8 , similarly, it can be assumed that the second node has M1 non-leaf child nodes, which are respectively marked as node 2 ₀ , node 2 ₁ , node 2 ₂ , ..., node 2 _M1-1 , then the first multicast message may include a message header and a payload, the message header of the first multicast message may include the multicast information of the second node, the group information of the second node The broadcast information may include the multicast routing information of the second node, the multicast routing information of the second node may include the multicast routing identifier of the second node, and node 2 ₀ , node 2 ₁ , node 2 ₂ , ..., node 2 Multicast routing information of _M1-1 . Further, the multicast routing information of each node in node 2 ₀ , node 2 ₁ , node 2 ₂ , ..., node 2 _M1-1 includes the multicast routing information of their respective non-leaf child nodes, which can be referred to above According to the relevant description in the text, each non-leaf child node of node 2 ₀ further includes the multicast routing information of its own non-leaf child nodes, and so on, and node 2 ₁ , node 2 ₂ , ..., node 2 _M1-1 are similar , for the sake of brevity, they are not described here.

In step 620, when the first node and the second node cannot communicate normally, the first node processes the first multicast packet based on the target backup path to obtain a second multicast packet.

Wherein, the second multicast message may include indication information of the target backup path, and the second multicast message may include a multicast routing identifier of a child node of the second node in the first multicast tree. The target backup path may be pre-stored on the first node.

It should be understood that failure to communicate normally may include failure of the second node, or failure of a link between the first node and the second node.

As shown in (a) of Figure 9, assuming that node B is the first node and node R is the second node, the failure of normal communication between the first node and the second node may be due to equipment failure at node R, and node R cannot receive the information sent by node B. Similarly, the first multicast packet cannot receive packets from nodes other than node B, and node R cannot send the first multicast packet to its child nodes.

As shown in (b) of Figure 9, assuming that node B is the first node and node R is the second node, the failure of the first node and the second node to communicate normally may be that the link between node B and node R fails, At this time, node R cannot receive the first multicast message sent by node B, but node R can receive messages sent by other nodes except node B. It should be understood that the failure of the link between node B and node R may be the failure or disconnection of the network cable, optical fiber or optical cable connected between node B and node R, or the interface connecting node B and node R If a fault occurs, as shown in (b) of Figure 9, the interface B_p2 of node B is connected to the interface R_p0 of node R, and the link between node B and node R fails, which may be the interface B_p2 of node B and the interface R_p0 of node R. /or interface R_p0 of node R fails.

It should also be understood that the first node can perceive whether it can communicate with the second node normally through a bidirectional forwarding detection (BFD) mechanism. As shown in FIG. 9, when node B is the first node and node R is the second node When , node B can perceive whether it can communicate with node R normally through the BFD mechanism. The first node may also perceive whether it can communicate with the second node normally through other methods, which is not limited in this application.

As shown in FIG. 9, assume that node B is the first node, and node R is the second node. Node B perceives that it cannot communicate normally with node R. For example, node R shown in (a) of FIG. 9 has a device failure, or , the link between node B and node R shown in (b) of FIG. 9 fails. Processing the first multicast packet can be understood as processing the packet header of the first multicast packet, not processing the payload of the first multicast packet, and processing the packet header of the first multicast packet The processing may be based on the target backup path to modify the indication information of the packet forwarding path in the first multicast packet header to obtain the second multicast packet. As mentioned above, the second multicast packet The header of the message may contain the indication information of the target backup path.

Optionally, the second multicast packet may include the multicast routing identifier of the second node, and the multicast routing identifier of the child node of the second node may be included in the multicast routing information of the second node.

Exemplarily, the link between node B and node R shown in (b) of FIG. The link between nodes R fails, and the first multicast message cannot be directly forwarded from interface B_p2 of node B to interface R_p0 of node R, and node B needs to bypass the connection between interface B_p2 of node B and interface R_p0 of node R The faulty link forwards the multicast packet to node R. Node B can be based on the pre-stored target backup path for the failure of normal communication between Node B and Node R, as shown in Figure 10, the right part in Figure 10 can be considered as the second multicast tree, and the target backup path can be Part of the second multicast tree, the indication information of the target backup path may instruct node B to forward the multicast message to node Y (for example, node B may forward the multicast message to interface Y_p0 of node Y through interface B_p1 of node B) , the node Y can forward the multicast message to the node R after receiving the multicast message (for example, the node Y can forward the multicast message to the interface R_p1 of the node R through the interface Y_p2 of the node Y), and the node R continues According to the instruction information of the original path, the multicast message is forwarded to node S and node E, and node S forwards the multicast message to node C and node D, thereby completing the forwarding of the multicast message. Therefore, node B The second multicast message can be obtained after processing the message header of the first multicast message according to the target backup path. At this time, the second multicast message can include the multicast routing information of the node R, and the child nodes of the node R The multicast routing identifiers of (for example, node S and node E) may be included in the multicast routing information of node R.

Assuming that node Y is a third node, as shown in the second multicast message in Figure 11, the second multicast message may include multicast information of node Y, and the multicast information of node Y may include multicast routing information of node Y , the multicast routing information of node Y may include the multicast routing information of node R, and the multicast routing information of node R may include the multicast routing identifier of node R and the multicast routing identifiers of node S and node E, wherein node The multicast routing identifier of S may be included in the multicast routing information of node S, and the multicast routing identifiers of child nodes of node S (eg, node C and node D) may also be included in the multicast routing information of node S.

Optionally, the second multicast packet does not include the multicast routing identifier of the second node.

Exemplarily, a device failure occurs at node R shown in (a) of FIG. Node B receives the first multicast message, and cannot forward the multicast message to the child nodes of node R (for example, node S and node E), node B needs to bypass node R and forward the multicast message to node S and node E. Node B can be based on the pre-stored target backup path for the failure of normal communication between Node B and Node R, as shown in Figure 12, the right part in Figure 12 can be considered as the second multicast tree, and the target backup path can be A part of the second multicast tree, for example, the indication information of the target backup path can instruct node B to forward the multicast message to node Y, and then node Y forwards the multicast message to node Z, and node Z can then forward the group The broadcast message is forwarded to node S, and node S can forward the multicast message to node C and node D, and node D can forward the multicast message to node E, thereby completing the forwarding of the multicast message. Therefore, Node B can process the packet header of the first multicast packet according to the target backup path to obtain the second multicast packet. At this time, the second multicast packet may not include the multicast routing information of node R, but the second multicast packet The second multicast message may include multicast routing identifiers of child nodes of node R (for example, node S and node E).

In the above two examples, node Y may be the third node, and the third node is the first hop node in the target backup path. It can be seen from the above description based on FIG. 9 that node Y is not in the first multicast tree. It should be understood that if there are other nodes between the node B and the node Y, the node Y may not be the third node.

It should be understood that the indication information of the target backup path may include multicast routing information of the third node, and the routing multicast information of the third node may include the multicast routing identifier of the third node and the third node's status in the second multicast tree. The second multicast tree may be used to indicate the forwarding path of the second multicast packet.

Exemplarily, node Y is the third node in the above two examples, so the corresponding second multicast packet in the above examples may include the multicast routing information of node Y.

For example, when there is no device failure at node R, after node R receives the first multicast message, it can also process the message header of the first multicast message to obtain a new multicast message, and node R forwards it to The message headers of the multicast message forwarded by node E and node S can be different, but the load is the same. Therefore, after node R fails, node B can also process the message header of the first multicast message, Obtain different second multicast messages that contain different message headers, such as the second multicast message shown in Figure 13, the second multicast message shown in (a) of Figure 13 can indicate that the group The broadcast message is forwarded by the node S to the node C and the node D, and the second multicast message shown in (b) of Figure 13 can indicate that the multicast message is forwarded by the node S to the node D, and then the node D sends the The multicast packet is forwarded to node E. The second multicast packet shown in (a) of Figure 13 may include multicast information of node Y, the multicast information of node Y may include multicast routing information of node Y, and the multicast routing information of node Y may include Including the multicast routing information of node Z, the multicast routing information of node Z may include the multicast routing identifier of node Z and the multicast routing identifier of node S, wherein the multicast routing identifier of node S may be included in the group of node S In the multicast routing information of node S, the multicast routing identifiers of the child nodes of node S (for example, node C and node D) can also be included in the multicast routing information of node S; the second group shown in (b) of Figure 13 The broadcast message may include the multicast information of node Y, the multicast information of node Y may include the multicast routing information of node Y, the multicast routing information of node Y may include the multicast routing information of node Z, the group The broadcast routing information may include the multicast routing identifier of node Z and the multicast routing information of node S, the multicast routing information of node S may include the multicast routing identifier of node S and the multicast routing information of node D, and the multicast routing information of node D The multicast routing information may include the multicast routing identifier of node D and the multicast routing identifier of node E.

It should also be understood that the format of the indication information of the target backup path may also be a corresponding format generated based on SR technology, IPv6 SR technology, or MPLS technology, which is not limited in this application.

In step 630, the first node sends the second multicast packet to the third node.

As mentioned above, the third node may be the first hop node in the target backup path, and the third node is not in the first multicast tree.

After the first node processes the first multicast packet based on the target backup path and obtains the second multicast packet, the first node has determined which node is the third node, so the first node can send the The second multicast packet.

In a possible implementation manner, the first node may generate the first forwarding table based on one or more backup paths.

Wherein, the first forwarding table may include the indication information of each backup path among one or more backup paths, the adjacent nodes of the first node and the interface identifiers of the adjacent nodes of the first node, and the indication information of each backup path The information corresponds to the adjacent nodes of the first node and the interface identifiers of the adjacent nodes of the first node, and one or more backup paths may include a target backup path.

It should be understood that the backup path may be received by the first path from the controller, the backup path may also be generated by the first node, and the backup path may be pre-stored in the first node. In the case that the first backup is received from the controller, the first node, the second node and the third node are all connected to the controller, and the controller can generate a or multiple backup paths, and send them to the first node; the first node may also calculate one or more backup paths according to the connection relationships of all nodes in the topology where the first node is located.

Table 1 corresponds to the first forwarding table of Node B in FIG. 14 , and the first forwarding table may be pre-stored on Node B.

Table 1 The first forwarding table of node B

Among them, "0", "1" and "2" in the item "interface index" can respectively indicate the interface B_p0, interface B_p1 and interface B_p2 of node B, so the data item "interface index" can also be changed to "this Node's interface identifier", etc., the "0", "1" and "2" in the "interface index" item in the corresponding table can be changed to "B_p0", "B_p1" and "B_p2" respectively. This application There are no restrictions on this.

The data item "adjacent node" and the data item "interface identifier of the adjacent node" in Table 1, combined with Figure 14, it can be seen that the adjacent node of node B corresponding to the interface index "0" is node Q, and the node Q's The interface has 1 interface, that is, interface Q_p0; the adjacent node of node B corresponding to interface index "1" is node Y, and node Y has two 3 interfaces, namely interface Y_p0, interface Y_p1 and interface Y_p2; interface index " The adjacent node of node B corresponding to 2" is node R, and node R has four interfaces, namely interface R_p0, interface R_p1, interface R_p2 and interface R_p3. When the node B is the first node, the adjacent nodes of the node B include the second node.

It should be understood that Table 1 is just an example, and should not impose any limitation on this application. Table 1 only gives the indication information of the backup path corresponding to the interface identifier of the adjacent node of part B. For example, the indication information of the backup path of the interface R_p2 of the node R is "Y-Z", and the indication information of the backup path of the interface R_p3 of the node R is "Y-Z". The indication information is "Y-Z-S-D", for example, the indication information of the backup path of interfaces Y_p1 and Y_p2 of node Y, and interface R_p1 of node R is given, and "..." is omitted, and for example, node Q Interface Q_p0 of node Y, interface Y_p0 of node Y, and interface R_p0 of node R may have no backup path, so "/" in the table indicates no backup path. It should be noted that the indication information of the backup path is only exemplary, and in a specific implementation, the form of the indication information of the backup path may be based on the encapsulation structure of the multicast tree, SR technology, IPv6 technology, or MPLS technology. Storage, this application does not make any limitation on this.

For example, the form of the indication information of the backup path can be based on the encapsulation structure of the multicast tree, and in combination with the topology in Figure 14, "Y-Z" can be stored in the first forwarding table in the form shown in (a) in Figure 15 , where "Y: 001" can indicate that the multicast message can be forwarded through the interface Y_p2 of node Y. It can be seen from Figure 14 that the interface Y_p2 of node Y is connected to node Z. Therefore, "Y: 001 " can also indicate that node Y can forward multicast packets to node Z through interface Y_p2 of node Y. Similarly, "Z: 010" can indicate that multicast packets can be forwarded through interface Z_p1 of node Z. From Figure 14 It can be seen from the figure that the interface Z_p1 of the node Z is connected to the node S, therefore, "Y: 001" can also indicate that the node Z can forward the multicast message to the node S through the interface Z_p1 of the node Z. "Y-Z-S-D" can be stored in the first forwarding table in the form shown in (b) in Figure 15, wherein the meanings of "Y: 001" and "Z: 010" are the same as those described above, and will not be repeated here To repeat, "S:0001" can indicate that the multicast message can be forwarded through the interface S_p3 of the node S. It can be seen from Figure 14 that the interface S_p3 of the node S is connected to the node D. Therefore, "S:0001" It can also indicate that node S can forward multicast packets to node D through interface S_p1 of node S. Similarly, "D: 100" can indicate that multicast packets can be forwarded through interface D_p0 of node D. From Figure 14 It can be seen that the interface D_p1 of the node D is connected to the node E, therefore, "D: 100" can also indicate that the node D can forward the multicast message to the node E through the interface D_p0 of the node D.

It should also be understood that the numbers in "Y: 001", "Z: 010", "S: 0001" and "D: 100" correspond to the bits of the interface of the node. In the embodiment of the present application, "0" means not forwarding through the interface corresponding to this bit, and "1" means forwarding through the interface corresponding to this bit. In practical applications, "0" can also be set to indicate forwarding through the interface corresponding to this bit, and "1" indicates not forwarding through the interface corresponding to this bit, which is not limited in this application.

Optionally, the first forwarding table may further include a backup next hop, where the backup next hop corresponds to an interface identifier of a neighboring node of the first node.

It should be understood that the backup next hop in the first forwarding table is the third node.

Another form of the first forwarding table shown in Table 2 corresponds to Node B in FIG. 14 . The descriptions of the data items "interface index", "adjacent node", "interface identifier of the adjacent node" and "indication information of the backup path" in Table 2 are the same as those in Table 1, and will not be repeated here for brevity.

It should also be understood that the backup next hop corresponds to the indication information of the backup path, and the backup next hop is the first node in the indication information of the backup path, that is to say, the backup next hop is the first node in the target backup path. a node.

Table 2 The first forwarding table of node B

Optionally, according to the first forwarding table, the first node processes the first multicast packet based on the target backup path to obtain the second multicast packet, which may specifically include: the first node may determine The indication information of the backup path corresponding to the first interface of the second node is the indication information of the target backup path, and the first interface of the second node may be the interface corresponding to the second node and the child node of the second node in the first multicast tree , the first node may encapsulate the indication information of the target backup path into the second multicast packet based on the first multicast packet.

For example, assuming that node B is the first node and node R is the second node, in the original forwarding path, node B needs to use the interface B_p2 to forward the message to node R, and node R needs to use the interface R_p2 to forward the message to Node S forwards the message to node E through interface R_p3. When node B and node R cannot communicate normally, node B can backup the corresponding backup data of interface R_p2 and interface R_p3 of node R in the above-mentioned first forwarding table. The indication information of the path is determined as the indication information of the target backup path, and the indication information of the target backup path may be encapsulated into the second multicast message based on the first multicast message.

Optionally, based on the first forwarding table shown in Table 2, the first node sends the second multicast message to the third node, which may specifically include: the first node may determine the first forwarding table of the second node in the first forwarding table The backup next hop corresponding to an interface is the third node, the first interface of the second node may be the interface corresponding to the second node and the child node of the second node in the first multicast tree, and the first node may send a message to the third node Send the second multicast message.

For example, assuming that node B is the first node and node R is the second node, when the normal communication between node B and node R fails and the second multicast message is obtained, node B can perform the first multicast message shown in Table 2. In a forwarding table, the backup next hop corresponding to interfaces R_p2 and R_p3 of node R is the third node, that is, node Y is determined as the third node, and the second multicast message is sent to node Y.

It should be understood that, based on the foregoing first forwarding table, the second multicast packet does not include the multicast routing identifier of the second node.

In another possible implementation manner, the first node may generate the second forwarding table based on one or more backup paths.

Wherein, the second forwarding table may include indication information of each of the one or more backup paths and the interface identifier of the first node, the indication information of each backup path corresponds to the interface identifier of the first node, one or The plurality of backup paths includes a target backup path.

It should be understood that, as mentioned above, the backup path may be received by the first path from the controller, the backup path may also be generated by the first node, and the backup path may be pre-stored in the first node. For the sake of brevity, details are not repeated here, and detailed descriptions may refer to related descriptions above.

Table 3 corresponds to the second forwarding table of Node B in FIG. 14 , and the second forwarding table may be pre-stored on Node B.

Table 3 The second forwarding table of node B

interface index Interface ID of this node Instructions for backup paths 0 B_p0 / 1 B_p1 ... 2 B_p2 Y: 010

In the second forwarding table shown in Table 3, the descriptions of the data items "interface index" and "indication information of the backup path" are the same as those in Table 1, and will not be repeated here for brevity.

The column "interface identifier of this node" corresponds to the column "interface index", wherein "0", "1" and "2" correspond to interface B_p0, interface B_p1 and interface B_p2 of node B respectively.

Among them, the indication information "Y:010" of the backup path corresponding to the interface B_p2 can indicate that the multicast message can be forwarded through the interface Y_p1 of the node Y. It can be seen from Figure 14 that the interface Y_p1 of the node Y is connected to the node R , thus, "Y:010" may also indicate that node Y can forward the multicast message to node R through interface Y_p1 of node Y.

Optionally, the second forwarding table may further include a backup interface identifier, where the backup interface identifier corresponds to the interface of the first node.

Another form of the second forwarding table shown in Table 4 corresponds to Node B in FIG. 14 . The descriptions of the data items "interface index" and "indication information of the backup path" in Table 4 are the same as those in Table 1, and will not be repeated here for brevity.

It should also be understood that the backup interface corresponds to the indication information of the backup path, and the backup interface may indicate which interface of the first node the first node forwards the multicast message through. Which node is the node.

Table 4 The second forwarding table of node B

interface index Interface ID of this node Instructions for backup paths ID of the backup interface 0 B_p0 / / 1 B_p1 ... ... 2 B_p2 Y: 010 B_p1

It should be understood that Table 3 and Table 4 are exemplary, and the data item "interface index" that may not be included in Table 3 and Table 4, or, when the data item "interface index" is not included in Table 3 and Table 4, The corresponding B_p0, B_p1 and B_p2 in the "interface identifier of this node" can also be changed to "0", "1" and "2" respectively, which is not limited in this application.

Optionally, according to the second forwarding table, the first node processes the first multicast packet based on the target backup path to obtain the second multicast packet, which may specifically include: the first node may determine The indication information of the backup path corresponding to the first interface of the first node is the indication information of the target backup path, the first interface of the first node is the interface corresponding to the second node among the interfaces of the first node, and the first node is based on the first The multicast message encapsulates the indication information of the target backup path into the second multicast message.

For example, suppose node B is the first node and node R is the second node. In the original forwarding path, node B needs to use the interface B_p2 to forward the message to node R. When node B and node R cannot communicate normally , the node B may determine the indication information of the backup path corresponding to the interface B_p2 of the node B as the indication information of the target backup path in the above-mentioned second forwarding table, and may determine the indication information of the target backup path based on the first multicast message The indication information is encapsulated into the second multicast packet.

Optionally, based on the second forwarding table shown in Table 4, the first node sends the second multicast message to the third node, which may specifically include: the first node may determine the first node of the first node in the second forwarding table The node corresponding to the backup interface corresponding to an interface is the third node, the first interface of the first node is the interface corresponding to the second node among the interfaces of the first node, and the first node can correspond to the first node through the first interface of the first node The backup interface of the device sends the second multicast message to the third node.

For example, assuming that node B is the first node and node R is the second node, when the normal communication between node B and node R fails and the second multicast message is obtained, node B can perform the first multicast message shown in Table 4. In the second forwarding table, the node corresponding to the backup interface B_p1 corresponding to the interface B_p2 of the node B is determined as the third node, that is, the node Y is determined as the third node, and the second multicast message is sent to the node Y.

It should be understood that, based on the above second forwarding table, the second multicast packet includes multicast routing information of the second node, and the multicast routing identifier of the child node of the second node is included in the multicast routing information of the second node.

FIG. 16 is a schematic diagram of a first multicast message provided by an embodiment of the present application before the first node and the second node fail to communicate normally.

In FIG. 16, node B is the first node, and node R is the second node. Before node B and node R cannot communicate normally, based on the first multicast message shown in FIG. 16 and in combination with FIG. 14, node B can forward the multicast message to node R through interface B_p2 of node B, and node R can forward the multicast message to node S and node E through interface R_p2 and interface R_p3 of node R respectively based on the addressing field , the node S can forward the multicast packet to the node C and the node D through the interface S_p2 and the interface S_p3 of the node S respectively based on the addressing field.

FIG. 17 is a schematic diagram of a comparison between the first multicast packet and the second multicast packet before and after the first node and the second node fail to communicate normally according to the embodiment of the present application.

In FIG. 17, node B is the first node, and node R is the second node. (a) of FIG. 17 shows a schematic diagram of the second multicast message before node B and node R cannot communicate normally, based on FIG. 17 For the second multicast message shown in (a), the node R can forward the multicast message to the node S and the node E through the interface R_p2 and the interface R_p3 of the node R respectively and based on the addressing field, and the node S can The multicast packet is forwarded to node C and node D through interface S_p2 and interface S_p3 of node S respectively based on the addressing field.

(b) of FIG. 17 shows a schematic diagram of two second multicast packets that Node B can generate based on the first forwarding table (such as Table 1 or Table 2) after Node B and Node R fail to communicate normally. For the first second multicast message shown in (b) of Figure 17, node B can send the second multicast message to node Y, and node Y can forward the multicast message through interface Y_p2 of node Y For node Z, node Z can forward the multicast packet to node S through interface Z_p1 of node Z, and node S can forward the multicast packet to node S through interface S_p2 and interface S_p3 of node S respectively based on the addressing field C and node D; for the second second multicast message shown in (b) of Figure 17, node B can send the second multicast message to node Y, and node Y can pass the interface Y_p2 of node Y to The multicast packet is forwarded to node Z, node Z can forward the multicast packet to node S through interface Z_p1 of node Z, node S can forward the multicast packet to node D through interface S_p3 of node S, and node D The multicast packet can be forwarded to node E through interface D_p0 of node D.

Alternatively, after Node B and Node R fail to communicate normally, Node B may also generate a second multicast packet based on the first forwarding table (such as Table 1 or Table 2), as shown in (c) of FIG. 17 . When the first node finds based on the forwarding table that the multiple backup paths involved in the first multicast message have the same node or overlapped parts, the first node may also generate a second backup path based on the overlapped parts of the two backup paths. Two multicast packets. For example, after Node B and Node R fail to communicate normally, Node B discovers the backup paths "Y-Z" and "Y-Z-S-D" involved in the first multicast message based on the first forwarding table of Node B shown in Table 1 or Table 2 There is an overlapping part "Y-Z", or the same node, such as node Y and node Z, that is to say, the multicast message must pass through node Y and node Z, so node B can generate a second group broadcast Text, as shown in (c) of Figure 17. The multicast message shown in (c) of FIG. 17 can also be regarded as a combination of the two second multicast messages shown in (b) of FIG. 17 .

For the second multicast message shown in (c) of Figure 17, node B can send the second multicast message to node Y, and node Y can forward the multicast message to node through interface Y_p1 of node Y Z, node Z can forward the multicast message to node S through interface Z_p1 of node Z, and node S can forward the multicast message to node C through interface S_p2 and interface S_p3 of node S respectively based on the addressing field and node D, node D can forward the multicast packet to node E through interface D_p0 of node D.

Or, after Node B and Node R fail to communicate normally, Node B may also generate a second multicast packet based on the second forwarding table (such as Table 3 or Table 4), as shown in (d) of FIG. 17 . (d) of FIG. 17 shows another schematic diagram of a second multicast message that Node B can generate based on the second forwarding table (such as Table 3 or Table 4) after Node B and Node R fail to communicate normally. (d) of 17 shows the second multicast message, the node B can send the second multicast message to the node Y, and the node Y can forward the multicast message to the node R through the interface Y_p1 of the node Y, Node R can forward the multicast message to node S and node E through the interface R_p2 and interface R_p3 of node R respectively based on the addressing field, and node S can respectively pass the interface S_p2 and interface S_p3 of node S and based on the addressing field field, and forward the multicast message to node C and node D.

Based on the multicast message structure of the multicast tree, a backup path that can bypass the faulty node or faulty link is pre-stored on the nodes participating in the multicast message forwarding. When the first node perceives that the second node has a device failure or When the link between the first node and the second node fails, you can search for the target backup path in the pre-stored backup path, encapsulate the target backup path into a message, and send the message based on the target backup path , so that when the first node and the second node cannot communicate normally, they can quickly switch to the target backup path, encapsulate the target backup path into a message, and continue sending messages based on the target backup path. This method will not waste bandwidth, and can also provide a reliable guarantee mechanism for multicast.

As shown in Figure 18, in (a) of Figure 18, the left side is the network topology diagram of the entity, the right side is the multicast tree, and the node Z includes entity A (or node A), entity B, entity C (or Node C), entity D and entity E, and the connection relationship between entity A, entity B, entity C, entity D and entity E is a ring connection as shown in the figure, node Z can also be called virtual node Z, multicast message The multicast routing identifier of the forwarding path between entities in the virtual node Z can be expressed as "000100", wherein the first bit can indicate whether a node is a virtual node, such as in "000100", the first The number "0" in the first bit can indicate that the node is a virtual node, and if the number in the first bit is "1", it can indicate that the node is not a virtual node. It should be understood that in practical applications, "1" may be used to indicate a virtual node, and "0" may be used to indicate that it is not a virtual node, and this application does not make any limitation on this. The last five bits in "000100" respectively correspond to whether entity A, entity B, entity C, entity D, and entity E need to forward multicast packets to nodes other than the virtual node Z from left to right, starting from " 000100", it can be seen that the bit corresponding to entity C is "1". Therefore, entity C needs to forward multicast packets to nodes other than the virtual node Z. Of course, in practical applications, "0" can also be used Indicates that multicast packets need to be forwarded to nodes other than virtual nodes, and "1" indicates that multicast packets do not need to be forwarded to nodes other than virtual nodes, which is not limited in this application.

It should also be understood that the path for forwarding multicast packets between entities in the virtual node may have a default path. For example, the default path for forwarding multicast packets from entity A to entity C between entities in virtual node Z may be: entity A forwards the multicast packet to entity B, and entity B forwards the multicast packet to entity C, or, the default path may also be: entity A forwards the multicast packet to entity E, entity E forwards the multicast packet to entity D, and entity D forwards the multicast packet to entity C. This application does not make any limitation to this.

(a) of Figure 18 also includes node 3 (or entity 3), node F (or entity F) and node K (or entity K), node 3 is connected to node A, node C is connected to node F and node K connect.

When normal communication between nodes or entities is possible, the multicast message received by node A from node 3 may be as shown in (b) of FIG. 18 . It should be understood that, in the multicast message shown in (b) of FIG. 18 , "0" is used in the first bit to indicate that the node is a virtual node, and "1" is used to indicate that the node is not a virtual node. According to the multicast message, it can be seen that node A needs to forward the multicast message to virtual node Z, and virtual node Z needs to forward the multicast message to node F and node K through node C. Assume that the default path for forwarding multicast packets from entity A to entity C between entities in virtual node Z is: entity A forwards the multicast packet to entity B, and entity B forwards the multicast packet to entity C . When a device failure occurs in entity B, that is, when entity A cannot forward multicast packets through interface A_p1, entity C will not be able to receive multicast packets, so when entity A and entity B cannot communicate normally (you can It is the equipment failure of entity B, or the link failure between entity A and entity B), entity A can forward the multicast message through the interface A_p2, so that the multicast message can pass through entity A Interface A_p2 of interface A_p2 reaches entity E, and entity E forwards the multicast packet to entity D, and entity D forwards the multicast packet to entity C, thus completing the forwarding of multicast packets in virtual node Z, and the multicast packet The text can also reach node C from node A through virtual node Z. Therefore, in this case, the multicast routing information of virtual node Z in the multicast message sent by node A to virtual node Z does not need to be changed.

As shown in Figure 19, in Figure 19 (a), the left side is the network topology diagram of the entity, the right side is the multicast tree, node X and node Z are two virtual nodes, and virtual node X includes entity A, Entity E, Entity Q and Entity P, the connection relationship between Entity A, Entity E, Entity Q and Entity P is a ring connection as shown in the figure, and virtual node Z includes Entity A, Entity B, Entity C, Entity D and Entity E , and the connection relationship between Entity A, Entity B, Entity C, Entity D, and Entity E is a ring connection as shown in the figure. It can be seen from the figure that there are two parallel links between entity A and entity E, which are the link between entity A and entity E through interface A_p1, and the link between entity A and entity E through interface A_p2 road.

Assume that virtual node Z wants to send a multicast packet to virtual node X. When the nodes or entities can communicate normally, the multicast message received by the virtual node Z or generated by the virtual node Z is shown in (b) of Figure 19, assuming that the bits of the multicast routing identifier of the virtual node Z are divided by Except for the first bit, they correspond to entity A, entity B, entity C, entity D, and entity E in turn, and the bits of the multicast routing identifier of virtual node X are except for the first bit, which in turn correspond to entity A, entity E, entity Q, and entity P . It can be seen from "Z: 010000" in the multicast message that virtual node Z needs to send a multicast message to virtual node X through entity A. For example, the default path for virtual node Z to send a multicast packet to virtual node X is: entity A sends a multicast packet to entity E through interface A_p1 of entity A. When entity A and entity E cannot communicate normally (it may be that the link between entity A and entity B fails), entity A can send multicast packets to entity E through interface A_p2. Therefore, virtual node Z sends a multicast packet to virtual The multicast routing information of virtual node X in the multicast message of node Z does not need to be changed either.

Fig. 20 is a schematic block diagram of a communication device provided by an embodiment of the present application. As shown in FIG. 20 , the communication device 2000 may include: a processing unit 2010 and a transceiver unit 2020 . The apparatus 2000 may correspond to the first node in the method 600, for example, may be the first node, or a component configured in the first node, such as a circuit, a chip, a chip system, and the like.

The communication device 2000 may be used to realize the functions of each step performed by the first node in the method 600 . When the communication device 2000 is used to perform the steps in the communication method 600, the transceiver unit 2020 can be used to obtain a first multicast message, the first multicast message includes multicast routing information of the second node, and the second The multicast routing information of the node includes the multicast routing identifier of the second node and the multicast routing identifier of the subnode of the second node in the first multicast tree, and the second node is a non-subnode of the first node in the first multicast tree. Leaf sub-nodes, the first multicast tree is used to indicate the forwarding path of the first multicast message; the processing unit 2010 can be used for normal communication including the second node when the first node and the second node cannot communicate normally failure or a link failure between the first node and the second node, the first multicast message is processed based on the target backup path, and the second multicast message is obtained, and the second multicast message includes an indication of the target backup path information, and the second multicast packet includes the multicast routing identifier of the child node of the second node in the first multicast tree, wherein the multicast routing identifier of a node is used for the node to determine the next hop of the node; The unit 2020 may also be configured to send the second multicast message to a third node, the third node is the first hop node in the target backup path, and the third node is not in the first multicast tree.

Optionally, the second multicast packet includes the multicast routing identifier of the second node, and the multicast routing identifier of the child node of the second node is included in the multicast routing information of the second node.

Optionally, the second multicast packet does not include the multicast routing identifier of the second node.

Optionally, the processing unit 2010 may also be configured to generate a first forwarding table based on one or more backup paths, and the first forwarding table includes indication information of each backup path in the one or more backup paths and the first node's The interface identifiers of the adjacent nodes and the adjacent nodes of the first node, the indication information of each backup path corresponds to the interface identifiers of the adjacent nodes of the first node and the adjacent nodes of the first node, and one or more backup paths include Destination backup path.

Optionally, the first forwarding table further includes a backup next hop, where the backup next hop corresponds to an interface identifier of a neighboring node of the first node.

Optionally, the processing unit 2010 may also be configured to determine that the indication information of the backup path corresponding to the first interface of the second node in the first forwarding table is the indication information of the target backup path, and the first interface of the second node is the indication information of the second node An interface corresponding to the child node of the second node in the first multicast tree; and encapsulating the indication information of the target backup path into the second multicast message based on the first multicast message.

Optionally, the processing unit 2010 may also be configured to determine that the backup next hop corresponding to the first interface of the second node in the first forwarding table is the third node, and the first interface of the second node is the second node and the first group The interface corresponding to the child node of the second node in the broadcast tree; the transceiver unit 2020 can also be used to send the second multicast message to the third node.

Optionally, the processing unit 2010 may also be configured to generate a second forwarding table based on one or more backup paths, and the second forwarding table includes indication information of each backup path in the one or more backup paths and the first node's An interface identifier, the indication information of each backup path corresponds to the interface identifier of the first node, and one or more backup paths include a target backup path.

Optionally, the second forwarding table further includes a backup interface identifier, where the backup interface identifier corresponds to the interface of the first node.

Optionally, the processing unit 2010 may also be configured to determine that the indication information of the backup path corresponding to the first interface of the first node in the second forwarding table is the indication information of the target backup path, and the first interface of the first node is the first node The interface corresponding to the second node among the interfaces; and encapsulating the indication information of the target backup path into the second multicast message based on the first multicast message.

Optionally, the processing unit 2010 may also be configured to determine that the node corresponding to the backup interface corresponding to the first interface of the first node in the second forwarding table is the third node, and the first interface of the first node is the interface of the first node The interface corresponding to the second node; the transceiver unit 2020 can also be configured to send the second multicast message to the third node through the backup interface corresponding to the first interface of the first node.

Optionally, the one or more backup paths are received by the first node from the controller, and the first node, the second node and the third node are all connected to the controller.

Optionally, the one or more backup paths are calculated by the first node based on connection relationships of all nodes in the topology where the first node is located.

Optionally, the first multicast message is received by the first node from the controller or the last hop node of the first node, and the multicast routing information of the second node includes the multicast information of the first node.

Optionally, the first multicast message is generated by the first node based on connection relationships of all nodes in the topology where the first node is located, and the first multicast message does not include the multicast routing identifier of the first node.

Optionally, the indication information of the target backup path includes multicast routing information of the third node, and the routing multicast information of the third node includes the multicast routing identifier of the third node and the third node's location in the second multicast tree. The multicast routing information of the non-leaf child nodes, the second multicast tree is used to indicate the forwarding path of the second multicast message.

Fig. 21 is a schematic block diagram of another communication device provided by an embodiment of the present application. The communication device 2100 may be used to implement the function of the first node in the above method. The communication device 2100 may be a system on a chip. In the embodiment of the present application, the system-on-a-chip may be composed of chips, or may include chips and other discrete devices.

As shown in FIG. 21 , the communication device 2100 may include at least one processor 2110 configured to implement the function of the first node in the method provided by the embodiment of the present application.

Exemplarily, when the communication device 2100 is used to realize the function of the first node in the communication method provided by the embodiment of the present application, the processor 2110 may be used to obtain the first multicast message, the first multicast message includes the first The multicast routing information of the second node, the multicast routing information of the second node includes the multicast routing identifier of the second node and the multicast routing identifier of the child node of the second node in the first multicast tree, and the second node is the multicast routing identifier of the second node A non-leaf child node of the first node in the multicast tree, the first multicast tree is used to indicate the forwarding path of the first multicast packet, wherein the multicast routing identifier of a node is used by the node to determine the next node of the node One hop; when the first node and the second node cannot communicate normally, the failure of normal communication includes the failure of the second node or the link failure between the first node and the second node, based on the target backup path to the first multicast The message is processed to obtain the second multicast message, the second multicast message includes the indication information of the target backup path, and the second multicast message includes the multicast message of the child node of the second node in the first multicast tree Routing identifier; sending the second multicast message to the third node, the third node is the first hop node in the target backup path, and the third node is not in the first multicast tree. For details, refer to the detailed description in the method example, and details are not repeated here.

The communication device 2100 may also include at least one memory 2120 for storing program instructions and/or data. The memory 2120 is coupled to the processor 2110 . The coupling in the embodiments of the present application is an indirect coupling or a communication connection between devices, units or modules, which may be in electrical, mechanical or other forms, and is used for information exchange between devices, units or modules. Processor 2110 may cooperate with memory 2120 . Processor 2110 may execute program instructions stored in memory 2120 . At least one of the at least one memory may be included in the processor.

The communication device 2100 may also include a communication interface 2130 for communicating with other devices through a transmission medium, so that the devices used in the communication device 2100 can communicate with other devices, for example, other devices may be the second node or the third node or controller. The communication interface 2130 may be, for example, a transceiver, an interface, a bus, a circuit, or a device capable of implementing a transceiver function. The processor 2110 may use the communication interface 2130 to send and receive data and/or information, and be used to implement the method performed by the first node described in the embodiment corresponding to FIG. 6 .

In this embodiment of the present application, a specific connection medium among the processor 2110, the memory 2120, and the communication interface 2130 is not limited. In the embodiment of the present application, in FIG. 21 , the processor 2110 , the memory 2120 and the communication interface 2130 are connected through a bus 2140 . The bus 2140 is represented by a thick line in FIG. 21 , and the connection manner between other components is only for schematic illustration and is not limited thereto. The bus can be divided into address bus, data bus, control bus and so on. For ease of representation, only one thick line is used in FIG. 21 , but it does not mean that there is only one bus or one type of bus.

The present application also provides a chip system, the chip system includes at least one processor, configured to implement the functions involved in the method executed by the first node in the embodiment shown in FIG. 6 above, for example, receive or process the above method data and/or information referred to in .

In a possible design, the chip system further includes a memory, the memory is used to store program instructions and data, and the memory is located inside or outside the processor.

The system-on-a-chip may consist of chips, or may include chips and other discrete devices.

The present application also provides a computer program product, the computer program product including: a computer program (also referred to as code, or instruction), when the computer program is executed, the first node executes the implementation as shown in Figure 6 example method.

The present application also provides a computer-readable storage medium, where the computer-readable storage medium stores a computer program (also called a code, or an instruction). When the computer program is executed, the first node is made to execute the method of the embodiment shown in FIG. 6 .

It should be understood that the processor in this embodiment of the present application may be an integrated circuit chip that has a signal processing capability. In the implementation process, each step of the above-mentioned method embodiments may be completed by an integrated logic circuit of hardware in a processor or instructions in the form of software. The above-mentioned processor may be a general-purpose processor, a digital signal processor (digital signal processor, DSP), an application specific integrated circuit (application specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or other programmable Logic devices, discrete gate or transistor logic devices, discrete hardware components. Various methods, steps, and logic block diagrams disclosed in the embodiments of the present application may be implemented or executed. A general-purpose processor may be a microprocessor, or the processor may be any conventional processor, or the like. The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, register. The storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps of the above method in combination with its hardware.

It should also be understood that the memory in the embodiments of the present application may be a volatile memory or a nonvolatile memory, or may include both volatile and nonvolatile memories. Among them, the non-volatile memory can be read-only memory (read-only memory, ROM), programmable read-only memory (programmable ROM, PROM), erasable programmable read-only memory (erasable PROM, EPROM), electrically programmable Erases programmable read-only memory (electrically EPROM, EEPROM) or flash memory. Volatile memory can be random access memory (RAM), which acts as external cache memory. By way of illustration and not limitation, many forms of RAM are available, such as static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), synchronous dynamic random access memory (synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (double data rateSDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous connection dynamic random access memory (synchlink DRAM, SLDRAM) And direct memory bus random access memory (directrambus RAM, DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but not be limited to, these and any other suitable types of memory.

The terms "unit", "module" and the like used in this specification may be used to denote a computer-related entity, hardware, firmware, a combination of hardware and software, software, or software in execution.

Those of ordinary skill in the art can realize that various illustrative logical blocks (illustrative logical blocks) and steps (steps) described in conjunction with the embodiments disclosed herein can be implemented with electronic hardware, or a combination of computer software and electronic hardware. accomplish. Whether these functions are executed by hardware or software 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 regarded as exceeding the scope of the present application. In the several embodiments provided in this application, it should be understood that the disclosed devices, 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 units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or May be integrated into another system, or some features may be ignored, 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 units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. 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.

In the above embodiments, the functions of each functional unit may be fully or partially implemented by software, hardware, firmware or any combination thereof. When implemented using software, it may be implemented in whole or in part in the form of a computer program product. The computer program product comprises one or more computer instructions (programs). When the computer program instructions (program) are loaded and executed on the computer, the processes or functions according to the embodiments of the present application will be generated in whole or in part. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website, computer, server or data center Transmission to another website site, computer, server or data center by wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.). The computer-readable storage medium may be any available medium that can be accessed by a computer, or a data storage device such as a server or a data center integrated with one or more available media. The available medium may be a magnetic medium (such as a floppy disk, a hard disk, or a magnetic tape), an optical medium (such as a digital versatile disk (digital video disc, DVD)), or a semiconductor medium (such as a solid state disk (solid state disk, SSD) )wait.

If the functions described above are realized in the form of software function units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: various media capable of storing program codes such as U disk, mobile hard disk, ROM, RAM, magnetic disk or optical disk.

The above is only a 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 substitutions within the technical scope disclosed in the application. Should be covered within the protection scope 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 communication method, characterized in that the method comprises: The first node acquires a first multicast packet, the first multicast packet includes multicast routing information of a second node, and the multicast routing information of the second node includes a multicast routing identifier of the second node and the multicast routing identifier of the subnode of the second node in the first multicast tree, the second node is a non-leaf subnode of the first node in the first multicast tree, and the second node is a non-leaf subnode of the first node in the first multicast tree. The multicast tree is used to indicate the forwarding path of the first multicast message; wherein, the multicast routing identifier of a node is used to determine the next hop of the node; In the case that the first node cannot communicate normally with the second node, the failure to communicate normally includes failure of the second node or a link failure between the first node and the second node, The first node processes the first multicast packet based on the target backup path to obtain a second multicast packet, the second multicast packet includes indication information of the target backup path, and the The second multicast packet includes a multicast routing identifier of a child node of the second node in the first multicast tree; The first node sends the second multicast packet to a third node, the third node is the first hop node in the target backup path, and the third node is not in the first multicast tree middle. 2. The method according to claim 1, wherein the second multicast packet includes the multicast routing identifier of the second node, and the multicast routing identifier of the child node of the second node is included in In the multicast routing information of the second node. 3. The method according to claim 1, wherein the second multicast packet does not include the multicast routing identifier of the second node. 4. The method according to any one of claims 1 to 3, further comprising: The first node generates a first forwarding table based on one or more backup paths, and the first forwarding table includes indication information of each backup path in the one or more backup paths and the first node's The interface identifiers of the adjacent nodes and the adjacent nodes of the first node, and the indication information of each backup path corresponds to the interface identifiers of the adjacent nodes of the first node and the adjacent nodes of the first node, so The one or more backup paths include the target backup path. 5. The method according to claim 4, wherein the first forwarding table further includes a backup next hop, and the backup next hop corresponds to an interface identifier of an adjacent node of the first node. 6. The method according to claim 4 or 5, wherein the first node processes the first multicast message based on a target backup path to obtain a second multicast message, including: The first node determines that the indication information of the backup path corresponding to the first interface of the second node in the first forwarding table is the indication information of the target backup path, and the first interface of the second node is the indication information of the second node. Interfaces corresponding to two nodes and child nodes of the second node in the first multicast tree; The first node encapsulates the indication information of the target backup path into a second multicast packet based on the first multicast packet. 7. The method according to claim 5 or 6, wherein the first node sends the second multicast message to a third node, comprising: The first node determines that the backup next hop corresponding to the first interface of the second node in the first forwarding table is the third node, and the first interface of the second node is the second node an interface corresponding to a child node of the second node in the first multicast tree; The first node sends the second multicast packet to the third node. 8. The method of claim 2, further comprising: The first node generates a second forwarding table based on one or more backup paths, and the second forwarding table includes indication information of each backup path in the one or more backup paths and the first node's An interface identifier, the indication information of each backup path corresponds to the interface identifier of the first node, and the one or more backup paths include the target backup path. 9. The method according to claim 8, wherein the second forwarding table further includes a backup interface identifier, and the backup interface identifier corresponds to the interface of the first node. 10. The method according to claim 8 or 9, wherein the first node processes the first multicast message based on a target backup path to obtain a second multicast message, comprising: The first node determines that the indication information of the backup path corresponding to the first interface of the first node in the second forwarding table is the indication information of the target backup path, and the first interface of the first node is the an interface corresponding to the second node among the interfaces of a node; The first node encapsulates the indication information of the target backup path into a second multicast packet based on the first multicast packet. 11. The method according to claim 9 or 10, wherein the first node sends the second multicast message to a third node, comprising: The first node determines that the node corresponding to the backup interface corresponding to the first interface of the first node in the second forwarding table is the third node, and the first interface of the first node is the second an interface corresponding to the second node among the interfaces of a node; The first node sends the second multicast packet to the third node through a backup interface corresponding to the first interface of the first node. 12. The method according to any one of claims 4 to 11, wherein the one or more backup paths are received by the first node from a controller, the first node, the second Both the node and the third node are connected to the controller. 13. The method according to any one of claims 4 to 11, wherein the one or more backup paths are the first node based on all nodes in the topology where the first node is located The connection relationship is calculated. 14. The method according to any one of claims 1 to 13, wherein the first multicast message is received by the first node from the controller or the last hop node of the first node Yes, the multicast routing information of the second node is included in the multicast information of the first node. 15. The method according to any one of claims 1 to 13, wherein the first multicast message is the first node based on all nodes in the topology where the first node is located The connection relationship is generated, and the first multicast packet does not include the multicast routing identifier of the first node. 16. The method according to any one of claims 1 to 15, wherein the indication information of the target backup path includes multicast routing information of the third node, and the multicast routing information of the third node The information includes the multicast routing identifier of the third node and the multicast routing information of the non-leaf child nodes of the third node in the second multicast tree, and the second multicast tree is used to indicate the The forwarding path of the second multicast packet. 17. A communication device, characterized in that the communication device comprises a unit for implementing the method according to any one of claims 1 to 16. 18. A communication device, characterized in that it includes at least one processor, and the at least one processor is used to execute the program or instruction, so that the device implements the communication device according to any one of claims 1 to 16. method. 19. A computer-readable storage medium, characterized in that instructions are stored in the computer-readable storage medium, and when the instructions are run on a computer, the computer executes any one of claims 1 to 16. method described in the item. 20. A computer program product, characterized in that it includes program codes, and when the program codes are run on a computer, the computer is made to implement the method according to any one of claims 1 to 16.

Images