WO2022194193A1

WO2022194193A1 - Method and apparatus for acquiring path

Info

Publication number: WO2022194193A1
Application number: PCT/CN2022/081132
Authority: WO
Inventors: 刘淑英; 段方红; 梅小玲
Original assignee: 华为技术有限公司
Priority date: 2021-03-18
Filing date: 2022-03-16
Publication date: 2022-09-22

Abstract

The present application relates to the field of communications, and provides a method and apparatus for acquiring a path. The method is applied to a BIER network, and comprises: a control device acquires a BIER network topology, the BIER network topology comprising a BFIR and at least one BFER; the control device obtains a correspondence on the basis of a service demand and the BIER network topology, the correspondence comprising a BFR-ID of the at least one BFER and information of a next hop; and the control device sends the correspondence to the BFIR. The control device obtains a correspondence on the basis of the service demand and the BIER network topology, the correspondence being more consistent with the requirements of service path planning, and sends the correspondence to the BFIR without requiring the BFIR to obtain the correspondence by learning, thereby improving the multicast deployment efficiency.

Description

Method and apparatus for obtaining a path

This application requires the Chinese patent application filed on March 18, 2021 with the application number of 202110290636.4 and the title of the invention as "A method and device for determining a path" and the application number of 202110872818.2 filed on July 30, 2021, and the title of the invention. The priority of the Chinese patent application for "Method and Apparatus for Obtaining a Path", the entire contents of which are incorporated herein by reference.

technical field

The embodiments of the present application relate to the field of communications, and in particular, to a method and apparatus for acquiring a path.

Background technique

Bit indexed explicit replication (BIER) or bit indexed explicit replication (internet protocol version 6, IPv6) encapsulation (bit index explicit replication IPv6 encapsulation, BIERv6) is a A multicast forwarding technology that explicitly replicates the bit index. In the BIER subdomain, BIER bit-forwarding routers (BFR) such as the BIER forwarding ingress router (BFIR) and the BIER forwarding egress router (BFER) are assigned unique BFR identifier (identifier, ID).

In the process of forwarding multicast packets, BFIR needs to specify which BFERs to send multicast packets to, and thus needs to obtain paths. In the related art, the BFER set to which the multicast message is sent is represented by a bit string, and the position or index of each bit in the bit string represents the BFR ID of an edge router. The BFR sends the bitstring-encapsulated multicast packet to the downstream router according to the bit index forwarding table (BIFT). The downstream router parses the bitstring and copies the packet according to its own BIFT table, and sends it to the BFER hop by hop.

In the related art, the BIFT table is generated by the BIRT table, the BIRT table entry comes from the mapping relationship between the BFR ID and the BFR prefix (prefix), and the BIRT table indicates the next hop of the route. It follows the shortest path first (SPF) principle. However, the BIFT forwarding table generated by the SPF principle based on the routing table learned by each device sometimes cannot meet the requirements of service path planning.

SUMMARY OF THE INVENTION

The present application proposes a method and apparatus for obtaining a path to meet the requirements of service path planning.

In a first aspect, a method for obtaining a path is provided, the method is applied to a BIER network, including: a control device obtains a BIER network topology, the BIER network topology includes a BFIR and at least one BFER; the control device is based on business requirements. and the BIER network topology to obtain the corresponding relationship, the corresponding relationship includes the BFR-ID of at least one BFER and the information of the next hop; the control device sends the corresponding relationship to the BFIR.

In the technical solution provided by this application, the control device obtains the corresponding relationship based on the business requirements and the BIER network topology, and the corresponding relationship is more in line with the requirements of business path planning, and the corresponding relationship is sent to the BFIR, without the need for the BFIR to obtain the corresponding relationship through learning. The efficiency of multicast deployment is improved. In addition, because the control device obtains the corresponding relationship and sends it to the BFIR in a static configuration, it can solve the problem of one-hop traffic diversion in complex networking environments such as autonomous systems (AS) or heterogeneous networking.

In a possible implementation manner, the at least one BFER includes a first BFER, and the obtaining, by the control device, the BIER network topology includes: the control device receiving first information from the BFIR, where the first information includes all The BFR-ID of the BFIR and the end.BIER address of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and the link information of the BFIR;

The control device receives second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the end.BIER address of the first BFER, and the node of the first BFER attribute, neighbor information of the first BFER and link information of the first BFER;

The control device obtains the BIER network topology based on the first information and the second information, and the BIER network topology includes the information of the BFIR, the information of the first BFER that is the neighbor of the BFIR, and Link SLA information between the BFIR and the first BFER.

In a possible implementation manner, the link information in this application refers to link SLA information. Link SLA information includes but is not limited to: link bandwidth, delay, internet protocol (IP) address, interior gateway protocol (IGP) metric (metric), risk link group (Shared Risk Link Group, SRLG) and other information.

In a possible implementation manner, the at least one BFER includes a first BFER, and the obtaining, by the control device, the BIER network topology includes: the control device receiving first information from the BFIR, where the first information includes all The BFR-ID of the BFIR and the multi-protocol label switching MPLS label of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and the link information of the BFIR;

The control device receives second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the MPLS label of the first BFER, the node attribute of the first BFER, neighbor information of the first BFER and link information of the first BFER;

In a possible implementation manner, the at least one BFER includes a first BFER, and the obtaining, by the control device, the BIER network topology includes: the control device receiving first information from the BFIR, where the first information includes all The BFR-ID of the BFIR and the bit index forwarding table BIFT identification of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and the link information of the BFIR;

The control device receives second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the BIFT identifier of the first BFER, the node attribute of the first BFER, neighbor information of the first BFER and link information of the first BFER;

The control device receives third information from the intermediate BFR, the third information includes the end.BIER address of the intermediate BFR, the node attribute of the intermediate BFR, the neighbor information of the intermediate BFR, and the information of the intermediate BFR. link information;

The control device obtains the BIER network topology based on the first information, the second information and the third information, where the BIER network topology includes the information of the BFIR, the Information of the intermediate BFR, information of the first BFER, link SLA information between the BFIR and the intermediate BFR, and link SLA information between the intermediate BFR and the first BFER.

In a possible implementation manner, the at least one BFER includes a first BFER, and the obtaining, by the control device, the BIER network topology includes: the control device receiving first information from the BFIR, where the first information includes all The BFR-ID of the BFIR and the MPLS label of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and the link information of the BFIR;

The control device receives third information from the intermediate BFR, the third information includes the MPLS label of the intermediate BFR, the node attribute of the intermediate BFR, the neighbor information of the intermediate BFR, and the link of the intermediate BFR information;

In a possible implementation manner, the at least one BFER includes a first BFER, and the obtaining, by the control device, the BIER network topology includes: the control device receiving first information from the BFIR, where the first information includes all The BFR-ID of the BFIR and the BIFT identity of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and the link information of the BFIR;

The control device receives third information from an intermediate BFR, the third information includes a BIFT identity of the intermediate BFR, node attributes of the intermediate BFR, neighbor information of the intermediate BFR, and links of the intermediate BFR information;

In a possible implementation manner, the receiving, by the control device, the first information from the BFIR includes: the control device receiving the first information sent by the route reflector RR that communicates with the BFIR; or the The control device receives the first information sent by the BFIR.

In this way of obtaining the BIER network topology, in the way that the control device interacts with the RR to obtain the first information, the control device does not need to obtain information by interacting with each device in the network topology, thus further saving the resources of the control device.

In a possible implementation manner, the receiving, by the control device, the second information from the first BFER includes: the control device receiving the second information sent by the RR communicating with the first BFER; or The control device receives the second information sent by the intermediate BFR in communication with the first BFER; or the control device receives the second information sent by the first BFER.

In a possible implementation manner, the second information further includes multicast source group information corresponding to the first BFER.

In a possible implementation manner, the control device acquiring the corresponding relationship based on service requirements and the BIER network topology includes: the control device acquires target BFR information based on service requirements; the control device acquires target BFR information based on the service requirements; and the BIER network topology, obtain the corresponding relationship, and the information of the next hop in the corresponding relationship is the information of the target BFR.

In a possible implementation manner, the service requirements include one or more of bandwidth, delay, packet loss, and designated nodes.

In a possible implementation manner, the information of the next hop includes the end.BIER address of the node serving as the BFIR neighbor and outgoing interface information for communicating with the node serving as the BFIR neighbor.

In a possible implementation manner, the second information further includes one or more of subdomain identifiers SD, BSL, and set identifiers SI.

In a possible implementation manner, the BFR-ID of the first BFER is an identifier dynamically acquired by the first BFER, and the dynamic acquisition is an unused identifier acquired from a set of BFR-IDs.

In a second aspect, a method for obtaining a path is provided, the method is applied to a network that explicitly replicates BIER based on a bit index, including: BIER forwarding the ingress router BFIR to receive the correspondence sent by the control device, the correspondence The bit forwarding router identification BFR-ID and next hop information of the at least one BFER are included.

In a possible implementation manner, before the BFIR receives the correspondence sent by the control device, the method further includes: the BFIR sends first information to the control device, where the first information includes the BFR-ID of the BFIR and the end.BIER address of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR, and the link information of the BFIR.

In a possible implementation manner, before the BFIR receives the correspondence sent by the control device, the method further includes: the BFIR sends first information to the control device, where the first information includes the BFR-ID of the BFIR The MPLS label, the node attribute of the BFIR, the neighbor information of the BFIR and the link information of the BFIR are exchanged with the multi-protocol label of the BFIR.

In a possible implementation manner, before the BFIR receives the correspondence sent by the control device, the method further includes: the BFIR sends first information to the control device, where the first information includes the BFR-ID of the BFIR and the bit index forwarding table of the BFIR, the BIFT identifier, the node attribute of the BFIR, the neighbor information of the BFIR, and the link information of the BFIR.

In a possible implementation manner, the sending, by the BFIR, the first information to the control device includes: the BFIR sending the first information to the route reflector RR; or the BFIR directly sending all the information to the control device. the first information.

In a third aspect, an apparatus for obtaining a path is provided, the apparatus is applied in a network that explicitly replicates BIER based on a bit index, including:

The first acquisition module is used to acquire the BIER network topology, and the BIER network topology includes the BIER forwarding ingress router BFIR and at least one BIER forwarding egress router BFER;

The second acquisition module is used to acquire a corresponding relationship based on service requirements and the BIER network topology, and the corresponding relationship includes the bit forwarding router identifier BFR-ID of the at least one BFER and the information of the next hop;

A sending module, configured to send the corresponding relationship to the BFIR.

In a possible implementation manner, the at least one BFER includes a first BFER, and the first acquisition module is configured to receive first information from the BFIR, where the first information includes the BFR- ID and end.BIER address of the BFIR, node attributes of the BFIR, neighbor information of the BFIR and link information of the BFIR;

Receive second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the end.BIER address of the first BFER, the node attribute of the first BFER, the neighbor information of the first BFER and link information of the first BFER;

Based on the first information and the second information, the BIER network topology is obtained, and the BIER network topology includes the information of the BFIR, the information of the first BFER that is the neighbor of the BFIR, and the BFIR and the Link SLA information between the first BFERs.

In a possible implementation manner, the at least one BFER includes a first BFER, and the first acquisition module is configured to receive first information from the BFIR, where the first information includes the BFR- ID and the multi-protocol label switching MPLS label of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and the link information of the BFIR;

Receive second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the MPLS label of the first BFER, the node attribute of the first BFER, the first BFER neighbor information of the BFER and link information of the first BFER;

In a possible implementation manner, the at least one BFER includes a first BFER, and the first acquisition module is configured to receive first information from the BFIR, where the first information includes the BFR- ID and bit index forwarding table BIFT identification of the BFIR, node attributes of the BFIR, neighbor information of the BFIR and link information of the BFIR;

Receive second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the BIFT identifier of the first BFER, the node attribute of the first BFER, the first BFER neighbor information of the BFER and link information of the first BFER;

receiving third information from the intermediate BFR, the third information including the end.BIER address of the intermediate BFR, the node attribute of the intermediate BFR, the neighbor information of the intermediate BFR, and the link information of the intermediate BFR;

Based on the first information, the second information and the third information, the BIER network topology is obtained, where the BIER network topology includes the information of the BFIR and the information of the intermediate BFR that is the neighbor of the BFIR , the information of the first BFER, the link SLA information between the BFIR and the intermediate BFR, and the link SLA information between the intermediate BFR and the first BFER.

In a possible implementation manner, the at least one BFER includes a first BFER, and the first acquisition module is configured to receive first information from the BFIR, where the first information includes the BFR- ID and MPLS label of the BFIR, node attributes of the BFIR, neighbor information of the BFIR and link information of the BFIR;

receiving third information from an intermediate BFR, where the third information includes an MPLS label of the intermediate BFR, a node attribute of the intermediate BFR, neighbor information of the intermediate BFR, and link information of the intermediate BFR;

In a possible implementation manner, the at least one BFER includes a first BFER, and the first acquisition module is configured to receive first information from the BFIR, where the first information includes the BFR- ID and BIFT identification of the BFIR, node attributes of the BFIR, neighbor information of the BFIR and link information of the BFIR;

receiving third information from an intermediate BFR, where the third information includes a BIFT identity of the intermediate BFR, a node attribute of the intermediate BFR, neighbor information of the intermediate BFR, and link information of the intermediate BFR;

In a possible implementation manner, the first obtaining module is configured to receive the first information sent by the route reflector RR that communicates with the BFIR; or receive the first information sent by the BFIR.

In a possible implementation manner, the first obtaining module is configured to receive the second information sent by the RR in communication with the first BFER; or receive the second information sent by the intermediate BFR in communication with the first BFER the second information; or receive the second information sent by the first BFER.

