Method for reporting forwarding table identifier, node, and storage medium

Abstract

This application discloses a method, a node, and a storage medium for reporting a forwarding table identifier, which includes determining a forwarding table identifier of a bit-index explicit replication BIER-TE based on a specified path of a current node based on first information including a subdomain SD and a bit string length BSL, and reporting the forwarding table identifier of the BIER-TE of the current node, encoded using a preset encoding scheme, to other nodes.

Description

[Technical Field]

[0001] The present application relates to the field of communications technology, and relates to, for example, a method, a node, and a storage medium for reporting a forwarding table identifier. [Background technology]

[0002] Bit Indexed Explicit Replication (BIER) is a type of multicast data forwarding technology that can forward multicast traffic along the shortest path to reach the destination node. Designated path-based Bit Indexed Explicit Replication-Traffic Engineering (BIER-TE) transmits multicast traffic along specified links until it reaches the destination node. Similar to BIER, BIER-TE uses an internal protocol to report link information and create a BIER-TE forwarding table to guide forwarding. Furthermore, when BIER-TE-packaged multicast traffic is received, traffic forwarding can be completed based on the BIER-TE forwarding table. However, the method of reporting link information and the number of messages reported vary depending on the number of interfaces in the node. When a network contains a large number of nodes or a large number of links between nodes, the size of the messages reported becomes large, significantly increasing the complexity of node processing and potentially exceeding the processing capabilities of some nodes. Summary of the Invention [Means for solving the problem]

[0003] The present embodiment is The method includes determining a forwarding table identifier of a bit-index explicit replication traffic engineering (BIER-TE) based on a specified path of the current node based on first information including a subdomain (SD) and a bit string length (BSL); and notifying other nodes of the forwarding table identifier of the BIER-TE of the current node, which is encoded in a predetermined encoding scheme. A method for reporting a forwarding table identifier is provided.

[0004] The present embodiment is A processor is provided for implementing the method for reporting a forwarding table identifier according to the above embodiment when the computer program is executed. Provides a node.

[0005] The present embodiment is A computer program is stored that, when executed by a processor, realizes the method for reporting a forwarding table identifier according to the above embodiment. A computer-readable storage medium is also provided. [Brief explanation of the drawings]

[0006] [Figure 1] FIG. 1 is a schematic diagram of a network according to an embodiment. [Figure 2] FIG. 2 is a schematic diagram of another network according to an embodiment. [Figure 3] 10 is a flowchart of a method for reporting a forwarding table identifier according to an embodiment. [Figure 4] 10 is a flowchart of another method for reporting a forwarding table identifier according to an embodiment; [Figure 5] FIG. 10 is a schematic diagram of encoding a forwarding table identifier in BIER-TE according to one embodiment. [Figure 6] FIG. 10 is a structural diagram of a forwarding table identifier of a BIER-TE according to one embodiment. [Figure 7] 1 is a diagram illustrating a forwarding table identifier reporting device according to an embodiment. [Figure 8] 10 is another forwarding table identifier reporting device according to an embodiment; [Figure 9] FIG. 2 is a structural schematic diagram of a base station according to an embodiment; DETAILED DESCRIPTION OF THE INVENTION

[0007] The specific embodiments described here are merely for the purpose of interpreting the present application. Hereinafter, the embodiments of the present application will be described with reference to the drawings.

[0008] Multicast technology plays an increasingly important role in Internet operations, and is applied to business-related applications such as network conferences, entertainment-related applications such as live broadcasts of sporting events and concerts, education-related applications such as online classes, and even medical operations and conferences.

[0009] The core idea of ​​BIER technology is that all network edge nodes are represented by one bit (BIT bit), and multicast traffic transmitted through intermediate networks is packaged by adding a specific BIER header. This message header represents all destination nodes of the multicast traffic in the form of a BIT string (BitString), and intermediate nodes perform routing based on the BIT bit to ensure that traffic is sent to all destination nodes. This data plane forwarding technology does not have the multicast tree establishment problem, eliminating the delay of multicast tree establishment, and its convergence speed is the same as that of the Open Shortest Path First (OSPF) protocol and the Intermediate System to Intermediate System (IS-IS) protocol, reducing the significant delay compared to re-establishing the original multicast tree.

[0010] The core idea of ​​BIER-TE technology is to escape bits in the BIT bit string in the BIER message header, and each BIT bit is used to represent a link rather than a destination node. Similarly, when a message enters and is forwarded through a BIER network, the node's processing of the message differs from that of the conventional BIER method. First, the BIER-TE forwarding table queried resembles the BIER forwarding table in format, but is actually a completely independent forwarding table, and each forwarding item in the table identifies a link rather than a node. Furthermore, when forwarding based on the forwarding item, forwarding and corresponding processing are performed based only on the BIT bits of the links connected to the node itself, ensuring that the message reaches its destination accurately without looping back. In other words, BIER technology can forward multicast traffic along the shortest path to reach the destination node, while BIER-TE technology transmits multicast traffic along specified links until it reaches the destination node.

[0011] FIG. 1 is a schematic diagram of a network according to one embodiment. As shown in FIG. 1, the network includes nodes R1, R2, R3, R4, R5, R6, R11, and R12. When traffic needs to be transmitted from R1 to R2 using BIER technology, assuming that the shortest path from R1 to R2 is R1 → R11 → R12 → R2, the traffic will be transmitted along this path. However, if there is a large amount of traffic to be transmitted, transmitting all of it along the shortest path would result in R11 and R12 becoming a performance bottleneck. Therefore, some traffic can be transmitted using a designated transmission path using BIER-TE technology. For example, traffic can be designated to be transmitted via the path R1 → R3 → R4 → R2, thereby bypassing the paths of R11 and R12. The BIER-TE technology is realized by packaging the links from R1 to R3, R3 to R4, and R4 to R2 into the BitString of the BIER-TE message. Each node needs to know the links and corresponding packaging methods indicated by these link information in the BitString to accurately package, analyze, and forward the BIER-TE message.

[0012] BIER-TE technology is similar to BIER technology, and uses internal protocols such as OSPF, IS-IS, Border Gateway Protocol (BGP), and BABEL in three-layer networks to report link information and form a BIER-TE forwarding table to guide forwarding. Furthermore, when multicast traffic packaged in BIER-TE is received, traffic forwarding can be completed based on the BIER-TE forwarding table.

[0013] The link information reporting method typically reports BIER-TE forwarding table identifier (FT-ID) information for directing forwarding following the link BP (Bit Position). That is, when reporting single link information, a sub-type-length-value (sub-TLV) representing the BIER-TE link BP is reported. For example, in the IS-IS protocol, reporting single link information adopts the Neighbor Information TLV format, which carries a sub-TLV for representing the BIER-TE link BP. The BIER-TE forwarding table identifier for directing forwarding is reported as a sub-sub-TLV following the sub-TLV of the link BP.

[0014] The number of messages reported in this reporting method varies depending on the number of interfaces of the node. When the network is simple and each node does not have many links, this reporting method does not pose any major problems. However, in actual networks, the number of links between nodes is often enormous. For example, a network may contain many nodes with complex interconnections, resulting in many links between each node. For example, a network may contain only a small number of nodes, but the number of links between nodes may be enormous. FIG. 2 is a schematic diagram of another network according to one embodiment. As shown in FIG. 2, the network includes nodes R1, R2, R3, R4, R5, R6, R11, and R12. Assuming that there are 200 links between R1 and R3, R3 and R4, R4 and R2, R1 and R11, R11 and R12, R12 and R2, R3 and R11, and R4 and R12, respectively, the number of links between R1 and R2 exceeds 400, and the number of links between R3, R4, R11, and R12 exceeds 600. The reporting method used assumes that R1 and R2 have 400 BIER-TE link BPs reported, and even if each link has only one forwarding table identifier, 400 reports are still required. The corresponding R3, R4, R11, and R12 also need to report 600 forwarding table identifiers. However, in reality, a single link may have multiple forwarding table identifiers. In this case, the number of reports continues to increase. For example, if a link supports 10 forwarding table identifiers, the number of reports increases tenfold. Assuming that one forwarding table identifier occupies 12 bytes, 600 reports occupy 7,200 bytes, and 6,000 reports occupy 72,000 bytes. A single node can support up to 60,000 links, and the occupancy is even greater, reaching 720,000 bytes. Even if there are multiple identical index values, they must still be reported according to this method. In this case, the size of the reported message is large, significantly increasing the complexity of node processing and potentially exceeding the processing capabilities of some nodes, causing problems.

[0015] The forwarding table identifier notification method of the present application can be applied to various communication systems based on BIER-TE technology. In the embodiments of the present application, a forwarding table identifier notification method, a node, and a storage medium are provided to reduce the scale of messages to be transmitted, simplify the complexity of node processing, and reduce the complexity of network deployment.