In a possible implementation manner, the second obtaining module is configured to obtain the information of the target BFR based on business requirements; and obtain the corresponding relationship based on the information of the target BFR and the BIER network topology, and the corresponding The information of the next hop in the relationship is the information of the target BFR.

In a fourth aspect, a device for obtaining a path is provided, the device is applied to a network that explicitly replicates BIER based on a bit index, including:

The receiving module is configured to receive the correspondence sent by the control device, where the correspondence includes the bit forwarding router identification BFR-ID of the at least one BFER and the information of the next hop.

In a possible implementation, the apparatus further includes:

A sending module, configured to send first information to the control device, where the first information includes the BFR-ID of the BFIR and the end.BIER address of the BFIR, the node attribute of the BFIR, and the neighbors of the BFIR information and link information of the BFIR.

In a possible implementation, the apparatus further includes:

A sending module, configured to send first information to the control device, the first information includes the BFR-ID of the BFIR and the multi-protocol label switching MPLS label of the BFIR, the node attribute of the BFIR, the BFIR neighbor information and link information of the BFIR.

In a possible implementation, the apparatus further includes:

A sending module, configured to send first information to the control device, where the first information includes the BFR-ID of the BFIR and the bit index forwarding table BIFT identifier of the BFIR, the node attribute of the BFIR, the BFIR neighbor information and link information of the BFIR.

In a possible implementation manner, the sending module is configured to send the first information to the route reflector RR; or directly send the first information to the control device.

In a fifth aspect, a network device is provided, comprising a processor, the processor is coupled to a memory, and at least one program instruction or code is stored in the memory, and the at least one program instruction or code is loaded and executed by the processor, so that the network device realizes The method for obtaining a path of any one of the first aspect or the second aspect.

A sixth aspect provides a computer-readable storage medium, where at least one program instruction or code is stored in the storage medium, and when the program instruction or code is loaded and executed by a processor, the computer implements the method as described in the first aspect or the second aspect. Any of the described methods for obtaining a path.

In a seventh aspect, a system for obtaining a path is provided, the system includes a control device and a BFIR device, and the control device is configured to execute the method described in the first aspect or any possible implementation manner of the first aspect. In the method for obtaining a path, the BFIR device is configured to execute the method for obtaining a path according to the second aspect or any possible implementation manner of the second aspect.

Another communication apparatus is provided that includes a transceiver, a memory, and a processor. The transceiver, the memory and the processor communicate with each other through an internal connection path, the memory is used for storing instructions, and the processor is used for executing the instructions stored in the memory to control the transceiver to receive signals and control the transceiver to send signals , and when the processor executes the instructions stored in the memory, it causes the processor to execute the method in the first aspect or any possible implementation manner of the first aspect, or execute the second aspect or any one of the second aspect method in a possible implementation.

As an exemplary embodiment, the processor is one or more, and the memory is one or more.

As an exemplary embodiment, the memory may be integrated with the processor, or the memory may be provided separately from the processor.

In the specific implementation process, the memory can be a non-transitory memory, such as a read only memory (ROM), which can be integrated with the processor on the same chip, or can be separately set in different On the chip, the embodiment of the present application does not limit the type of the memory and the setting manner of the memory and the processor.

A computer program (product) is provided, the computer program (product) comprising: computer program code which, when executed by a computer, causes the computer to perform the methods of the above aspects.

A chip is provided, including a processor for invoking and executing instructions stored in a memory, so that a communication device on which the chip is installed performs the methods in the above-mentioned aspects.

Another chip is provided, including: an input interface, an output interface, a processor, and a memory, the input interface, the output interface, the processor, and the memory are connected through an internal connection path, and the processor is used to execute all The code in the memory, when the code is executed, the processor is configured to perform the methods of the above aspects.

Description of drawings

1 is a schematic diagram of a BIER network provided by an embodiment of the present application;

2 is a flowchart of a method for obtaining a path provided by an embodiment of the present application;

3 is a schematic diagram of an implementation environment of a method for obtaining a path provided by an embodiment of the present application;

4 is a flowchart of another method for obtaining a path provided by an embodiment of the present application;

5 is a schematic diagram of an implementation environment of another method for obtaining a path provided by an embodiment of the present application;

6 is a flowchart of another method for obtaining a path provided by an embodiment of the present application;

7 is a schematic diagram of a multicast forwarding path provided by an embodiment of the present application;

8 is a schematic diagram of another multicast forwarding path provided by an embodiment of the present application;

9 is a schematic structural diagram of an apparatus for obtaining a path provided by an embodiment of the present application;

10 is a schematic structural diagram of another apparatus for obtaining a path provided by an embodiment of the present application;

11 is a schematic structural diagram of another apparatus for obtaining a path provided by an embodiment of the present application;

FIG. 12 is a schematic structural diagram of a network device provided by an embodiment of the present application;

13 is a schematic structural diagram of a network device provided by an embodiment of the present application;

FIG. 14 is a schematic structural diagram of a network device provided by an embodiment of the present application.

Detailed ways

The terms used in the embodiment part of the present application are only used to explain the embodiments of the present application, and are not intended to limit the present application. The embodiments of the present application will be described below with reference to the accompanying drawings.

BIER or BIERv6, as a technology for constructing a multicast packet forwarding path in the field of communication, has been applied more and more widely. In the BIER subdomain, BFIR and BFER are assigned a unique identification BFR-ID. Exemplarily, the BFR-ID is an integer ranging from 1 to 65535.

In addition, when BIER or BIERv6 carries multicast services, a BGP neighbor is established between BFIR and BFER through the border gateway protocol (BGP), and a BIER forwarding tunnel is established through BGP to transmit user multicast requests. For example, when an end user wants to watch a certain multicast channel program, it sends the Internet Group Management Protocol (IGMP) (Internet Protocol Version 4) for the channel to its upstream BIER multicast leaf node. (internet protocol version 4, IPv4)) or multicast label distribution protocol (multicast label distribute protocol, MLDP) (internet protocol version 6 (internet protocol version 6, IPv6)) multicast join request; if the leaf node does not have this channel data , the multicast join request is sent to the BFIR through the BGP protocol. After receiving the multicast join request from the leaf node, the BFIR sets the bit in the bitstring corresponding to the BFR-id of the leaf node to 1. Thus, a bitstring for transmitting the multicast channel data is generated.

In a sub domain, the BFER set to which a multicast packet is sent is represented by a bitstring, and the position or index of each bit in the bitstring represents the BFR-ID of an edge node; BFIR encapsulates this bitstring in the multicast packet In the BIER header of the message, BFIR sends the bitstring-encapsulated multicast message to the downstream BFR according to BIFT. The downstream BFR parses the bitstring, replicates the packet according to its own BIFT table, and sends the replicated packet to the BFER node in the sub domain hop by hop. The BFER node parses the bitstring, checks that it matches itself, the destination node of the BIER multicast, deletes the outer encapsulation including the BIER information, continues to search the user multicast forwarding table, and forwards the original multicast packet to the requesting user according to the search result.

The contents in the BIFT table have a corresponding relationship, and the corresponding relationship can be determined based on a message transmission path. In some carrier networks or enterprise networks, due to the importance of services, specific paths need to be planned, or multiple different paths need to be planned for service backup, or certain path delay, bandwidth, and specified location constraints need to be set. condition. For these scenarios, an embodiment of the present application provides a method for obtaining a path, the method can be applied to a BIER network, and the corresponding relationship obtained by the method can meet the requirements of service path planning. Exemplarily, the methods provided in the embodiments of the present application can be used for planning and deployment of BIER and BIERv6 service paths.

Taking the BIER network shown in FIG. 1 as an example, the BIER network includes five provider edges (provider edges, PE), namely PE1, PE2, PE3, PE4 and PE5. Among them, the BFR-id of PE1 is 1 (indicated by id=1 in Figure 1), the BFR-id of PE2 is 2 (indicated by id=2 in Figure 1), and the BFR-id of PE3 is 3 (indicated by id=2 in Figure 1 ) id=3), the BFR-id of PE4 is 4 (represented by id=4 in FIG. 1 ), and the BFR-id of PE5 is 5 (represented by id=5 in FIG. 1 ). In addition, the PEs in the BIER network also include three provider backbone routers (provider backbone, P), such as P1, P2 and P3 as shown in FIG. 1 . Optionally, the BIER network may further include a route reflector (route reflector, RR). Or, a certain device in the BIER network has the RR function, for example, P1 in FIG. 1 has the RR function.

With reference to the BIER network shown in FIG. 1 , the method for obtaining a path provided by the embodiment of the present application is illustrated as an example. Referring to FIG. 2 , the method includes the following steps.

Step 201, the control device acquires a BIER network topology, where the BIER network topology includes a BFIR and at least one BFER.

The control device is a device with a path calculation capability, including but not limited to a controller or a BFIR with a path calculation capability, or other devices with a path calculation capability. The manner in which the control device acquires the BIER network topology is not limited in the embodiments of the present application. In a possible implementation manner, the BIER network topology acquired by the control device includes BFIR and at least one BFER, and at least one BFER includes the first BFER. Depending on the structure of the BIER network topology, the manner in which the control device obtains the BIER network topology includes but is not limited to the following situations.

Case 1, for a BIERv6 scenario where there is no intermediate BFR between the BFIR and the first BFER, the control device acquiring the BIER network topology includes: the control device receives the first information from the BFIR, and the first information includes the BFR-ID of the BFIR and the end of the BFIR. .BIER address, node attribute of BFIR, neighbor information of BFIR and link information of BFIR; the control device receives the second information from the first BFER, and the second information includes the BFR-ID of the first BFER and the end of the first BFER. The BIER address, the node attribute of the first BFER, the neighbor information of the first BFER, and the link information of the first BFER; the control device obtains the BIER network topology based on the first information and the second information, and the BIER network topology includes BFIR information, as Information about the first BFER of the BFIR neighbor and link SLA information between the BFIR and the first BFER.

The node attributes of BFIR include but are not limited to BFR-prefix; the neighbor information of BFIR includes at least one BFER; the link information of BFIR refers to link SLA information, including but not limited to: link bandwidth, delay, IP address, IGP metric, SRLG and other information. The node attributes of the first BFER include but are not limited to BFR-prefix; the link information of the first BFER refers to link SLA information, including but not limited to: link bandwidth, delay, IP address, IGP metric, SRLG and other information. The neighbor information of the first BFER includes BFIR.

Exemplarily, the control device can establish BGP neighbors with the BFIR and the first BFER respectively, for example, the control device establishes a BGP_LS peer (peer) with the BFIR and the first BFER respectively, the control device receives the first information sent by the BFIR through the BGP_LS, and controls The device receives the second information sent by the first BFER through BGP_LS. The control device can determine that the first BFER is a neighbor of the BFIR based on the first information and the second information, and then obtain information including the BFIR, the information of the first BFER serving as a neighbor of the BFIR, and the link SLA information between the BFIR and the first BFER BIER network topology. Wherein, the information of the BFIR included in the BIER network topology obtained in this situation includes but is not limited to the BFR-ID of the BFIR, the end.BIER address of the BFIR, and the node attribute of the BFIR, and the information of the first BFER includes but is not limited to the first BFER. The BFR-ID of the BFER, the end.BIER address of the first BFER, and the node attribute of the first BFER.

Situation 2, for the BIER MPLS scenario that does not have an intermediate BFR between the BFIR and the first BFER, the control device acquiring the BIER network topology includes: the control device receives the first information from the BFIR, and the first information includes the BFR-ID of the BFIR and the BFIR's Multi-protocol label switching MPLS label, node attribute of BFIR, neighbor information of BFIR, and link information of BFIR; the control device receives second information from the first BFER, and the second information includes the BFR-ID of the first BFER, the first BFER The MPLS label of the first BFER, the node attribute of the first BFER, the neighbor information of the first BFER and the link information of the first BFER; the control device obtains the BIER network topology based on the first information and the second information, and the BIER network topology includes the information of the BFIR, Information of the first BFER as a neighbor of the BFIR and link SLA information between the BFIR and the first BFER.

The node attributes of the BFIR, the neighbor information of the BFIR, the link information of the BFIR, the node attributes of the first BFER, the neighbor information of the first BFER, and the link information of the first BFER may refer to the description in the above-mentioned case 1, here No longer.

Exemplarily, the control device can establish BGP neighbors with BFIR and the first BFER respectively, for example, the control device and BFIR and the first BFER respectively establish a BGP_LS peer, the control device receives the first information sent by the BFIR through BGP_LS, and the control device receives the first BFER Second information sent through BGP_LS. The control device obtains, based on the first information and the second information, a BIER network topology including BFIR information, information of a first BFER that is a neighbor of the BFIR, and link SLA information between the BFIR and the first BFER. Wherein, the information of the BFIR included in the BIER network topology obtained in the second case includes but is not limited to the BFR-ID of the BFIR, the MPLS label of the BFIR and the node attribute of the BFIR, and the information of the first BFER includes but is not limited to the first BFER BFR-ID, MPLS label of the first BFER, and node attributes of the first BFER.

Situation 3, for the BIER MPLS scenario that does not have an intermediate BFR between the BFIR and the first BFER, the control device acquiring the BIER network topology includes: the control device receives the first information from the BFIR, and the first information includes the BFR-ID of the BFIR and the BFIR of the BFIR. Bit index forwarding table BIFT identifier, node attribute of BFIR, neighbor information of BFIR and link information of BFIR; the control device receives second information from the first BFER, the second information includes the BFR-ID of the first BFER, the first BFER The BIFT identification, the node attribute of the first BFER, the neighbor information of the first BFER and the link information of the first BFER; the control device obtains the BIER network topology based on the first information and the second information, and the BIER network topology includes the information of the BFIR, Information of the first BFER as a neighbor of the BFIR and link SLA information between the BFIR and the first BFER.

Exemplarily, the control device can establish BGP neighbors with BFIR and the first BFER respectively, for example, the control device and BFIR and the first BFER respectively establish a BGP_LS peer, the control device receives the first information sent by the BFIR through BGP_LS, and the control device receives the first BFER Second information sent through BGP_LS. The control device obtains, based on the first information and the second information, a BIER network topology including BFIR information, information of a first BFER that is a neighbor of the BFIR, and link SLA information between the BFIR and the first BFER. Wherein, the information of the BFIR included in the BIER network topology obtained in the third situation includes but is not limited to the BFR-ID of the BFIR, the BIFT identifier of the BFIR, and the node attribute of the BFIR, and the information of the first BFER includes but is not limited to the first BFER's BFR-ID, BIFT identifier of the first BFER, and node attributes of the first BFER.

Case 4, for a BIERv6 scenario with an intermediate BFR between the BFIR and the first BFER, obtaining the BIER network topology by the control device includes: the control device receives the first information from the BFIR, and the first information includes the BFR-ID of the BFIR and the end of the BFIR. BIER address, node attribute of BFIR, neighbor information of BFIR, and link information of BFIR; the control device receives the second information from the first BFER, and the second information includes the BFR-ID of the first BFER and the end.BIER of the first BFER address, node attributes of the first BFER, neighbor information of the first BFER, and link information of the first BFER; the control device receives third information from the intermediate BFR, and the third information includes the end.BIER address of the intermediate BFR, the Node attributes, neighbor information of the intermediate BFR, and link information of the intermediate BFR; the control device obtains the BIER network topology based on the first information, the second information, and the third information, and the BIER network topology includes the information of the BFIR and the intermediate BFR as the neighbor of the BFIR. information, the information of the first BFER, the link SLA information between the BFIR and the intermediate BFR, and the link SLA information between the intermediate BFR and the first BFER.

For the node attribute of the BFIR, the link information of the BFIR, the node attribute of the first BFER, and the link information of the first BFER, reference may be made to the description in the foregoing case 1, and details are not repeated here.

In addition, in the fourth case, in addition to the BFIR and the first BFER, the BIER network topology includes at least one intermediate BFR between the BFIR and the first BFER, the neighbor information of the BFIR includes the intermediate BFR, and the neighbor information of the first BFER Including intermediate BFR. In addition to receiving the first information sent by the BFIR and the second information sent by the first BFER, the control device also receives the third information sent by the intermediate BFR. The node attributes of the intermediate BFR include but are not limited to BFR-prefix; the neighbor information of the intermediate BFR includes at least one BFER or the BFR reaching at least one BFER, the BFIR or the BFR reaching the BFIR; the link information of the intermediate BFR refers to the link SLA Information, including but not limited to: link bandwidth, delay, IP address, IGP metric, SRLG and other information.

Exemplarily, the control device can establish a BGP neighbor with the BFIR, the first BFER and the intermediate BFR respectively, for example, the control device and the BFIR, the first BFER and the intermediate BFR respectively establish a BGP_LS peer, and the control device receives the first information sent by the BFIR through the BGP_LS, The control device receives the second information sent by the first BFER through BGP_LS, and the control device receives the third information sent by the intermediate BFR through BGP_LS. The control device obtains, based on the first information, the second information, and the third information, information including BFIR, information of an intermediate BFR that is a neighbor of the BFIR, information of the first BFER, link SLA information between the BFIR and the intermediate BFR, and intermediate BFR BIER network topology for link SLA information with the first BFER.

Wherein, the information of the BFIR included in the BIER network topology obtained in the fourth case includes but is not limited to the BFR-ID of the BFIR, the end.BIER address of the BFIR and the node attribute of the BFIR, and the information of the first BFER includes but is not limited to the first The BFR-ID of the BFER, the end.BIER address of the first BFER and the node attribute of the first BFER, the information of the intermediate BFR includes but not limited to the end.BIER address of the intermediate BFR and the node attribute of the intermediate BFR.

For example, in the BIER network shown in Figure 1, PE1 is the BFIR, PE2 is the first BFER, and P1 and P2 are the intermediate BFRs between PE1 and PE2, respectively. All devices establish BGP_LS peers with the control device respectively. PE1 reports the BFR-ID of PE1, the end.BIER address of PE1, the node attribute of PE1, the neighbor information of PE1 and the link information of PE1 to the control device through BGP_LS; PE2 reports to the control device through BGP_LS Report the BFR-ID of PE2, the end.BIER address of PE2, the node attribute of PE2, the neighbor information of PE2 and the link information of PE2 to the control device; P1 sends the end.BIER address of P1, the node attribute of P1, The neighbor information of P1 and the link information of P1 are reported to the control device; P2 reports the end.BIER address of P2, the node attribute of P2, the neighbor information of P2 and the link information of P2 to the control device through BGP_LS; the control device is based on PE1 , The information reported by PE2, P1 and P2 includes the information of PE1, the information of P1 as the neighbor of PE1, the information of P2 as the neighbor of P1, the information of PE2, the SLA information of the link between PE1 and P1, the information of the link between P1 and P2 BIER network topology of link SLA information and link SLA information between P2 and PE2.

Case 5, for a BIER MPLS scenario with an intermediate BFR between the BFIR and the first BFER, obtaining the BIER network topology by the control device includes: the control device receives the first information from the BFIR, and the first information includes the BFR-ID of the BFIR and the MPLS of the BFIR. label, node attribute of BFIR, neighbor information of BFIR and link information of BFIR; the control device receives second information from the first BFER, the second information includes the BFR-ID of the first BFER, the MPLS label of the first BFER, the first BFER Node attributes of a BFER, neighbor information of the first BFER and link information of the first BFER; the control device receives third information from the intermediate BFR, the third information includes the MPLS label of the intermediate BFR, the node attribute of the intermediate BFR, the intermediate BFR The neighbor information and the link information of the intermediate BFR; the control device obtains the BIER network topology based on the first information, the second information and the third information, and the BIER network topology includes the information of the BFIR, the information of the intermediate BFR as the BFIR neighbor, the first BFER information, link SLA information between the BFIR and the intermediate BFR, and link SLA information between the intermediate BFR and the first BFER.

In addition, in case 5, in addition to the BFIR and the first BFER, the BIER network topology includes at least one intermediate BFR between the BFIR and the first BFER, the neighbor information of the BFIR includes the intermediate BFR, and the neighbor information of the first BFER Including intermediate BFR. In addition to receiving the first information sent by the BFIR and the second information sent by the first BFER, the control device also receives the third information sent by the intermediate BFR. The node attributes of the intermediate BFR include but are not limited to BFR-prefix; the neighbor information of the intermediate BFR includes at least one BFER or the BFR reaching at least one BFER, the BFIR or the BFR reaching the BFIR; the link information of the intermediate BFR refers to the link SLA Information, including but not limited to: link bandwidth, delay, IP address, IGP metric, SRLG and other information.

Wherein, the information of the BFIR included in the BIER network topology obtained in the fifth situation includes but is not limited to the BFR-ID of the BFIR, the MPLS label of the BFIR, and the node attribute of the BFIR, and the information of the first BFER includes but is not limited to the first BFER The BFR-ID, the MPLS label of the first BFER, and the node attribute of the first BFER, the information of the intermediate BFR includes but not limited to the MPLS label of the intermediate BFR and the node attribute of the intermediate BFR.

For example, in the BIER network shown in Figure 1, PE1 is the BFIR, PE2 is the first BFER, and P1 and P2 are the intermediate BFRs between PE1 and PE2, respectively. All devices establish BGP_LS peers with the control device respectively. PE1 reports the BFR-ID of PE1, the MPLS label of PE1, the node attribute of PE1, the neighbor information of PE1 and the link information of PE1 to the control device through BGP_LS; PE2 reports PE2 through BGP_LS The BFR-ID of PE2, the MPLS label of PE2, the node attribute of PE2, the neighbor information of PE2 and the link information of PE2 are reported to the control device; P1 reports the MPLS label of P1, the node attribute of P1, the neighbor information of P1 and the information of P1 through BGP_LS. The link information is reported to the control device; P2 reports the MPLS label of P2, the node attribute of P2, the neighbor information of P2 and the link information of P2 to the control device through BGP_LS; the control device is based on the information reported by PE1, PE2, P1 and P2. Information acquisition includes the information of PE1, the information of P1 as the neighbor of PE1, the information of P2 as the neighbor of P1, the information of PE2, the SLA information of the link between PE1 and P1, the SLA information of the link between P1 and P2, the information of P2 and PE2 BIER network topology for link SLA information.

Scenario 6, for a BIER MPLS scenario with an intermediate BFR between the BFIR and the first BFER, obtaining the BIER network topology by the control device includes: the control device receives the first information from the BFIR, and the first information includes the BFR-ID of the BFIR and the BIFT of the BFIR. identification, node attributes of BFIR, neighbor information of BFIR, and link information of BFIR; the control device receives second information from the first BFER, and the second information includes the BFR-ID of the first BFER, the BIFT identification of the first BFER, the first BFER Node attributes of a BFER, neighbor information of the first BFER and link information of the first BFER; the control device receives third information from the intermediate BFR, the third information includes the BIFT identifier of the intermediate BFR, the node attribute of the intermediate BFR, the intermediate BFR The neighbor information and the link information of the intermediate BFR; the control device obtains the BIER network topology based on the first information, the second information and the third information, and the BIER network topology includes the information of the BFIR, the information of the intermediate BFR as the BFIR neighbor, the first BFER information, link SLA information between the BFIR and the intermediate BFR, and link SLA information between the intermediate BFR and the first BFER.

In addition, in case 6, in addition to the BFIR and the first BFER, the BIER network topology also includes at least one intermediate BFR between the BFIR and the first BFER, the neighbor information of the BFIR includes the intermediate BFR, and the neighbor information of the first BFER Including intermediate BFR. In addition to receiving the first information sent by the BFIR and the second information sent by the first BFER, the control device also receives the third information sent by the intermediate BFR. The node attributes of the intermediate BFR include but are not limited to BFR-prefix; the neighbor information of the intermediate BFR includes at least one BFER or the BFR reaching at least one BFER, the BFIR or the BFR reaching the BFIR; the link information of the intermediate BFR refers to the link SLA Information, including but not limited to: link bandwidth, delay, IP address, IGP metric, SRLG and other information.

Wherein, the information of the BFIR included in the BIER network topology obtained in this situation 6 includes but is not limited to the BFR-ID of the BFIR, the BIFT identifier of the BFIR, and the node attribute of the BFIR, and the information of the first BFER includes but is not limited to the first BFER. The BFR-ID, the BIFT identifier of the first BFER, and the node attribute of the first BFER, and the information of the intermediate BFR includes, but is not limited to, the BIFT identifier of the intermediate BFR and the node attribute of the intermediate BFR.

For example, in the BIER network shown in Figure 1, PE1 is the BFIR, PE2 is the first BFER, and P1 and P2 are the intermediate BFRs between PE1 and PE2, respectively. All devices establish BGP_LS peers with the control device respectively. PE1 reports the BFR-ID of PE1, the BIFT identifier of PE1, the node attribute of PE1, the neighbor information of PE1 and the link information of PE1 to the control device through BGP_LS; PE2 reports PE2 through BGP_LS The BFR-ID of PE2, the BIFT identifier of PE2, the node attribute of PE2, the neighbor information of PE2 and the link information of PE2 are reported to the control device; P1 reports the BIFT identifier of P1, the node attribute of P1, the neighbor information of P1 and the The link information of P2 is reported to the control device; P2 reports the BIFT identifier of P2, the node attribute of P2, the neighbor information of P2 and the link information of P2 to the control device through BGP_LS; the control device is based on the information reported by PE1, PE2, P1 and P2 Information acquisition includes the information of PE1, the information of P1 as the neighbor of PE1, the information of P2 as the neighbor of P1, the information of PE2, the SLA information of the link between PE1 and P1, the SLA information of the link between P1 and P2, the information of P2 and PE2 BIER network topology for link SLA information.

In the above cases 1 to 6, receiving the first information from the BFIR by the control device includes: the control device receives the first information sent by the RR communicating with the BFIR; or the control device receives the first information sent by the BFIR.

In the above-mentioned situations 1 to 6, the control device receiving the second information from the first BFER includes: the control device receives the second information sent by the RR communicated with the first BFER; or the control device receives the information sent by the intermediate BFR communicated with the first BFER. second information; or the control device receives the second information sent by the first BFER.

For the method of reporting information to the control device through the RR, since each device in the BIER network topology does not need to report information to the control device, the RR collects the information of each device in the BIER network topology, and then the RR reports the information to the control device. . In this way, the control device only needs to interact with the RR, and the control device does not need to obtain information by interacting with each device in the network topology, thus further saving the resources of the control device.

For example, each device in the BIER network topology establishes a BGP_LS peer with the RR, and each device in the BIER network collects the interior gateway protocol (IGP) topology, and optionally, also collects information such as bandwidth and link delay. BGP-LS reports the collected information to RR. In addition, each device in the BIER network carries the BIER information by extending the attributes of the BGP_LS, and publishes the BIER information. After the RR collects the information of each device in the BIER network, it reports the information to the control device. The RR also establishes a BGP_LS peer with the control device and reports the collected information to the control device.