[0016] The following describes the method of reporting a forwarding table identifier, the nodes, and the technical effects thereof.

[0017] FIG. 3 is a flowchart of a method for reporting a forwarding table identifier according to an embodiment. As shown in FIG. 3, the method according to this embodiment is applied to a node, and includes the following steps:

[0018] At S110, a forwarding table identifier of the BIER-TE of the current node is determined based on the first information including a sub-domain (SD) and a bit string length (BitStringLength (BSL)).

[0019] In one embodiment, the first information further includes a Set-Identifier (SI).

[0020] In S120, the forwarding table identifier of the BIER-TE of the current node, which is coded in a preset coding method, is notified to other nodes.

[0021] In one embodiment, the type of the forwarding table identifier of the BIER-TE is at least one of a Multi-Protocol Label Switching (MPLS) type and a Non-Multi-Protocol Label Switching (Non-MPLS) type.

[0022] In one embodiment, the pre-configured coding scheme may be a prefix reachability coding scheme or a non-prefix reachability coding scheme. If the pre-configured coding scheme is the prefix reachability coding scheme, the forwarding table identifier of the BIER-TE is a sub-TLV carried in the sub-TLV of the bit index explicit replication information, i.e., the forwarding table identifier of the BIER-TE is a sub-sub-TLV of the bit index explicit replication information. If the pre-configured coding scheme is the non-prefix reachability coding scheme, the forwarding table identifier of the BIER-TE is a sub-TLV carried in the newly added top-level BIER-TE-TLV.

[0023] In one embodiment, the protocol employed to notify other nodes of the forwarding table identifier of the current node's BIER-TE includes one of the IS-IS protocol, the OSPF protocol, the BGP, the BABEL protocol, and the Link Layer Discovery Protocol (LLDP).

[0024] The OSPF protocol is an interior gateway protocol (IGP) used to make routing decisions within a single autonomous system (AS). It is an implementation of a link-state routing protocol and, as an interior gateway protocol (IGP), operates within an autonomous system. The well-known Dijkstra algorithm is used to calculate the shortest path tree. The OSPF protocol is a typical link-state routing protocol. In an autonomous system, all OSPF routers maintain the same database that describes the AS structure. This database stores the status information of corresponding links in the routing domain, and OSPF routers use this database to calculate their OSPF routing tables. As a link-state routing protocol, OSPF transmits link-state multicast data (Link State Advertisements, LSAs) to all routers within an area. Because a link is another name for a router interface, OSPF is also called an interface-state routing protocol. OSPF establishes a link state database by reporting the state of network interfaces between routers, generates a shortest path tree, and each OSPF router builds a routing table using these shortest paths.

[0025] The IS-IS protocol is an interior gateway protocol commonly used by telecommunications carriers. The standard IS-IS protocol is specified by the International Organization for Standardization / International Electrotechnical Commission (ISO / IEC) 10589:2002. However, the standard IS-IS protocol was designed for the Connectionless Network Service (CLNS) and is not directly applicable to Internet Protocol (IP) networks. Therefore, the Internet Engineering Task Force (IETF) has specified an integrated IS-IS protocol applicable to IP networks, called integrated IS-IS, and standardized it through RFC documents such as Request For Comments (RFC) 1195. IS-IS belongs to the interior gateway routing protocols and is used within autonomous systems. IS-IS is a link-state protocol that is very similar to the OSPF protocol in Transmission Control Protocol (TCP) / IP networks and performs routing calculations using the shortest path first algorithm.

[0026] BGP is a routing protocol between autonomous systems. The network reachability information exchanged by BGP provides sufficient information to discover routing circuits and make routing decisions based on performance priorities and policy constraints. BGP exchanges include network reachability information for all AS paths and execute routing policies according to the layout information. BGP and IGP protocols usually work together. BGP is usually used between autonomous systems, but with the development of networks, there is a tendency to use BGP as the only routing protocol in some scenarios.

[0027] The BABEL protocol is a routing protocol using a vector distance algorithm that supports both Internet Protocol version 6 (IP version 6, IPv6) and IPv4. It is stable and efficient and can be used on both wired and wireless networks. Unlike wired network protocols, such as the Routing Information Protocol (RIP), the BABEL protocol does not select the optimal path using the hop count, but instead uses the "Expected Transmission Count" (ETC) to calculate the number of hops required to reach a node. ETC bases path selection on a comprehensive basis, taking into account not only the number of hops required to reach a node but also a series of other indicators, such as link bandwidth and congestion. However, ETC constantly changes due to changes in the wireless environment and the joining and leaving of network nodes. This causes constant routing reversals, making network convergence difficult. Therefore, BABEL accelerates network convergence by using a history-sensitive mechanism, i.e., it selects previously used paths if they have similar ETC values. The BABEL protocol does not perform periodic routing updates and announcements throughout the network after network convergence, but instead passively triggers updates only when node information and state changes.