Optionally, in the above cases 1 to 6, the second information further includes multicast source group information corresponding to the first BFER. It should be noted that, if the second information does not include the multicast source group information corresponding to the first BFER, the control device may configure the corresponding multicast source group information for the first BFER. This embodiment of the present application does not limit the multicast source group information corresponding to the first BFER, and the multicast source group information corresponding to the first BFER includes but is not limited to the multicast source address and the multicast group identifier.

In addition, in a possible implementation manner, the BFR-ID of the first BFER involved in the above six situations is an identifier dynamically acquired by the first BFER, and the dynamic acquisition is an unused identifier acquired from a set of BFR-IDs 's identification.

Regardless of the above situation, in a possible implementation manner, the second information further includes at least one of a subfield identifier SD, a bitstring length (bitstring length, BSL), and a set identifier SI.

Step 202, the control device obtains a corresponding relationship based on the service requirements and the BIER network topology, where the corresponding relationship includes the BFR-ID of at least one BFER and the information of the next hop.

In a possible implementation manner, the control device displays the BIER network topology, and obtains service requirements based on the displayed BIER network topology. Illustratively, the service requirements include one or more of bandwidth, delay, packet loss, or a designated node. The designated node means that the message transmission path does not include the designated node, or the designated node is not on the message transmission path. Or, the designated node means that the message transmission path includes the designated node, or the designated node is on the message transmission path.

For example, the service requirement includes at least one of devices that the path needs to include, a bandwidth range that the path needs to meet, a delay range that the path needs to meet, and links that need to be avoided. The link that needs to be avoided means that the path does not include the link that needs to be avoided.

When the control device obtains the corresponding relationship based on the service requirements and the BIER network topology, the control device can determine the message transmission path based on the service requirements and the BIER network topology, and determine the corresponding relationship based on the message transmission path. In a possible implementation manner, the control device obtains the corresponding relationship based on business requirements and the BIER network topology, including: the control device obtains the information of the target BFR based on the business requirements, obtains the corresponding relationship based on the information of the target BFR and the BIER network topology, and corresponds to The relationship includes the BFR-ID of at least one BFER and the information of the target BFR. For example, if the service requirement specifies the device to be included in the path, that is, the target BFR, the control device obtains the corresponding relationship based on the information of the target BFR and the BIER network device, and the corresponding relationship includes the BFR-ID of at least one BFER and the next hop. information, the next hop is the target BFR, and the corresponding relationship includes the BFR-ID of at least one BFER and the information of the target BFR.

In a possible implementation manner, the information of the next hop includes the BIFT-ID of the next hop or the end.BIER address of the next hop. Optionally, the information of the next hop includes the end.BIER address of the node serving as the BFIR neighbor and the information of the outgoing interface communicating with the node serving as the BFIR neighbor.

Step 203, the control device sends the corresponding relationship to the BFIR.

This embodiment of the present application does not limit the manner in which the control device sends the corresponding relationship to the BFIR. For example, the control device sends the corresponding relationship to the BFIR through a network configuration protocol (network configuration protocol, NETCONF). Alternatively, the control device may also use other protocols for sending, for example, carrying the corresponding relationship in a traffic engineering (segment routing, SR) policy (policy) for sending.

In a possible implementation manner, in addition to sending the corresponding relationship corresponding to the BFIR to the BFIR, the control device may also send the corresponding relationship corresponding to the BFER to the BFER. If an intermediate BFR is also included between the BFIR and the BFER in the BIER network topology, The control device also sends the corresponding relationship corresponding to the intermediate BFR to the intermediate BFR. The corresponding relationship corresponding to the intermediate BFR includes address information of the intermediate BFR and information of the next hop of the intermediate BFR. The information of the next hop of the intermediate BFR includes the BIFT-ID of the next hop of the intermediate BFR or the end.BIER address of the next hop. Optionally, the information of the next hop of the intermediate BFR further includes the information of the outgoing interface communicated with the next hop.

Exemplarily, the paths that meet the service requirements obtained in the embodiment of the present application may be two, including the main path and the backup path; the main path includes the first BFIR and the first BFER, and the backup path includes the second BFIR and the second BFER, The control device sends the corresponding correspondence to the first BFIR on the primary path and the second BFIR on the backup path, respectively. In a possible implementation manner, each device on the primary path and each device on the backup path are different, so that the primary and backup paths are completely separated and reliability is further ensured.

Step 204, the BFIR receives the correspondence sent by the control device.

As in the above step 201, since the corresponding relationship is obtained based on the BIER network topology, in order to enable the control device to obtain the BIER network topology, each device in the BIER network reports the information of each device to the control device, or each device reports the information to the RR, and the RR Report to the control device. Therefore, for the BFIR, before the BFIR receives the corresponding relationship sent by the control device, it also includes reporting information, and the manner in which the BFIR reports information includes but is not limited to the following situations.

Case 1, before the BFIR receives the correspondence sent by the control device, it further includes: the BFIR sends the first information to the control device, and the first information includes the BFR-ID of the BFIR and the end.BIER address of the BFIR, the node attributes of the BFIR, and the neighbors of the BFIR. information and BFIR link information.

In case 2, before the BFIR receives the correspondence sent by the control device, it also includes: the BFIR sends the first information to the control device, and the first information includes the BFR-ID of the BFIR and the MPLS label of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and Link information for BFIR.

Case 3: Before BFIR receives the correspondence sent by the control device, it also includes: BFIR sends first information to the control device, and the first information includes BFIR's BFR-ID and BFIR's BIFT identifier, BFIR's node attributes, BFIR's neighbor information and Link information for BFIR.

For cases 1 to 3, the way in which BFIR reports the first information to the control device includes but is not limited to establishing a BGP neighbor between BFIR and the control device. For example, BFIR and the control device establish a BGP_LS peer, and send the first information to the control device through BGP-LS.

Optionally, sending the first information to the control device by the BFIR includes: the BFIR sends the first information to the RR; or the BFIR directly sends the first information to the control device.

It should be noted that, after the control device sends the corresponding relationship to the BFIR device, it further includes: the control device receives the path failure information sent by any device on the path; The BFIR device on the re-determined path delivers the corresponding correspondence. If the BFIR device on the re-determined path is the same as the BFIR on the previously determined path, the BFIR may delete the previously received correspondence to save storage space.

In a possible implementation manner, if a path in the network topology fails, the BFIR device may also forward the packet based on the forwarding table learned by the routing protocol, that is, the learned correspondence.

In the method provided by the embodiment of the present application, the control device obtains the corresponding relationship based on the service requirements and the BIER network topology, the corresponding relationship is more in line with the requirements of service path planning, and the corresponding relationship is sent to the BFIR, without the need for the BFIR to obtain the corresponding relationship through learning. The efficiency of multicast deployment is improved. In addition, because the control device obtains the corresponding relationship and sends it to the BFIR in a static configuration, it can solve the problem of one-hop traffic diversion in complex networking environments such as autonomous systems (AS) or heterogeneous networking.

For ease of understanding, take the control device as the controller, the devices in the BIER network report information to the controller through the RR, and the controller statically plans the BIER or BIERv6 multicast service paths and delivers the corresponding relationship as an example. The methods provided in the embodiments of the present application are given by way of example. The implementation environment of the method for obtaining a path is shown in FIG. 3 . In Figure 3, the BIER network device includes 5 PEs, namely PE1, PE2, PE3, PE4 and PE5. The BFR-id of PE1 is 1 (indicated by id=1 in Figure 3), and the BFR-id of PE2 is 2 (indicated by id=2 in Figure 3), the BFR-id of PE3 is 3 (indicated by id=3 in Figure 3), the BFR-id of PE4 is 4 (indicated by id=4 in Figure 3), and the BFR of PE5 -id is 5 (indicated by id=5 in Figure 3). In addition, the PEs in the BIER network also include P1, P2 and P3. RR is also included in the BIER network. With reference to the implementation environment shown in FIG. 3 , as shown in FIG. 4 , the method for obtaining a path includes the following processes.

Step 401, the controller receives the topology information set and the BIER attribute set sent by the RR.

Exemplarily, each device in the BIER network establishes a BGP_LS peer with the RR, and reports the respective information to the RR through the BGP-LS. Taking the BIERv6 scenario as an example, as shown in Figure 3, the RR obtains the information of PE1, PE2, PE3, P1, and P2, and obtains the topology information set and the BIER attribute set. The RR and the controller establish a BGP_LS peer, and the RR reports the topology information set and BIER attribute set to the controller through BGP_LS. Exemplarily, the topology information set includes neighbor information of PE1, neighbor information of PE2, neighbor information of PE3, neighbor information of P1, neighbor information of P2, link information between PE1 and P1, and link information between P1 and P2. , link information between P2 and PE2, link information between P2 and PE3; BIER attribute set includes PE2's BFR-ID, PE2's node attribute, PE2's end.BIER address, PE3's BFR-ID, PE3's node Attribute, end.BIER address of PE3, BFR-ID of PE1, node attribute of PE1, end.BIER address of PE1, end.BIER address of P1, node attribute of P1, end.BIER address of P2, node attribute of P2 . Optionally, the multicast source group information corresponding to PE2 and/or the multicast source group information corresponding to PE3 is also included.

Step 402, the controller obtains the BIER network topology based on the topology information set and the BIER attribute set.

In a possible implementation manner, the controller acquires the BIER network topology including PE1, PE2, PE3, P1 and P2 based on the topology information set and the BIER attribute set.

Optionally, after the controller obtains the BIER network topology based on the topology information set and the BIER attribute set, the controller may display the BIER network topology through the configuration interface, so as to facilitate the user to input service requirements.

After the controller displays the BIER network topology through the configuration interface, the user can enter the service requirements on the configuration interface, such as the equipment that the path needs to pass through, the bandwidth range that the path needs to meet, etc. The controller obtains the service requirements based on the information entered on the configuration interface. Optionally, the user can also specify the path start node, root node, path destination node, and leaf node aggregation node on the configuration interface (usually, the aggregation node of a metropolitan area network can be counted, and the leaf node can be counted as a special user) etc. When calculating the path, the controller can add constraints based on the content specified by the user, so as to determine the path that meets the business requirements.

In addition to the user inputting business requirements on the configuration interface, the method provided by the embodiment of the present application also supports displaying optional business requirements through the configuration interface, the user can make selections, and the controller takes the content selected by the user as the acquired business requirements . For example, as shown in Figure 5, options for setting route calculation intentions and constraints are displayed on the configuration interface, such as bandwidth=300Mbps, cost=minimum, and latency, etc. The server uses the selected bandwidth and cost as business requirements.

Step 403, the controller obtains the corresponding relationship according to the service requirements and the network topology, and sends the corresponding relationship to the BFIR.

After the controller obtains the service requirements and the network topology, it determines the path that meets the service requirements in the network topology, obtains the corresponding relationship based on the determined path, and then sends the corresponding relationship to the BFIR to implement the static configuration of the corresponding relationship. Illustratively, the correspondence may form a forwarding table.

For example, referring to Figure 3 or Figure 5, for a multicast packet sent by the source device, the controller determines that the transmission paths of the multicast packet are PE1->P1->P2->PE2 and PE1->P1->P2- >PE3. Afterwards, the controller sends the corresponding relationship to PE1, where the corresponding relationship includes the BFR-IDs of PE2 and PE3 and the information of the next hop of PE1. The information of the next hop of PE1 includes P1, such as the BIFT-ID or end.BIER address of the P1. In addition, the corresponding relationship can be configured as a static route and delivered to PE1 through NETCONF.

Optionally, in addition to sending the corresponding relationship to the BFIR, the controller may also send the corresponding corresponding relationship to other devices in the path. As shown in FIG. 6 , the method for obtaining a path provided by this embodiment of the present application includes the following processes.

Step 601, the controller receives the topology information set and the BIER attribute set sent by the RR, and obtains the BIER network topology based on the topology information set and the BIER attribute set.

For this step 601, reference may be made to

steps

401 and 402 in the method shown in FIG. 4 above, which will not be repeated here.

Step 602, the controller determines the path based on the service requirements and the BIER network topology, and obtains the corresponding relationship based on the path.

For the step 601, reference may be made to the step 403 in the method shown in FIG. 4, which will not be repeated here.

The controller automatically delivers static routing configuration to each node on the path according to the calculated path, and specifies the forwarding path of a node in a certain BFR-ID range on the delivery node (NHP is the next hop node, and the outbound interface is the same as the next hop node. directly connected interfaces), which is the same as the preceding statically planned path.

Step 603, the controller sends the corresponding relationship to each device on the path.

In the method provided by the embodiment of the present application, the controller sends the corresponding relationship to each device on the path, and each device does not need to obtain the corresponding relationship through learning, which further improves the efficiency of multicast deployment.

It should be noted that the devices on the two paths in FIG. 3 and FIG. 5 overlap, and the method provided in this embodiment of the present application also supports the calculation of two paths, the primary path and the backup path, and the devices are different. For example, with the multicast forwarding path shown in Figure 7, the controller calculates the path from the root node of the primary path to the sink node P3 of subnet 1, from the root node of the backup path to the sink node P4 of subnet 1, and the destination node The corresponding relationship is taken as an example of delivering a BIER or BIERv6 packet forwarding table to nodes P3 and P4 of subnet 1. In FIG. 7, the root nodes (ie, BFIRs) of the primary and backup paths are PE1 and PE2, respectively.

(1) The corresponding relationship (forwarding table) issued by the forwarding path of the root node PE1 to P3 based on the main path includes but is not limited to the following contents.

1. The content of the corresponding relationship (forwarding table) sent by the controller to the root node PE1 includes:

(1) Sub-domain ID, BSL, SI, etc.;