[0028] In one embodiment, if the current node and another node are adjacent nodes and the protocol used to notify the other node of the forwarding table identifier of the BIER-TE of the current node is the IS-IS protocol or the OSPF protocol, the flooding function of the IS-IS protocol or the OSPF protocol is suppressed, thereby reducing the scale of the message to be sent.

[0029] In one embodiment, if the current node and another node are neighboring nodes, the preset coding scheme is the prefix reachability coding scheme, and the protocol used to notify the current node's BIER-TE forwarding table identifier to another node is the BGP or BABEL protocol, the BGP or BABEL protocol will only notify prefix information, thereby reducing the size of the message being sent.

[0030] In one embodiment, when the protocol used to notify other nodes of the current node's BIER-TE forwarding table identifier is LLDP, the size of the message sent can be reduced due to the LLDP's characteristic of not transmitting beyond its own hop.

[0031] Based on the above embodiment, FIG. 4 is a flowchart of a method for reporting another forwarding table identifier according to an embodiment. As shown in FIG. 4, after performing S110, the method further includes the following steps:

[0032] In S130, a forwarding table for the BIER-TE of the current node is generated based on the forwarding table identifier of the BIER-TE of the current node.

[0033] In one embodiment, in addition to generating its own BIER-TE forwarding table, the current node can also receive the BIER-TE forwarding table identifiers of other nodes notified by other nodes and enter the BIER-TE forwarding table identifiers of other nodes into the BIER-TE forwarding table of the current node, ensuring smooth forwarding of subsequent traffic.

[0034] At S140, the traffic is forwarded based on the forwarding table of the BIER-TE of the current node.

[0035] From the description of the above embodiment, it can be seen that S110 and S120 are operations for reporting the forwarding table identifier of the BIER-TE of the current node. However, after the current node determines the forwarding table identifier of the BIER-TE of the current node, the current node can generate the forwarding table of the BIER-TE of the current node. That is, there is no order of execution between S120 and S130. On the other hand, S140 is a process of forwarding traffic. In general, to forward traffic smoothly, the network has already completed reporting the forwarding table identifier of the BIER-TE before forwarding the traffic. Therefore, S140 often needs to be executed after step S120.

[0036] The method of "forwarding traffic based on the forwarding table of the BIER-TE of the current node" in S140 may include S1 to S4.

[0037] At S1, receive a first message sent by another node and obtain a forwarding table identifier of the first message.

[0038] In S2, based on the forwarding table identifier of the first message, determine a target forwarding table corresponding to the forwarding table identifier of the first message from the forwarding table of the BIER-TE of the current node.

[0039] In one embodiment, if the target forwarding table is not included in the forwarding table of the BIER-TE of the current node, the first message is discarded. For example, in S130 above, the current node has not received the forwarding table identifier of the BIER-TE of the other node notified by the other node, and the target forwarding table cannot be found in the forwarding table of the BIER-TE of the current node, so the first message is discarded.

[0040] At S3, the next hop node is determined based on the target forwarding table.

[0041] At S4, a second message including a forwarding table identifier of the BIER-TE of the next hop node is sent to the next hop node.

[0042] The first message and the second message can be understood as traffic that needs to be forwarded.

[0043] The method of reporting forwarding table identifiers in the present application does not change depending on the number of interfaces of a node, so each forwarding table identifier only needs to be reported once (except in cases of updates, re-reporting, etc.). Compared to the reporting method in the background art, when the number of interfaces is huge, the scale of messages sent can be reduced, the complexity of node processing can be simplified, and the complexity of network deployment can be reduced.

[0044] In the following, several exemplary embodiments are listed to explain and explain the method for reporting a forwarding table identifier in the above embodiment of the present application. The following exemplary embodiments may be implemented individually or in combination.

[0045] In the first exemplary embodiment, taking R11 in the network shown in Figure 2 as an example, assuming that there are 200 links between R11 and R1, R3 and R12, and 1 link between R11 and R5, these link BP information will still be reported using the reporting method in the background art, but the forwarding table identifier will no longer be reported following the link BP.