(2) FBM: Bitstring composed of BFR-IDs of all online leaf nodes BFER in subnet 1. For example, in Figure 7, PE3 and PE4 are online. Taking BSL as 128 as an example, the delivered bitstring is: 00... 000110 (128 bits in total).

(3) The next hop node of PE1 is P1. In the BIER MPLS scenario, the controller sends the BIFT-ID assigned by P1 to PE1 to PE1; in the BIERv6 scenario, the controller sends the end.BIER address of P1 to PE1 ;

(4) Forwarding outbound interface: the outbound interface Intf1 of PE1.

2. The content of the corresponding relationship (forwarding table) issued by the controller to P1 includes:

(1) sub-domain ID, BSL, SI, etc.;

(2) FBM: a bitstring composed of the BFR-IDs of all online leaf nodes BFER in subnet 1. For example, PE3 and PE4 are online in Figure 7, and the BSL is 128, then the delivered bitstring is: 00...000110 (128 bits in total).

(3) The next hop of P1 is P3. In the BIER MPLS scenario, the controller sends P1 the BIFT-ID assigned by P3 to P1; in the BIERv6 scenario, the controller sends the end.BIER address of P3 to P1;

(4) Forwarding outgoing interface: the outgoing interface Intf2 of P1.

It should be noted that, if you want to continue to deliver the static path configuration in subnet 1, you need to deliver the corresponding relationship of forwarding paths to a certain BFER group or a single BFER within the subnet according to the learned topology. Therefore, it is necessary to obtain the connection relationship between nodes in the subnet and the assigned BFIT-ID (BIER MPLS scenario) and end.BIER address (BIERv6 address). The node identified by the bit in the delivered bitstring must be consistent with the BFR-ID of the destination BFER to be forwarded.

(2) The correspondence (forwarding table) issued by the forwarding path from the root node PE2 to P4 based on the backup path includes but is not limited to the following contents.

1. The content of the corresponding relationship (forwarding table) sent by the controller to the root node PE2 includes:

(1) sub-domain ID, BSL, SI, etc.;

(3) The next hop of PE2 is P2. In the BIER MPLS scenario, the controller sends the BIFT-ID of P2 to PE2 to PE2; in the BIERv6 scenario, the controller sends the end.BIER address of P2 to PE2;

(4) Forwarding outbound interface: Intf2 of the outbound interface of PE2.

2. The content of the corresponding relationship (forwarding table) issued by the controller to P2 includes:

(1) sub-domain ID, BSL, SI, etc.;

(3) The next hop of P2 is P4. In the BIER MPLS scenario, the controller sends P2 the BIFT-ID assigned by P4 to P2; in the BIERv6 scenario, the controller sends the end.BIER address of P4 to P2;

(4) Forwarding outgoing interface: the outgoing interface Intf1 of P2.

It should be noted that the path delivery in subnet 1 is the same as the static configuration of the root node multicast traffic of the main path. When each device in the BIER network transmits packets based on the corresponding relationship, the packets are forwarded according to the BIER static forwarding table issued, and the bitstring copy is still performed by hop-by-hop query BIFT entry. The method provided by the embodiment of the present application generates a corresponding relationship, that is, a BIFT entry forwarding a message according to a static configuration, and finally achieves the purpose of path planning.

The root node traffic tunnel of the primary path is PE1-P1-P3, which is replicated and forwarded by P3 using the dynamically learned BIER forwarding table; the root node traffic tunnel of the backup path is PE2-P2-P4, which is forwarded by P4 using the dynamically learned BIER forwarding table. Publish copy and forward. The two tunnel paths form active and standby reliability protection. Since the two statically configured paths of the root node traffic of the primary path and the root node traffic of the backup path form reliability protection, under the condition that paths are separated in the network topology, statically specifying paths can ensure that the primary and backup paths received by each node can be guaranteed. The paths traversed by the root multicast flow are completely separated, realizing full backup of the double traffic of the root node of the primary and backup paths. When the primary root or primary root traffic path fails, the leaf nodes switch to receive the backup root traffic sent through the backup path. ;If both the statically specified primary root traffic path and backup root traffic path fail, the dynamic forwarding table learned through the routing protocol can continue to forward multicast traffic. Optionally, if both the statically specified primary root traffic path and the backup root traffic path are faulty, the tunnel fault information can also be reported to the controller. Deliver the static forwarding entry configuration to the device on the new path, that is, deliver a new correspondence.

It should be noted that if the destination BFER group that needs to calculate the route is smaller than the range of subnet 1, the destination node needs to be specified as the upstream node closer to the BFER group in the small range; if the route needs to be calculated to a specific BFER node, Then the destination node of the route calculation needs to be specified as the BFER node. For example, taking the schematic diagram of the designated multicast forwarding path shown in FIG. 8 as an example, the multicast forwarding path is designated to the BFER leaf node of city 1: the root node of the main path is the provincial edge router (ER) 1, The root traffic path of the main path is: provincial aggregation ER1 - metro ER1 - aggregation ER1, as shown by the solid line in Figure 8. The root node of the backup path is the provincial aggregation ER2, and the root traffic path of the backup path is: provincial aggregation ER2 - metro ER2 - aggregation ER2, as shown by the dotted line in Figure 8. If the destination BFER for route calculation needs to be further reduced, the destination BFER can be further specified in the provincial capital city, for example, the PE with id=5 or the PE with id=7. It should be noted that FIG. 8 only takes the route from the provincial capital city to the prefecture city 1 as an example for description. In an exemplary embodiment, the route from the provincial capital city to the prefecture city 2 can also be obtained. For example, the traffic path is: provincial aggregation ER1-metro core (MC)1-aggregation node (AGG)1.

The method for obtaining a path provided by the embodiment of the present application has been described above. Corresponding to the above method, the embodiment of the present application further provides an apparatus for obtaining a path. 9 is a schematic structural diagram of an apparatus for obtaining a path provided by an embodiment of the present application. The apparatus is applied in a BIER network. For example, the apparatus is applied to a control device in the BIER network, and the control device is the above-mentioned FIG. 2 , Fig. 4 and Fig. 6 the control device shown in any of the accompanying drawings. Based on the following multiple modules shown in FIG. 9 , the apparatus for obtaining a path shown in FIG. 9 can perform all or part of the operations performed by the control device. It should be understood that the apparatus may include more additional modules than the shown modules or omit a part of the modules shown therein, which is not limited in this embodiment of the present application. As shown in Figure 9, the device includes:

The first obtaining module 901 is used to obtain the BIER network topology, and the BIER network topology includes BFIR and at least one BFER;

The second obtaining module 902 is used to obtain a corresponding relationship based on business requirements and BIER network topology, and the corresponding relationship includes at least one BFER bit forwarding router identifier BFR-ID and the information of the next hop;

The sending module 903 is configured to send the corresponding relationship to the BFIR.

In a possible implementation manner, at least one BFER includes a first BFER, and the first acquisition module 901 is configured to receive first information from the BFIR, where the first information includes the BFR-ID of the BFIR and the end.BIER address of the BFIR, Node attributes of BFIR, neighbor information of BFIR, and link information of BFIR; receiving second information from the first BFER, the second information includes the BFR-ID of the first BFER, the end.BIER address of the first BFER, the first BFER The node attribute of the first BFER, the neighbor information of the first BFER and the link information of the first BFER; based on the first information and the second information, the BIER network topology is obtained, and the BIER network topology includes the information of the BFIR and the information of the first BFER as the BFIR neighbor. and link SLA information between BFIR and first BFER.

In a possible implementation manner, at least one BFER includes a first BFER, and the first obtaining module 901 is configured to receive first information from the BFIR, where the first information includes the BFR-ID of the BFIR and the multi-protocol label switching MPLS of the BFIR Label, node attribute of BFIR, neighbor information of BFIR, and link information of BFIR; receive second information from the first BFER, the second information includes the BFR-ID of the first BFER, the MPLS label of the first BFER, the first BFER The node attribute of the first BFER, the neighbor information of the first BFER and the link information of the first BFER; based on the first information and the second information, the BIER network topology is obtained, and the BIER network topology includes the information of the BFIR and the information of the first BFER as the BFIR neighbor. and link SLA information between BFIR and first BFER.

In a possible implementation manner, at least one BFER includes a first BFER, and the first acquisition module 901 is configured to receive first information from the BFIR, where the first information includes the BFR-ID of the BFIR and the bit index forwarding table BIFT of the BFIR Identity, node attribute of BFIR, neighbor information of BFIR, and link information of BFIR; receive second information from the first BFER, the second information includes the BFR-ID of the first BFER, the BIFT identifier of the first BFER, the first BFER The node attribute of the first BFER, the neighbor information of the first BFER and the link information of the first BFER; based on the first information and the second information, the BIER network topology is obtained, and the BIER network topology includes the information of the BFIR and the information of the first BFER as the BFIR neighbor. and link SLA information between BFIR and first BFER.

In a possible implementation manner, at least one BFER includes a first BFER, and the first acquisition module 901 is configured to receive first information from the BFIR, where the first information includes the BFR-ID of the BFIR and the end.BIER address of the BFIR, Node attributes of BFIR, neighbor information of BFIR, and link information of BFIR; receiving second information from the first BFER, the second information includes the BFR-ID of the first BFER, the end.BIER address of the first BFER, the first BFER Receive the third information from the intermediate BFR, the third information includes the end.BIER address of the intermediate BFR, the node attribute of the intermediate BFR, and the neighbors of the intermediate BFR. information and link information of the intermediate BFR; based on the first information, the second information and the third information, the BIER network topology is obtained, and the BIER network topology includes the information of the BFIR, the information of the intermediate BFR as a neighbor of the BFIR, the information of the first BFER, The link SLA information between the BFIR and the intermediate BFR and the link SLA information between the intermediate BFR and the first BFER.

In a possible implementation manner, at least one BFER includes a first BFER, and the first acquisition module 901 is configured to receive first information from the BFIR, where the first information includes the BFR-ID of the BFIR, the MPLS label of the BFIR, the BFIR's Node attribute, neighbor information of BFIR, and link information of BFIR; receive second information from the first BFER, the second information includes the BFR-ID of the first BFER, the MPLS label of the first BFER, the node attribute of the first BFER, Neighbor information of the first BFER and link information of the first BFER; receive third information from the intermediate BFR, the third information includes the MPLS label of the intermediate BFR, the node attribute of the intermediate BFR, the neighbor information of the intermediate BFR, and the chain of the intermediate BFR road information; based on the first information, the second information and the third information, the BIER network topology is obtained. The BIER network topology includes the information of the BFIR, the information of the intermediate BFR that is the neighbor of the BFIR, the information of the first BFER, and the information between the BFIR and the intermediate BFR. Link SLA information and link SLA information between the intermediate BFR and the first BFER.

In a possible implementation manner, the at least one BFER includes a first BFER, and the first acquisition module 901 is configured to receive first information from the BFIR, where the first information includes the BFR-ID of the BFIR, the BIFT identifier of the BFIR, the BFIR's Node attribute, neighbor information of BFIR and link information of BFIR; receive second information from the first BFER, the second information includes the BFR-ID of the first BFER, the BIFT identification of the first BFER, the node attribute of the first BFER, Neighbor information of the first BFER and link information of the first BFER; receive third information from the intermediate BFR, where the third information includes the BIFT identifier of the intermediate BFR, the node attribute of the intermediate BFR, the neighbor information of the intermediate BFR, and the chain of the intermediate BFR road information; based on the first information, the second information and the third information, the BIER network topology is obtained. The BIER network topology includes the information of the BFIR, the information of the intermediate BFR that is the neighbor of the BFIR, the information of the first BFER, and the information between the BFIR and the intermediate BFR. Link SLA information and link SLA information between the intermediate BFR and the first BFER.

In a possible implementation manner, the first obtaining module 901 is configured to receive the first information sent by the route reflector RR that communicates with the BFIR; or receive the first information sent by the BFIR.

In a possible implementation manner, the first obtaining module 901 is configured to receive the second information sent by the RR in communication with the first BFER; or receive the second information sent by the intermediate BFR in communication with the first BFER; or receive the second information sent by the RR in communication with the first BFER; A second message sent by the BFER.

In a possible implementation manner, the second obtaining module 902 is configured to obtain the information of the target BFR based on business requirements; obtain the corresponding relationship based on the information of the target BFR and the BIER network topology, and the information of the next hop in the corresponding relationship is: Information on the target BFR.

In a possible implementation manner, the information of the next hop includes the end.BIER address of the node serving as the BFIR neighbor and the information of the outgoing interface communicating with the node serving as the BFIR neighbor.

In a possible implementation manner, the second information further includes one or more of the subdomain identifier SD, BSL and set identifier SI.

An embodiment of the present application also provides another apparatus for obtaining a path. FIG. 10 is a schematic structural diagram of an apparatus for obtaining a path provided by an embodiment of the present application. The apparatus is applied to a BIER network. For example, this The apparatus is applied to a BFIR device in a BIER network, and the BFIR device is the BFIR device shown in any of the above-mentioned Figures 2 , 4 and 6 . Based on the following multiple modules shown in FIG. 10 , the apparatus for obtaining a path shown in FIG. 10 can perform all or part of the operations performed by the BFIR device. It should be understood that the apparatus may include more additional modules than the shown modules or omit a part of the modules shown therein, which is not limited in this embodiment of the present application. As shown in Figure 10, the device includes:

The receiving module 1001 is configured to receive the corresponding relationship sent by the control device, where the corresponding relationship includes at least one BFER bit forwarding router identifier BFR-ID and the information of the next hop.

In a possible implementation, referring to FIG. 11 , the apparatus further includes:

The sending module 1102 is configured to send first information to the control device, where the first information includes the BFR-ID of the BFIR and the end.BIER address of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and the link information of the BFIR.

The sending module 1102 is configured to send first information to the control device, where the first information includes BFIR BFR-ID and BFIR MPLS label, BFIR node attribute, BFIR neighbor information and BFIR link information.

The sending module 1102 is configured to send first information to the control device, where the first information includes BFIR BFR-ID and BFIR bit index forwarding table BIFT identifier, BFIR node attribute, BFIR neighbor information and BFIR link information.

In a possible implementation manner, the sending module 1102 is configured to send the first information to the route reflector RR; or directly send the first information to the control device.

It should be understood that when the devices provided in the above-mentioned Figures 9 to 11 realize their functions, they are only illustrated by the division of the above-mentioned functional modules. In practical applications, the above-mentioned functions can be allocated according to different functional modules. , that is, dividing the internal structure of the device into different functional modules to complete all or part of the functions described above. In addition, the apparatus and method embodiments provided in the above embodiments belong to the same concept, and the specific implementation process thereof is detailed in the method embodiments, which will not be repeated here.

The specific hardware structure of the control device or the BFIR device in the above-mentioned embodiment is the network device 1500 shown in FIG. 12 , including a transceiver 1501 , a processor 1502 and a memory 1503 . The transceiver 1501 , the processor 1502 and the memory 1503 are connected through a bus 1504 . The transceiver 1501 is used to receive and send messages, the memory 1503 is used to store instructions or program codes, and the processor 1502 is used to call the instructions or program codes in the memory 1503 to make the control device or the BFIR device execute the above method embodiments related processing steps. In a specific embodiment, the network device 1500 in this embodiment of the present application may correspond to the control device in each of the above method embodiments. The illustrated network device 1500 is capable of performing all or part of the operations performed by the control device.

In a specific embodiment, the network device 1500 in this embodiment of the present application may correspond to the BFIR device in each of the above method embodiments. The illustrated network device 1500 is capable of performing all or part of the operations performed by a BFIR device.

The network device 1500 may also correspond to the apparatus shown in FIG. 9 . For example, the sending module 903 involved in FIG. 9 is equivalent to the transceiver 1501 , and the first acquiring module 901 and the second acquiring module 902 are equivalent to the processor 1502 . For another example, the receiving module 1001 and the transmitting module 1002 involved in FIG. 10 to FIG. 11 are equivalent to the transceiver 1501 .

Referring to FIG. 13, FIG. 13 shows a schematic structural diagram of a network device 2000 provided by an exemplary embodiment of the present application. The network device 2000 shown in FIG. 13 is configured to perform the operations involved in the methods for obtaining a path shown in the above-mentioned FIGS. 2 , 4 and 6 . The network device 2000 is, for example, a switch, a router, and the like.

As shown in FIG. 13 , the network device 2000 includes at least one processor 2001 , memory 2003 and at least one communication interface 2004 .

The processor 2001 is, for example, a general-purpose central processing unit (central processing unit, CPU), a digital signal processor (digital signal processor, DSP), a network processor (network processor, NP), a graphics processor (Graphics Processing Unit, GPU), A neural-network processing unit (NPU), a data processing unit (DPU), a microprocessor or one or more integrated circuits for implementing the solution of the present application. For example, the processor 2001 includes an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The PLD is, for example, a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL), or any combination thereof. It may implement or execute the various logical blocks, modules and circuits described in connection with the disclosure of the embodiments of the present invention. A processor may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

Optionally, the network device 2000 further includes a bus. The bus is used to transfer information between the components of the network device 2000 . The bus may be a peripheral component interconnect (PCI for short) bus or an extended industry standard architecture (EISA for short) bus or the like. The bus can be divided into address bus, data bus, control bus and so on. For ease of presentation, only one thick line is used in FIG. 13, but it does not mean that there is only one bus or one type of bus. In addition to the bus connection, the components of the network device 2000 in FIG. 13 may be connected in other manners, and the embodiment of the present invention does not limit the connection manner of the components.