[0046] Assuming that R11's links belong to a total of 10 subdomains, SD1 through SD10, and support only one BSL length (e.g., 256), R11 can assign an MPLS-type forwarding table identifier Index-x based on SD1 and BSL 256, an non-MPLS forwarding table identifier Index-y based on SD2 and BSL 256, and an MPLS forwarding table identifier Index-z based on SD3 and BSL 256. By analogy, R11 can assign 10 BIER-TE forwarding table identifiers based on 10 subdomains and a BSL length of 256. In one embodiment, two BIER-TE forwarding table identifiers, MPLS and non-MPLS, may be simultaneously assigned based on the same SD and BSL (e.g., SD1 and BSL 256).

[0047] When R11 uses the IS-IS protocol to notify, assuming that it is responsible for notifying the node's prefix reachability, it specifies one prefix by configuration, and when notifying this prefix, it can add a new BIER-TE sub-tlv containing the BIER-TE forwarding table identifiers for MPLS and non-MPLS, as shown in Figure 5. The BIER-TE forwarding table identifier structure is shown in Figure 6, which includes the SD, BSL, and forwarding table identifier index. If a node assigns a BIER-TE forwarding table identifier based on the SD, BSL, and SI, it can still use a structure similar to Figure 6, with the addition of one additional SI.

[0048] R11 also receives the BIER-TE forwarding table identifiers reported by other nodes such as R1, R3, R12, and R5 via the IS-IS protocol, and in this case, it can associate them with the link BPs reported by the other nodes to generate the BIER-TE forwarding tables shown in Table 1 and Table 2.

[0049] [Table 1]

[0050] The index value of the BIER-TE forwarding table shown in Table 1 is x, which means that the current node allocates a forwarding table of type MPLS based on SD1 and BSL256. Here, the neighbor corresponding to link Link-1 is Neighbor-1, which also reports a forwarding table with SD1, BSL256, and type MPLS, with a forwarding table identifier value of Index-1.

[0051] [Table 2]

[0052] The index value of the BIER-TE forwarding table shown in Table 2 is y, which means that the current node allocates a forwarding table of type Non-MPLS based on SD2 and BSL256. Here, the neighbor corresponding to link Link-1 is Neighbor-1, which also reports a forwarding table identifier value of Index-11, which has SD2, BSL256, and type Non-MPLS.

[0053] When R11 receives a BIER-TE message sent by another node, for example, R11 receives the BIER-TE message from R1 and locates it in the corresponding forwarding table (i.e., target forwarding table) based on the forwarding table identifier field of the message. Assuming that it locates it in the forwarding table with SD1, BSL256, and type MPLS shown in Table 1, it forwards the message based on the neighbor (i.e., next node) it finds. If it needs to be sent to Neighbor-1 and Neighbor-3, R11 copies the message to two nodes, fills the forwarding table identifier fields in the two copies with the forwarding table identifier values ​​reported by Neighbor-1 and Neighbor-3, respectively, and then sends them to the two nodes. Each node uses a similar process to forward the message to its destination.

[0054] In one embodiment, in addition to the IS-IS protocol, other protocols such as OSPF may be used for reporting. When reporting using OSPF, when reporting an OSPFv2 Extend Prefix TLV with a specified prefix, a BIER-TE sub-tlv can be added, and the information carried therein is similar to that of IS-IS. If reporting is performed using the BGP or BGP-Link State (LS) protocol, a BIER-TE Path Attribute can be newly created to report following the prefix specified by the node, and the information carried therein is similar to that of IS-IS.

[0055] In one embodiment, if it is not possible to specify a prefix to follow by allocation or other methods, the prefix with the largest or smallest value among the prefixes to be reported may be automatically selected and reported.

[0056] In the second exemplary embodiment, if it is assumed that a node in the network does not report using a prefix, for example, in the case of the IS-IS protocol, there is a possibility that three-layer prefixes are not arranged, and the method of reporting by following the prefix in the first exemplary embodiment cannot be adopted. In this case, it is possible to report by adding a new top-level BIER-TE tlv, and the forwarding table identifiers of MPLS and non-MPLS BIER-TE included in the tlv are similar to the definition in the first exemplary embodiment.

[0057] Assuming that a node in the network uses LLDP for reporting, a similar method may be adopted to directly add a new BIER-TE TLV to carry the BIER-TE forwarding table identifier of type MPLS and / or Non-MPLS for reporting.

[0058] The method can also announce the BIER-TE forwarding table identifier of the current node and receive the BIER-TE forwarding table identifiers of other nodes announced by other nodes, thereby realizing accurate organization of the BIER-TE forwarding table and accurate processing and forwarding of BIER-TE messages.