The memory 2003 is, for example, a read-only memory (read-only memory, ROM) or other types of static storage devices that can store static information and instructions, or a random access memory (random access memory, RAM) or a memory device that can store information and instructions. Other types of dynamic storage devices, such as electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disk storage, optical disks storage (including compact discs, laser discs, compact discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media, or other magnetic storage devices, or capable of carrying or storing desired program code in the form of instructions or data structures and capable of Any other medium accessed by a computer without limitation. The memory 2003 exists independently, for example, and is connected to the processor 2001 through a bus. The memory 2003 may also be integrated with the processor 2001 .

The communication interface 2004 uses any device such as a transceiver for communicating with other devices or a communication network, which may be Ethernet, a radio access network (RAN), or wireless local area networks (WLAN), or the like. Communication interface 2004 may include a wired communication interface and may also include a wireless communication interface. Specifically, the communication interface 2004 may be an Ethernet (Ethernet) interface, a Fast Ethernet (FE) interface, a Gigabit Ethernet (GE) interface, an Asynchronous Transfer Mode (ATM) interface, a wireless local area network ( wireless local area networks, WLAN) interfaces, cellular network communication interfaces, or a combination thereof. The Ethernet interface can be an optical interface, an electrical interface or a combination thereof. In this embodiment of the present application, the communication interface 2004 may be used for the network device 2000 to communicate with other devices.

In a specific implementation, as an embodiment, the processor 2001 may include one or more CPUs, such as CPU0 and CPU1 as shown in FIG. 13 . Each of these processors can be a single-core (single-CPU) processor or a multi-core (multi-CPU) processor. A processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (eg, computer program instructions).

In a specific implementation, as an embodiment, the network device 2000 may include multiple processors, such as the processor 2001 and the processor 2005 shown in FIG. 13 . Each of these processors can be a single-core processor (single-CPU) or a multi-core processor (multi-CPU). A processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (eg, computer program instructions).

In a specific implementation, as an embodiment, the network device 2000 may further include an output device and an input device. The output device communicates with the processor 2001 and can display information in a variety of ways. For example, the output device may be a liquid crystal display (LCD), a light emitting diode (LED) display device, a cathode ray tube (CRT) display device, a projector, or the like. The input device communicates with the processor 2001 and can receive user input in various ways. For example, the input device may be a mouse, a keyboard, a touch screen device, or a sensor device, or the like.

In some embodiments, the memory 2003 is used to store the program code 2010 for executing the solutions of the present application, and the processor 2001 can execute the program code 2010 stored in the memory 2003 . That is, the network device 2000 can implement the method for obtaining a path provided by the method embodiment through the processor 2001 and the program code 2010 in the memory 2003 . One or more software modules may be included in the program code 2010 . Optionally, the processor 2001 itself may also store program codes or instructions for executing the solutions of the present application.

In a specific embodiment, the network device 2000 in this embodiment of the present application may correspond to the control device in each of the above method embodiments, and the processor 2001 in the network device 2000 reads the program code 2010 in the memory 2003 or stores the program code 2001 itself The program codes or instructions that enable the network device 2000 shown in FIG. 13 to perform all or part of the operations performed by the control device.

In a specific embodiment, the network device 2000 in this embodiment of the present application may correspond to the BFIR device in the above method embodiments, and the processor 2001 in the network device 2000 reads the program code 2010 in the memory 2003 or stores the program code 2001 itself. The program code or instructions that enable the network device 2000 shown in FIG. 13 to perform all or part of the operations performed by the BFIR device.

The network device 2000 may also correspond to the apparatus shown in FIG. 9 above, and each functional module in the apparatus shown in FIG. 9 is implemented by software of the network device 2000 . In other words, the functional modules included in the apparatus shown in FIG. 9 are generated after the processor 2001 of the network device 2000 reads the program code 2010 stored in the memory 2003 . For example, the sending module 903 involved in FIG. 9 is equivalent to the communication interface 2004 , and the first acquiring module 901 and the second acquiring module 902 are equivalent to the processor 2001 and/or the processor 2005 . For another example, the receiving module 1001 and the sending module 1002 involved in FIG. 10 to FIG. 11 are equivalent to the communication interface 2004 .

Wherein, each step of the method for obtaining a path shown in FIG. 2 , FIG. 4 , and FIG. 6 is completed by an integrated logic circuit of hardware or instructions in the form of software in the processor of the network device 2000 . The steps of the methods disclosed in conjunction with the embodiments of the present application may be directly embodied as executed by a hardware processor, or executed by a combination of hardware and software modules in the processor. The software modules may be located in random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, registers and other storage media mature in the art. 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, which will not be described in detail here to avoid repetition.

Referring to FIG. 14, FIG. 14 shows a schematic structural diagram of a network device 2100 provided by another exemplary embodiment of the present application. The network device 2100 shown in FIG. 14 is used to perform the functions shown in the above-mentioned FIGS. 2, 4 and 6. All or part of the operations involved in the method of obtaining the path. The network device 2100 is, for example, a controller, a switch, a router, etc., and the network device 2100 can be implemented by a general bus architecture.

As shown in FIG. 14 , the network device 2100 includes: a main control board 2110 and an interface board 2130 .

The main control board is also called the main processing unit (MPU) or the route processor card (route processor card). The main control board 2110 is used to control and manage various components in the network device 2100, including route calculation, device management , Equipment maintenance, protocol processing functions. The main control board 2110 includes: a central processing unit 2111 and a memory 2112 .

The interface board 2130 is also referred to as a line processing unit (LPU), a line card (line card) or a service board. The interface board 2130 is used to provide various service interfaces and realize data packet forwarding. The service interface includes, but is not limited to, an Ethernet interface, a POS (Packet over SONET/SDH) interface, etc. The Ethernet interface is, for example, a flexible Ethernet service interface (Flexible Ethernet Clients, FlexE Clients). The interface board 2130 includes: a central processing unit 2131, a network processor 2132, a forwarding table entry memory 2134, and a physical interface card (ph10sical interface card, PIC) 2133.

The central processing unit 2131 on the interface board 2130 is used to control and manage the interface board 2130 and communicate with the central processing unit 2111 on the main control board 2110 .

The network processor 2132 is used to realize the processing of the message. The form of the network processor 2132 may be a forwarding chip. The forwarding chip may be a network processor (NP). In some embodiments, the forwarding chip may be implemented by an application-specific integrated circuit (ASIC) or a field programmable gate array (FPGA). Specifically, the network processor 2132 is configured to forward the received message based on the forwarding table stored in the forwarding table entry memory 2134. If the destination address of the message is the address of the network device 2100, the message is sent to the CPU ( Such as processing by the central processing unit 2131); if the destination address of the message is not the address of the network device 2100, the next hop and outbound interface corresponding to the destination address are found from the forwarding table according to the destination address, and the message is forwarded to The outbound interface corresponding to the destination address. Wherein, the processing of the uplink message may include: processing of the incoming interface of the message, and forwarding table lookup; the processing of the downlink message may include: forwarding table lookup, and so on. In some embodiments, the central processing unit can also perform the function of a forwarding chip, for example, software forwarding is implemented based on a general-purpose CPU, so that a forwarding chip is not required in the interface board.

The physical interface card 2133 is used to realize the interconnection function of the physical layer, the original traffic enters the interface board 2130 through this, and the processed packets are sent from the physical interface card 2133 . The physical interface card 2133 is also called a daughter card, which can be installed on the interface board 2130, and is responsible for converting the photoelectric signal into a message, and after checking the validity of the message, it is forwarded to the network processor 2132 for processing. In some embodiments, the central processing unit 2131 can also perform the functions of the network processor 2132 , such as implementing software forwarding based on a general-purpose CPU, so that the network processor 2132 is not required in the physical interface card 2133 .

Optionally, the network device 2100 includes multiple interface boards. For example, the network device 2100 further includes an interface board 2140 . The interface board 2140 includes a central processing unit 2141 , a network processor 2142 , a forwarding table entry storage 2144 and a physical interface card 2143 . The functions and implementation manners of the components in the interface board 2140 are the same as or similar to those of the interface board 2130, and will not be repeated here.

Optionally, the network device 2100 further includes a switch fabric board 2120 . The switch fabric unit 2120 may also be referred to as a switch fabric unit (switch fabric unit, SFU). When the network device has multiple interface boards, the switching network board 2120 is used to complete data exchange between the interface boards. For example, the interface board 2130 and the interface board 2140 can communicate through the switch fabric board 2120 .

The main control board 2110 is coupled with the interface board. E.g. The main control board 2110, the interface board 2130, the interface board 2140, and the switching network board 2120 are connected to the system backplane through a system bus to achieve intercommunication. In a possible implementation manner, an inter-process communication (IPC) channel is established between the main control board 2110 and the interface board 2130 and the interface board 2140, and the main control board 2110 and the interface board 2130 and the interface board 2140 The communication is carried out through the IPC channel.

Logically, the network device 2100 includes a control plane and a forwarding plane, the control plane includes a main control board 2110 and a central processing unit 2111, and the forwarding plane includes various components that perform forwarding, such as forwarding entry storage 2134, physical interface card 2133, and network processing device 2132. The control plane performs functions such as routers, generating forwarding tables, processing signaling and protocol packets, and configuring and maintaining the status of network devices. The control plane issues the generated forwarding tables to the forwarding plane. On the forwarding plane, the network processor 2132 controls the The following forwarding table forwards the packets received by the physical interface card 2133 by looking up the table. The forwarding table issued by the control plane may be stored in the forwarding table entry storage 2134 . In some embodiments, the control plane and forwarding plane may be completely separated and not on the same network device.

It is worth noting that there may be one or more main control boards, and when there are multiple main control boards, they may include the main main control board and the backup main control board. There may be one or more interface boards. The stronger the data processing capability of the network device, the more interface boards are provided. There can also be one or more physical interface cards on the interface board. There may be no switch fabric boards, or there may be one or more boards. When there are multiple boards, load sharing and redundancy backup can be implemented together. Under the centralized forwarding architecture, the network device does not need to switch the network board, and the interface board is responsible for the processing function of the service data of the entire system. Under the distributed forwarding architecture, a network device may have at least one switching network board, and the switching network board realizes data exchange between multiple interface boards, providing large-capacity data exchange and processing capabilities. Therefore, the data access and processing capabilities of network devices in a distributed architecture are greater than those in a centralized architecture. Optionally, the form of the network device can also be that there is only one board, that is, there is no switching network board, and the functions of the interface board and the main control board are integrated on this board. The central processing unit on the board can be combined into a central processing unit on this board to perform the functions of the two superimposed, the data exchange and processing capacity of this form of network equipment is low (for example, low-end switches or routers, etc. Network equipment). The specific architecture used depends on the specific networking deployment scenario, and there is no restriction here.

In a specific embodiment, the network device 2100 corresponds to any of the apparatuses for obtaining a path, which are applied to a control device, as shown in any of the above-mentioned FIG. 9 . In some embodiments, the sending module 903 in the apparatus for obtaining a path shown in FIG. 9 is equivalent to the physical interface card 2133 or the physical interface card 2143 in the network device 2100 . The first obtaining module 901 and the second obtaining module 902 in the apparatus for obtaining a path shown in FIG. 9 are equivalent to at least one of the central processor 2111 , the network processor 2132 and the network processor 2142 in the network device 2100 .

In some embodiments, the network device 2100 also corresponds to the apparatus for obtaining a path, which is applied to BFIR and shown in any of the above-mentioned FIG. 10 to FIG. 11 . In some embodiments, the receiving module 1001 and the sending module 1002 in the apparatus for obtaining a path shown in FIGS. 10-11 are equivalent to the physical interface card 2133 or the physical interface card 2143 in the network device 2100 .

Based on the network devices shown in FIG. 12 , FIG. 13 , and FIG. 14 , an embodiment of the present application further provides a communication system, where the communication system includes: a control device and a BFIR device. Optionally, the control device is the network device 1500 shown in FIG. 12 or the network device 2000 shown in FIG. 13 or the network device 2100 shown in FIG. 14 , and the BFIR device is the network device 1500 shown in FIG. 12 or the network device 1500 shown in FIG. 13 . The network device 2000 or the network device 2100 shown in FIG. 14 .

For the methods performed by the control device and the BFIR device, reference may be made to the relevant descriptions of the embodiments shown in FIG. 2 , FIG. 4 , and FIG. 6 , which will not be repeated here.

It should be understood that the above-mentioned processor may be a central processing unit (Central Processing Unit, CPU), or other general-purpose processors, digital signal processing (digital signal processing, DSP), application specific integrated circuit (application specific integrated circuit, ASIC), field-programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general purpose processor may be a microprocessor or any conventional processor or the like. It should be noted that the processor may be a processor supporting an advanced RISC machine (ARM) architecture.

Further, in an optional embodiment, the above-mentioned memory may include read-only memory and random access memory, and provide instructions and data to the processor. The memory may also include non-volatile random access memory. For example, the memory may also store device type information.

The memory may be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically programmable Erase programmable read-only memory (electrically EPROM, EEPROM) or flash memory. Volatile memory may be random access memory (RAM), which acts as an external cache. By way of example and not limitation, many forms of RAM are available. For example, static RAM (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access Memory (double data date SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous link dynamic random access memory (synchlink DRAM, SLDRAM) and direct memory bus random access memory (direct rambus RAM, DR RAM).

A computer-readable storage medium is also provided, and at least one program instruction or code is stored in the storage medium, and when the program instruction or code is loaded and executed by the processor, the computer realizes any one of the above Fig. 2, Fig. 4 and Fig. 6 The method used to get the path.

The present application provides a computer program. When the computer program is executed by a computer, the processor or the computer can execute the corresponding steps and/or processes in the foregoing method embodiments.

A chip is provided that includes a processor for invoking and executing instructions stored in the memory from a memory to cause a communication device on which the chip is mounted to perform the methods of the above aspects.

Another chip is provided, including: an input interface, an output interface, a processor and a memory, the input interface, the output interface, the processor and the memory are connected through an internal connection path, and the processor is used to execute the code in the memory, when the code is executed When the processor is configured to execute the methods in the above aspects.

In the above-mentioned embodiments, it may be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented in software, it can be implemented in whole or in part in the form of a computer program product. A computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions according to the present application result in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable device. Computer instructions may be stored on 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 site, computer, server, or data center over a wire (e.g. coaxial cable, optical fiber, digital subscriber line) or wireless (eg infrared, wireless, microwave, etc.) means to another website site, computer, server or data center. A computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, a data center, or the like that includes an integration of one or more available media. Useful media may be magnetic media (eg, floppy disks, hard disks, magnetic tapes), optical media (eg, DVD), or semiconductor media (eg, Solid State Disk), among others.

The above specific embodiments further describe the purpose, technical solutions and beneficial effects of the present application in detail. It should be understood that the above are only specific embodiments of the present application, and are not intended to limit the protection scope of the present application. Any modification, equivalent replacement, improvement, etc. made on the basis of the technical solution of the present application shall be included within the protection scope of the present application.

Those of ordinary skill in the art can realize that, in combination with the method steps and modules described in the embodiments disclosed herein, they can be implemented in software, hardware, firmware or any combination thereof, in order to clearly illustrate the interoperability of hardware and software Alternatively, the steps and components of each embodiment have been generally described in terms of their functions in the foregoing description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Persons of ordinary skill in the art may use different methods of implementing the described functionality for each particular application, but such implementations should not be considered beyond the scope of this application.

Those of ordinary skill in the art can understand that all or part of the steps of implementing the above embodiments can be completed by hardware, or can be completed by instructing relevant hardware through a program, and the program can be stored in a computer-readable storage medium. The storage medium can be read-only memory, magnetic disk or optical disk, etc.

When implemented in software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer program instructions. As an example, the methods of the embodiments of the present application may be described in the context of machine-executable instructions, such as included in program modules executed in a device on a target's real or virtual processor. Generally, program modules include routines, programs, libraries, objects, classes, components, data structures, etc. that perform particular tasks or implement particular abstract data structures. In various embodiments, the functionality of the program modules may be combined or divided among the described program modules. Machine-executable instructions for program modules may be executed within local or distributed devices. In a distributed facility, program modules may be located in both local and remote storage media.

Computer program code for implementing the methods of the embodiments of the present application may be written in one or more programming languages. Such computer program code may be provided to a processor of a general purpose computer, special purpose computer or other programmable data processing apparatus such that the program code, when executed by the computer or other programmable data processing apparatus, causes the flowchart and/or block diagrams The function or operation specified in is implemented. The program code may execute entirely on the computer, partly on the computer, as a stand-alone software package, partly on the computer and partly on a remote computer or entirely on the remote computer or server.

In the context of embodiments of the present application, computer program code or related data may be carried by any suitable carrier to enable a device, apparatus or processor to perform the various processes and operations described above. Examples of carriers include signals, computer-readable media, and the like.

Examples of signals may include electrical, optical, radio, acoustic, or other forms of propagated signals, such as carrier waves, infrared signals, and the like.

A machine-readable medium may be any tangible medium that contains or stores a program for or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. Machine-readable media may include, but are not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or devices, or any suitable combination thereof. More detailed examples of machine-readable storage media include electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable read only Memory (EPROM or flash memory), optical storage devices, magnetic storage devices, or any suitable combination thereof.

Those skilled in the art can clearly understand that, for the convenience and brevity of description, for the specific working process of the above-described systems, devices and modules, reference may be made to the corresponding processes in the foregoing method embodiments, which will not be repeated here.

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

The modules described as separate components may or may not be physically separated, and the components shown as modules may or may not be physical modules, that is, may be located in one place, or may be distributed to multiple network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solutions of the embodiments of the present application.

In addition, each functional module in each embodiment of the present application may be integrated into one processing module, or each module may exist physically alone, or two or more modules may be integrated into one module. The above-mentioned integrated modules can be implemented in the form of hardware, and can also be implemented in the form of software function modules.

If the integrated modules are implemented in the form of software functional modules and sold or used as independent products, they may be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the present application are essentially or part of contributions to the prior art, or all or part of the technical solutions can be embodied in the form of software products, and the computer software products are stored in a storage medium , including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods in the various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk and other media that can store program codes .

In this application, the terms "first", "second" and other words are used to distinguish the same or similar items with basically the same function and function, and it should be understood that between "first", "second" and "nth" There are no logical or timing dependencies, and no restrictions on the number and execution order. It will also be understood that, although the following description uses the terms first, second, etc. to describe various elements, these elements should not be limited by the terms. These terms are only used to distinguish one element from another. For example, a first edge network device may be referred to as a second edge network device, and similarly, a second edge network device may be referred to as a first edge network device, without departing from the scope of various described examples. Both the first edge network and device and the second edge network device may be edge network devices, and in some cases, may be separate and distinct edge network devices.

It should also be understood that, in each embodiment of the present application, the size of the sequence number of each process does not mean the sequence of execution, and the execution sequence of each process should be determined by its function and internal logic, and should not be used in the embodiment of the present application. Implementation constitutes any limitation.

In this application, the meaning of the term "at least one" refers to one or more, and the meaning of the term "plurality" in this application refers to two or more. For example, a plurality of second messages refers to two or more more than one second message. The terms "system" and "network" are often used interchangeably herein.

It is to be understood that the terminology used in describing the various described examples herein is for the purpose of describing particular examples and is not intended to be limiting. As used in the description of the various described examples and the appended claims, the singular forms "a", "an")" and "the" are intended to include the plural forms as well, unless the context dictates otherwise. clearly instructed.

It will also be understood that the term "includes" (also referred to as "includes", "including", "comprises" and/or "comprising") when used in this specification designates the presence of stated features, integers, steps, operations, elements , and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groupings thereof.

It should also be understood that the terms "if" and "if" may be interpreted to mean "when" or "upon" or "in response to determining" or "in response to detecting." Similarly, depending on the context, the phrases "if it is determined..." or "if the [stated condition or event] is detected" can be interpreted to mean "when determining..." or "in response to determining... ” or “on detection of [recited condition or event]” or “in response to detection of [recited condition or event]”.

It should be understood that determining B according to A does not mean that B is only determined according to A, and B may also be determined according to A and/or other information.

It should also be understood that references throughout the specification to "one embodiment," "an embodiment," and "one possible implementation" mean that a particular feature, structure, or characteristic associated with the embodiment or implementation is included herein. in at least one embodiment of the application. Thus, appearances of "in one embodiment" or "in an embodiment" or "one possible implementation" in various places throughout this specification are not necessarily necessarily referring to the same embodiment. Furthermore, the particular features, structures or characteristics may be combined in any suitable manner in one or more embodiments.

Claims

A method for obtaining a path, wherein the method is applied in a network that explicitly replicates BIER based on a bit index, comprising:

The control device acquires a BIER network topology, the BIER network topology includes a BIER forwarding ingress router BFIR and at least one BIER forwarding egress router BFER;

The control device obtains a corresponding relationship based on service requirements and the BIER network topology, and the corresponding relationship includes the bit forwarding router identifier BFR-ID of the at least one BFER and the information of the next hop;

The control device sends the correspondence to the BFIR.
The method according to claim 1, wherein the at least one BFER includes the first BFER, and the control device acquiring the BIER network topology includes:

The control device receives first information from the BFIR, where the first information includes the BFIR's BFR-ID and the BFIR's end.BIER address, the BFIR's node attributes, and the BFIR's neighbor information and the link information of the BFIR;

The control device receives second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the end.BIER address of the first BFER, and the node of the first BFER attribute, neighbor information of the first BFER and link information of the first BFER;

The control device obtains the BIER network topology based on the first information and the second information, and the BIER network topology includes the information of the BFIR, the information of the first BFER that is the neighbor of the BFIR, and Link SLA information between the BFIR and the first BFER.
The method according to claim 1, wherein the at least one BFER includes the first BFER, and the control device acquiring the BIER network topology includes:

The control device receives the first information from the BFIR, the first information includes the BFR-ID of the BFIR and the multi-protocol label switching MPLS label of the BFIR, the node attribute of the BFIR, the neighbor information and link information of the BFIR;

The control device receives second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the MPLS label of the first BFER, the node attribute of the first BFER, neighbor information of the first BFER and link information of the first BFER;

The control device obtains the BIER network topology based on the first information and the second information, and the BIER network topology includes the information of the BFIR, the information of the first BFER that is the neighbor of the BFIR, and Link SLA information between the BFIR and the first BFER.
The method according to claim 1, wherein the at least one BFER includes the first BFER, and the control device acquiring the BIER network topology includes:

The control device receives the first information from the BFIR, the first information includes the BFR-ID of the BFIR and the bit index forwarding table BIFT identifier of the BFIR, the node attribute of the BFIR, the neighbor information and link information of the BFIR;

The control device receives second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the BIFT identifier of the first BFER, the node attribute of the first BFER, neighbor information of the first BFER and link information of the first BFER;

The control device obtains the BIER network topology based on the first information and the second information, and the BIER network topology includes the information of the BFIR, the information of the first BFER that is the neighbor of the BFIR, and Link SLA information between the BFIR and the first BFER.
The method according to claim 1, wherein the at least one BFER includes the first BFER, and the control device acquiring the BIER network topology includes:

The control device receives first information from the BFIR, where the first information includes the BFIR's BFR-ID and the BFIR's end.BIER address, the BFIR's node attributes, and the BFIR's neighbor information and the link information of the BFIR;

The control device receives second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the end.BIER address of the first BFER, and the node of the first BFER attribute, neighbor information of the first BFER and link information of the first BFER;

The control device receives third information from the intermediate BFR, the third information includes the end.BIER address of the intermediate BFR, the node attribute of the intermediate BFR, the neighbor information of the intermediate BFR, and the information of the intermediate BFR. link information;

The control device obtains the BIER network topology based on the first information, the second information and the third information, where the BIER network topology includes the information of the BFIR, the Information of the intermediate BFR, information of the first BFER, link SLA information between the BFIR and the intermediate BFR, and link SLA information between the intermediate BFR and the first BFER.
The method according to claim 1, wherein the at least one BFER includes the first BFER, and the control device acquiring the BIER network topology includes:

The control device receives the first information from the BFIR, the first information includes the BFR-ID of the BFIR and the MPLS label of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and all link information of the BFIR;

The control device receives second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the MPLS label of the first BFER, the node attribute of the first BFER, neighbor information of the first BFER and link information of the first BFER;

The control device receives third information from the intermediate BFR, the third information includes the MPLS label of the intermediate BFR, the node attribute of the intermediate BFR, the neighbor information of the intermediate BFR, and the link of the intermediate BFR information;

The control device obtains the BIER network topology based on the first information, the second information and the third information, where the BIER network topology includes the information of the BFIR, the Information of the intermediate BFR, information of the first BFER, link SLA information between the BFIR and the intermediate BFR, and link SLA information between the intermediate BFR and the first BFER.
The method according to claim 1, wherein the at least one BFER includes the first BFER, and the control device acquiring the BIER network topology includes:

The control device receives the first information from the BFIR, the first information includes the BFR-ID of the BFIR and the BIFT identifier of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and all link information of the BFIR;

The control device receives second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the BIFT identifier of the first BFER, the node attribute of the first BFER, neighbor information of the first BFER and link information of the first BFER;

The control device receives third information from an intermediate BFR, the third information includes a BIFT identity of the intermediate BFR, node attributes of the intermediate BFR, neighbor information of the intermediate BFR, and links of the intermediate BFR information;

The control device obtains the BIER network topology based on the first information, the second information and the third information, where the BIER network topology includes the information of the BFIR, the Information of the intermediate BFR, information of the first BFER, link SLA information between the BFIR and the intermediate BFR, and link SLA information between the intermediate BFR and the first BFER.
The method according to any one of claims 2 to 7, wherein the receiving, by the control device, the first information from the BFIR comprises:

The control device receives the first information sent by the route reflector RR in communication with the BFIR; or

The control device receives the first information sent by the BFIR.
The method according to any one of claims 2 to 7, wherein the receiving, by the control device, the second information from the first BFER comprises:

The control device receives the second information sent by the RR in communication with the first BFER; or

The control device receives the second information sent by the intermediate BFR in communication with the first BFER; or

The control device receives the second information sent by the first BFER.
The method according to any one of claims 2 to 9, wherein the second information further includes multicast source group information corresponding to the first BFER.
The method according to any one of claims 1 to 10, wherein the control device, based on service requirements and the BIER network topology, obtains the corresponding relationship comprising:

The control device obtains the information of the target BFR based on business requirements;

The control device acquires the corresponding relationship based on the information of the target BFR and the BIER network topology, and the information of the next hop in the corresponding relationship is the information of the target BFR.
The method according to any one of claims 1 to 11, wherein the service requirements include one or more of bandwidth, delay, packet loss, and designated nodes.
The method according to claim 2 or 5, wherein the information of the next hop includes the end.BIER address of the node serving as the BFIR neighbor and outgoing interface information for communicating with the node serving as the BFIR neighbor.
The method according to any one of claims 2 to 9, wherein the second information further includes one or more of subdomain identifiers SD, BSL and set identifiers SI.
The method according to any one of claims 1 to 14, wherein the BFR-ID of the first BFER is an identifier dynamically acquired by the first BFER, and the dynamic acquisition is from a set of BFR-IDs Obtained unused id.
A method for obtaining a path, wherein the method is applied in a network that explicitly replicates BIER based on a bit index, comprising:

The BIER forwarding ingress router BFIR receives the correspondence sent by the control device, where the correspondence includes the bit forwarding router identifier BFR-ID of the at least one BFER and the information of the next hop.
The method according to claim 16, wherein before the BFIR receives the correspondence sent by the control device, the method further comprises:

The BFIR sends first information to the control device, and the first information includes the BFR-ID of the BFIR and the end.BIER address of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR, and Link information of the BFIR.
The method according to claim 16, wherein before the BFIR receives the correspondence sent by the control device, the method further comprises:

The BFIR sends first information to the control device, the first information includes the BFR-ID of the BFIR and the multi-protocol label switching MPLS label of the BFIR, the node attribute of the BFIR, the neighbors of the BFIR information and link information of the BFIR.
The method according to claim 16, wherein before the BFIR receives the correspondence sent by the control device, the method further comprises:

The BFIR sends first information to the control device, the first information includes the BFR-ID of the BFIR and the bit index forwarding table BIFT identifier of the BFIR, the node attribute of the BFIR, the neighbors of the BFIR information and link information of the BFIR.
The method according to any one of claims 17 to 19, wherein the sending, by the BFIR, the first information to the control device comprises:

The BFIR sends the first information to the route reflector RR; or

The BFIR directly sends the first information to the control device.
The method according to any one of claims 16 to 20, wherein the information of the next hop includes the end.BIER address of the node serving as the BFIR neighbor and the outgoing interface for communicating with the node serving as the BFIR neighbor information.
A device for obtaining a path, characterized in that the device is provided in a control device, comprising:

The first acquisition module is used to acquire an explicit replication BIER network topology based on a bit index, and the BIER network topology includes a BIER forwarding ingress router BFIR and at least one BIER forwarding egress router BFER;

The second acquisition module is used to acquire a corresponding relationship based on service requirements and the BIER network topology, and the corresponding relationship includes the bit forwarding router identifier BFR-ID of the at least one BFER and the information of the next hop;

A sending module, configured to send the corresponding relationship to the BFIR.
The apparatus according to claim 22, wherein the at least one BFER includes a first BFER, and the first obtaining module is configured to receive first information from the BFIR, the first information including the The BFR-ID of the BFIR and the end.BIER address of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and the link information of the BFIR;

Receive second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the end.BIER address of the first BFER, the node attribute of the first BFER, the neighbor information of the first BFER and link information of the first BFER;

Based on the first information and the second information, the BIER network topology is obtained, where the BIER network topology includes the information of the BFIR, the information of the first BFER that is the neighbor of the BFIR, and the BFIR and the Link SLA information between the first BFERs.
The apparatus according to claim 22, wherein the at least one BFER includes a first BFER, and the first obtaining module is configured to receive first information from the BFIR, the first information including the The BFR-ID of the BFIR and the multi-protocol label switching MPLS label of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR, and the link information of the BFIR;

Receive second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the MPLS label of the first BFER, the node attribute of the first BFER, the first BFER neighbor information of the BFER and link information of the first BFER;

Based on the first information and the second information, the BIER network topology is obtained, and the BIER network topology includes the information of the BFIR, the information of the first BFER that is the neighbor of the BFIR, and the BFIR and the Link SLA information between the first BFERs.
The apparatus according to claim 22, wherein the at least one BFER includes a first BFER, and the first obtaining module is configured to receive first information from the BFIR, the first information including the The BFR-ID of the BFIR and the bit index of the BFIR forwarding table BIFT identifier, the node attribute of the BFIR, the neighbor information of the BFIR, and the link information of the BFIR;

Receive second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the BIFT identifier of the first BFER, the node attribute of the first BFER, the first BFER neighbor information of the BFER and link information of the first BFER;

Based on the first information and the second information, the BIER network topology is obtained, and the BIER network topology includes the information of the BFIR, the information of the first BFER that is the neighbor of the BFIR, and the BFIR and the Link SLA information between the first BFERs.
The apparatus according to claim 22, wherein the at least one BFER includes a first BFER, and the first obtaining module is configured to receive first information from the BFIR, the first information including the The BFR-ID of the BFIR and the end.BIER address of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and the link information of the BFIR;

Receive second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the end.BIER address of the first BFER, the node attribute of the first BFER, the neighbor information of the first BFER and link information of the first BFER; receiving third information from the intermediate BFR, the third information including the end.BIER address of the intermediate BFR, the node attribute of the intermediate BFR, neighbor information of the intermediate BFR and link information of the intermediate BFR;

Based on the first information, the second information and the third information, the BIER network topology is obtained, where the BIER network topology includes the information of the BFIR and the information of the intermediate BFR that is the neighbor of the BFIR , the information of the first BFER, the link SLA information between the BFIR and the intermediate BFR, and the link SLA information between the intermediate BFR and the first BFER.
The apparatus according to claim 22, wherein the at least one BFER includes a first BFER, and the first obtaining module is configured to receive first information from the BFIR, the first information including the The BFR-ID of the BFIR and the MPLS label of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR and the link information of the BFIR;

Receive second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the MPLS label of the first BFER, the node attribute of the first BFER, the first BFER Neighbor information of the BFER and link information of the first BFER; receive third information from the intermediate BFR, where the third information includes the MPLS label of the intermediate BFR, the node attribute of the intermediate BFR, the intermediate BFR neighbor information and link information of the intermediate BFR;

Based on the first information, the second information and the third information, the BIER network topology is obtained, where the BIER network topology includes the information of the BFIR and the information of the intermediate BFR that is the neighbor of the BFIR , the information of the first BFER, the link SLA information between the BFIR and the intermediate BFR, and the link SLA information between the intermediate BFR and the first BFER.
The apparatus according to claim 22, wherein the at least one BFER includes a first BFER, and the first obtaining module is configured to receive first information from the BFIR, the first information including the The BFR-ID of the BFIR and the BIFT identifier of the BFIR, the node attribute of the BFIR, the neighbor information of the BFIR, and the link information of the BFIR;

Receive second information from the first BFER, where the second information includes the BFR-ID of the first BFER, the BIFT identifier of the first BFER, the node attribute of the first BFER, the first BFER neighbor information of the BFER and link information of the first BFER;

receiving third information from an intermediate BFR, where the third information includes a BIFT identity of the intermediate BFR, a node attribute of the intermediate BFR, neighbor information of the intermediate BFR, and link information of the intermediate BFR;

Based on the first information, the second information and the third information, the BIER network topology is obtained, where the BIER network topology includes the information of the BFIR and the information of the intermediate BFR that is the neighbor of the BFIR , the information of the first BFER, the link SLA information between the BFIR and the intermediate BFR, and the link SLA information between the intermediate BFR and the first BFER.
The apparatus according to any one of claims 23 to 28, wherein the first obtaining module is configured to receive the first information sent by a route reflector RR that communicates with the BFIR; or receive the BFIR the first information sent.
The apparatus according to any one of claims 23 to 29, wherein the first obtaining module is configured to receive the second information sent by the RR communicating with the first BFER; The second information sent by an intermediate BFR of a BFER communication; or the second information sent by the first BFER is received.
The apparatus according to any one of claims 23 to 30, wherein the second information further includes multicast source group information corresponding to the first BFER.
The apparatus according to any one of claims 22 to 31, wherein the second obtaining module is configured to obtain information of a target BFR based on business requirements; and obtain information based on the information of the target BFR and the BIER network topology In the corresponding relationship, the information of the next hop in the corresponding relationship is the information of the target BFR.
The apparatus according to any one of claims 22 to 32, wherein the service requirements include one or more of bandwidth, delay, packet loss, and designated nodes.
The apparatus according to claim 23 or 26, wherein the information of the next hop includes the end.BIER address of the node serving as the BFIR neighbor and outgoing interface information for communicating with the node serving as the BFIR neighbor.
The apparatus according to any one of claims 23 to 30, wherein the second information further includes one or more of subdomain identifiers SD, BSL and set identifiers SI.
The apparatus according to any one of claims 22 to 35, wherein the BFR-ID of the first BFER is an identifier dynamically acquired by the first BFER, and the dynamic acquisition is from a set of BFR-IDs Obtained unused id.
A device for obtaining a path, characterized in that the device is located in a BIER forwarding ingress router BFIR, comprising:

The receiving module is configured to receive the correspondence sent by the control device, where the correspondence includes the bit forwarding router identification BFR-ID of the at least one BFER and the information of the next hop.
The apparatus of claim 37, wherein the apparatus further comprises:

A sending module, configured to send first information to the control device, where the first information includes the BFR-ID of the BFIR and the end.BIER address of the BFIR, the node attribute of the BFIR, and the neighbors of the BFIR information and link information of the BFIR.
The apparatus of claim 37, wherein the apparatus further comprises:

A sending module, configured to send first information to the control device, the first information includes the BFR-ID of the BFIR and the multi-protocol label switching MPLS label of the BFIR, the node attribute of the BFIR, the BFIR neighbor information and link information of the BFIR.
The apparatus of claim 37, wherein the apparatus further comprises:

A sending module, configured to send first information to the control device, where the first information includes the BFR-ID of the BFIR and the bit index forwarding table BIFT identifier of the BFIR, the node attribute of the BFIR, the BFIR neighbor information and link information of the BFIR.
The apparatus according to any one of claims 38 to 40, wherein the sending module is configured to send the first information to a route reflector RR; or directly send the first information to the control device.
The apparatus according to any one of claims 37 to 41, wherein the information of the next hop includes the end.BIER address of the node serving as the BFIR neighbor and the outgoing interface for communicating with the node serving as the BFIR neighbor information.