[0059] In the first exemplary embodiment, by default, nodes in the network transmit link information to the entire network, so that the link information of all nodes in the network, including forwarding table identifier information, is learned throughout the network, for example, R1 can receive notifications from R2, R4, R6, and R12 in addition to notifications from R3, R5, and R11. This notification method is relatively useful when only one node in the network reports this information to the controller through the BGP-LS protocol.

[0060] In the third exemplary embodiment, still taking the network shown in Figure 2 as an example, assuming that one node in the network does not need to notify BIER-TE related information using BGP-LS technology (including forwarding table identifiers, etc. to the controller), the BIER-TE link BP and forwarding table identifier only need to be notified between adjacent nodes. For example, after notifying each link information (including forwarding table identifiers) of R11 to nodes R1, R3, R5 and R12, nodes R3, R5 and R12 do not need to notify this information of R11 to nodes such as R2, R4 and R6.

[0061] To achieve the above function, if the current node and another node are adjacent nodes and the protocol used to notify other nodes of the current node's BIER-TE forwarding table identifier is IS-IS or OSPF, the flooding function of the IS-IS or OSPF protocol is suppressed. This prevents information from being flooded to non-adjacent nodes and reduces the size of the transmitted message. If the current node and another node are adjacent nodes, the pre-configured coding method is prefix reachability coding, and the protocol used to notify other nodes of the current node's BIER-TE forwarding table identifier is BGP or BABEL, the BGP or BABEL protocol only notifies prefix information. This eliminates the need to notify all BIER-TE forwarding table identifiers carried therein, thereby reducing the size of the transmitted message. If the protocol used to notify other nodes of the current node's BIER-TE forwarding table identifier is LLDP, the size of the transmitted message can also be reduced due to the LLDP's characteristic of not transmitting beyond its own hop.

[0062] FIG. 7 is a forwarding table identifier reporting device according to an embodiment, which can be configured in a node. As shown in FIG. 7, the device includes a determination module 10 and a reporting module 11.

[0063] The determination module 10 is configured to determine a forwarding table identifier of a bit-index explicit replication BIER-TE based on a specified path of the current node based on first information including a subdomain SD and a bit string length BSL, and the notification module 11 is configured to notify other nodes of the forwarding table identifier of the BIER-TE of the current node, which is encoded in a predetermined encoding method.

[0064] The forwarding table identifier reporting device of this embodiment realizes the forwarding table identifier reporting method of the embodiment shown in Figures 3 to 4, and the realization principle and technical effects of the forwarding table identifier reporting device of this embodiment are similar to those of the above embodiment, so description thereof will be omitted here.

[0065] In one embodiment, the first information further includes a set identifier SI.

[0066] In one embodiment, the type of the forwarding table identifier of the BIER-TE is at least one of a Multiprotocol Label Switching (MPLS) type and a non-Multiprotocol Label Switching (Non-MPLS) type.

[0067] In one embodiment, the pre-configured encoding scheme is a prefix reachability encoding scheme, and the forwarding table identifier of the BIER-TE is a sub-TLV carried in the Bit Index Explicit Replication Information Subtype-Length-Value sub-TLV.

[0068] In one embodiment, the pre-configured coding scheme is a non-prefix reachability coding scheme, and the BIER-TE forwarding table identifier is a sub-TLV carried in a newly added top-level BIER-TE-TLV.

[0069] In one embodiment, the protocol employed to notify other nodes of the forwarding table identifier of the current node's BIER-TE includes one of the Intermediate System-to-Intermediate System IS-IS protocol, the Open Shortest Path First OSPF protocol, the Border Gateway Protocol BGP, the BABEL protocol, and the Link Layer Discovery Protocol LLDP.

[0070] In one embodiment, in combination with FIG. 7, FIG. 8 is another forwarding table identifier reporting device according to one embodiment, the device further comprising a forwarding module 12, wherein the determination module 10 is further configured to generate a forwarding table of the BIER-TE of the current node based on the forwarding table identifier of the BIER-TE of the current node, and the forwarding module 12 is configured to forward traffic based on the forwarding table of the BIER-TE of the current node.

[0071] In one embodiment, the notification module 11 is further configured to receive a forwarding table identifier of the BIER-TE of another node notified by the other node, and the determination module 10 is further configured to enter the forwarding table identifier of the BIER-TE of the other node into the forwarding table of the BIER-TE of the current node.

[0072] In one embodiment, the forwarding module 12 is configured to receive a first message sent by another node, obtain a forwarding table identifier of the first message, determine a target forwarding table corresponding to the forwarding table identifier of the first message from the forwarding table of the BIER-TE of the current node based on the forwarding table identifier of the first message, determine a next-hop node based on the target forwarding table, and send a second message including the forwarding table identifier of the BIER-TE of the next-hop node to the next-hop node.

[0073] In one embodiment, the forwarding module 12 is further configured to discard the first message if the target forwarding table is not included in the forwarding table of the BIER-TE of the current node.

[0074] In one embodiment, if the current node and another node are adjacent nodes and the protocol adopted to notify the current node of the forwarding table identifier of the BIER-TE to other nodes is the IS-IS protocol or the OSPF protocol, the flooding function of the IS-IS protocol or the OSPF protocol is suppressed.

[0075] In one embodiment, if the current node and another node are adjacent nodes, the preset coding scheme is the prefix reachability coding scheme, and the protocol adopted to notify the current node's BIER-TE forwarding table identifier to other nodes is the BGP or BABEL protocol, the BGP or BABEL protocol will only notify prefix information.

[0076] The embodiments of the present application further provide a node, comprising a processor, for implementing the method according to any of the embodiments of the present application when the processor executes a computer program. For example, the following embodiments provide a structural diagram of the node as a base station.

[0077] 9 is a structural schematic diagram of a base station according to one embodiment. As shown in FIG. 9, the base station includes a processor 60, a memory 61, and a communication interface 62. The number of processors 60 in the base station may be one or more, with one processor 60 being shown as an example in FIG. 9. The processor 60, memory 61, and communication interface 62 in the base station may be connected via a bus or other methods, with connection via a bus being shown as an example in FIG. 9. The bus may represent one or more of several bus structures, including a memory bus or memory controller, a peripheral bus, an AGP (Accelerated Graphics Port), a local bus using any of a processor or multiple bus structures.

[0078] The memory 61 can be configured as a computer-readable storage medium to store software programs, computer-executable programs and modules, such as program instructions / modules corresponding to the methods in the embodiments of the present application. The processor 60 executes the software programs, instructions and modules stored in the memory 61 to perform at least one functional application and data processing of the base station, i.e., to realize the above-mentioned methods.

[0079] The memory 61 may include a program storage area and a data storage area, where the program storage area can store an operating system and application programs required for at least one function, and the data storage area can store data generated based on the use of the terminal, etc. The memory 61 may also include high-speed random access memory and may further include non-volatile memory such as at least one magnetic disk storage device, flash memory, or other non-volatile solid-state storage device. In some embodiments, the memory 61 preferably includes memory located remotely from the processor 60, and these remote memories may be connected to a base station via a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0080] The communication interface 62 may be configured to send and receive data.

[0081] An embodiment of the present application further provides a computer-readable storage medium having stored thereon a computer program that, when executed by a processor, implements the method according to any of the embodiments of the present application.

[0082] The computer storage medium of the present application may employ any combination of one or more computer-readable media. The computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium may be, for example, but not limited to, an electric, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. Computer-readable storage media (a non-exhaustive list) include an electrical connection having one or more leads, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a flash memory, an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this application, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used in or in conjunction with an instruction execution system, apparatus, or device.

[0083] A computer-readable signal medium may include a propagated data signal, either in baseband or as part of a carrier wave, carrying computer-readable program code. Such a propagated data signal may take various forms, including, but not limited to, an electromagnetic signal, an optical signal, or any suitable combination of the above. A computer-readable signal medium may be any computer-readable medium other than a computer-readable storage medium, which is capable of transmitting, propagating, or transporting a program for use in or in connection with an instruction execution system, apparatus, or device.

[0084] The program code contained in the computer readable medium may be transmitted over any suitable medium, including, but not limited to, electrical wire, optical cable, radio frequency (RF), or the like, or any suitable combination of the above.

[0085] Computer program code for carrying out the operations of the present disclosure can be written in one or more programming languages, or a combination thereof, including object-oriented programming languages ​​(e.g., Java, Smalltalk, C++, Ruby, Go), and even conventional procedural programming languages ​​(e.g., "C" or similar programming languages). The program code may run entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or a business server. In the case of a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., connected via the Internet using an Internet Service Provider).

[0086] Those skilled in the art will appreciate that the term user terminal includes any suitable type of wireless user equipment, including, for example, a mobile phone, a portable data processing device, a portable network browser, or a vehicle mounted mobile device.

[0087] In general, various embodiments of the present application may be implemented in hardware or special purpose circuits, software, logic, or any combination thereof. For example, some aspects may be implemented in hardware while other aspects may be implemented in firmware or software executable by a controller, microprocessor, or other computing device, and the present application is not limited thereto.

[0088] Embodiments of the present application may be implemented by execution of computer program instructions by a data processor of a mobile device, for example in a processor entity, by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, Instruction Set Architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or target code written in any combination of one or more programming languages.

[0089] Any logic flow block diagrams in the figures herein may represent program steps, interconnected logic circuits, modules, and functions, or a combination of program steps and logic circuits, modules, and functions. Computer programs may be stored in memory. The memory may be of any type suitable for the local technology environment and may be implemented with any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random-access memory (RAM), optical storage devices and systems (digital versatile disks, DVDs, or CD optical disks), etc. Computer-readable media may also include non-transitory storage media. Data processors may be of any type suitable for the local technology environment, such as, but not limited to, general-purpose computers, special-purpose computers, microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), and processors based on multi-core processor architectures.

Claims

1. Determining a forwarding table identifier of a specified path-based bit-index explicit replication traffic engineering (BIER-TE) of the current node based on first information including a subdomain (SD) and a bit string length (BSL); and notifying other nodes of a forwarding table identifier of the BIER-TE of the current node, the forwarding table identifier being encoded in a predetermined encoding method. Method for reporting forwarding table identifier.

2. The first information further includes a set identifier SI. The method of claim 1.

3. The type of the forwarding table identifier of the BIER-TE is at least one of a Multi-Protocol Label Switching (MPLS) type and a non-Multi-Protocol Label Switching (Non-MPLS) type; The method of claim 1.

4. The preset encoding scheme is a prefix reachability encoding scheme, and the forwarding table identifier of the BIER-TE is a sub-TLV carried in a subtype-length-value sub-TLV of bit index explicit replication information. The method of claim 1.

5. The preset coding scheme is a non-prefix reachability coding scheme, and the BIER-TE forwarding table identifier is a sub-TLV carried in a newly added top-level BIER-TE-TLV. The method of claim 1.

6. The protocol adopted for informing other nodes of the forwarding table identifier of the BIER-TE of the current node includes one of the following: Intermediate System-to-Intermediate System IS-IS protocol, Open Shortest Path First OSPF protocol, Border Gateway Protocol BGP, BABEL protocol, Link Layer Discovery Protocol LLDP; The method of claim 1.

7. generating a BIER-TE forwarding table of the current node based on a BIER-TE forwarding table identifier of the current node; and forwarding the traffic based on a forwarding table of the BIER-TE of the current node. The method of claim 1.

8. After generating the BIER-TE forwarding table of the current node, receiving a forwarding table identifier of a BIER-TE of another node broadcast by the other node; and entering the BIER-TE forwarding table identifier of the other node into the BIER-TE forwarding table of the current node. The method of claim 7.

9. Forwarding traffic based on a forwarding table of a BIER-TE of the current node includes: receiving a first message sent by another node and obtaining a forwarding table identifier for the first message; According to the forwarding table identifier of the first message, determining a target forwarding table corresponding to the forwarding table identifier of the first message from the forwarding table of the BIER-TE of the current node; determining a next-hop node based on the target forwarding table; sending a second message to the next hop node, the second message including a forwarding table identifier of the BIER-TE of the next hop node; The method of claim 7.

10. If the target forwarding table is not included in a forwarding table of a BIER-TE of the current node, discarding the first message.

10. The method of claim 9.

11. The current node and the other node are adjacent nodes, and the protocol used to notify the other node of the forwarding table identifier of the BIER-TE of the current node is the IS-IS protocol or the OSPF protocol, and the flooding function of the IS-IS protocol or the OSPF protocol is suppressed. The method of claim 1.

12. The current node and the other node are adjacent nodes, the preset coding scheme is a prefix reachability coding scheme, and the protocol used to notify the other node of the forwarding table identifier of the BIER-TE of the current node is BGP or BABEL protocol, and the BGP or BABEL protocol only notifies prefix information. The method of claim 1.

13. A processor configured to implement the method for reporting a forwarding table identifier according to any one of claims 1 to 12 when executing a computer program. node.

14. A computer program is stored which, when executed by a processor, implements the method for reporting a forwarding table identifier according to any one of claims 1 to 12. A computer-readable storage medium.

Images