WO2024082617A1 - 转发表索引的通告方法、节点及存储介质 - Google Patents

转发表索引的通告方法、节点及存储介质 Download PDF

Info

Publication number
WO2024082617A1
WO2024082617A1 PCT/CN2023/093772 CN2023093772W WO2024082617A1 WO 2024082617 A1 WO2024082617 A1 WO 2024082617A1 CN 2023093772 W CN2023093772 W CN 2023093772W WO 2024082617 A1 WO2024082617 A1 WO 2024082617A1
Authority
WO
WIPO (PCT)
Prior art keywords
forwarding table
bier
table index
protocol
current node
Prior art date
Application number
PCT/CN2023/093772
Other languages
English (en)
French (fr)
Inventor
张征
徐本崇
魏月华
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2024082617A1 publication Critical patent/WO2024082617A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/33—Flow control; Congestion control using forward notification
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding in a switch fabric
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding in a switch fabric
    • H04L49/252—Store and forward routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/50—Address allocation
    • H04L61/5069—Address allocation for group communication, multicast communication or broadcast communication
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks

Definitions

  • the present application relates to the field of communication technology, for example, to a notification method, node and storage medium for a forwarding table index.
  • Bit Indexed Explicit Replication (BIER) technology is a multicast data forwarding technology that can forward multicast traffic along the shortest path to the destination node; while Bit Indexed Explicit Replication-Traffic Engineering (BIER-TE) technology based on the specified path enables multicast traffic to be transmitted along the established link until it reaches the destination node.
  • BIER-TE technology is similar to BIER technology. It can notify link information through internal protocols to form a BIER-TE forwarding table for guiding forwarding, and then complete traffic forwarding according to the BIER-TE forwarding table when receiving BIER-TE encapsulated multicast traffic.
  • the number of messages notified by the way of notifying link information will change according to the number of interfaces of the node. When the number of nodes included in the network is large or the number of links between nodes is huge, the scale of the notified message is very large, which greatly increases the complexity of node processing and may even exceed the processing capacity of some nodes, causing problems.
  • the present application provides a method for notifying a forwarding table index, including:
  • the first information determine the forwarding table index of the current node's BIER-TE traffic engineering explicitly copied based on the bit index of the specified path, the first information includes the subdomain SD and the bit string length BSL; notify other nodes of the forwarding table index of the current node's BIER-TE, and the forwarding table index of the current node's BIER-TE is encoded using a preset encoding method.
  • An embodiment of the present application provides a node, including: a processor; the processor is used to implement the notification method of the forwarding table index of the above embodiment when executing a computer program.
  • An embodiment of the present application also provides a computer-readable storage medium storing a computer program, which implements the method for notifying the forwarding table index of the above embodiment when the computer program is executed by a processor.
  • FIG1 is a schematic diagram of a network provided by an embodiment
  • FIG2 is another network schematic diagram provided by an embodiment
  • FIG3 is a flow chart of a method for notifying a forwarding table index provided by an embodiment
  • FIG4 is a flow chart of another method for notifying a forwarding table index provided by an embodiment
  • FIG5 is a schematic diagram of encoding of a BIER-TE forwarding table index provided by an embodiment
  • FIG6 is a structural diagram of a BIER-TE forwarding table index provided by an embodiment
  • FIG7 is a notification device for a forwarding table index provided by an embodiment
  • FIG8 is another notification device for a forwarding table index provided by an embodiment
  • FIG. 9 is a schematic diagram of the structure of a base station provided by an embodiment.
  • Multicast technology plays an increasingly important role in Internet services.
  • multicast technology is used in work-related services such as online conferencing, entertainment-related services such as live broadcasts of sports events and concerts, education-related services such as online teaching, and medical operations and consultations.
  • BIER Bit Bit
  • the core idea of BIER technology is to represent the nodes at the edge of the network with only one bit (BIT bit).
  • the multicast traffic is transmitted in the intermediate network, and a specific BIER header is additionally encapsulated.
  • This message header marks all the destination nodes of the multicast traffic in the form of a BIT bit string (BitString).
  • the intermediate nodes perform routing according to the BIT bit to ensure that the traffic can be sent to all destination nodes.
  • This data plane forwarding technology eliminates the delay of multicast tree establishment because there is no problem of establishing a multicast tree, and the 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, which greatly reduces the delay compared to the original multicast tree reconstruction.
  • OSPF Open Shortest Path First
  • IS-IS Intermediate system to intermediate system
  • BIER-TE The core idea of BIER-TE technology is to escape the bits in the BIT bit string in the BIER message header. Each bit is no longer used to represent the destination node, but to represent the link. Similarly, when the message enters the BIER network for forwarding, the node's processing of the message is also different from the traditional BIER method.
  • the BIER-TE forwarding table queried is very similar to the BIER forwarding table in form, but it is actually a completely independent forwarding table. Each bit in the forwarding table entry of the table identifies a link, not a node.
  • BIER technology can forward multicast traffic according to the shortest path to the destination node; while BIER-TE technology enables multicast traffic to be transmitted along the established link until it reaches the destination node.
  • FIG1 is a schematic diagram of a network provided by an embodiment.
  • the network includes nodes R1, R2, R3, R4, R5, R6, R11 and R12. If there is traffic that needs to be sent from R1 to R2, and BIER technology is used for transmission, assuming that the shortest path from R1 to R2 is R1 ⁇ R11 ⁇ R12 ⁇ R2, the traffic will be transmitted along this path. However, assuming that there is a lot of traffic to be transmitted, and if all of it follows the shortest path, R11 and R12 will become performance bottlenecks.
  • BIER-TE technology can be used to specify the transmission path for transmission, such as specifying that the traffic is transmitted through the path of R1 ⁇ R3 ⁇ R4 ⁇ R2, so that the paths of R11 and R12 can be bypassed.
  • the implementation of BIER-TE technology is to encapsulate the link from R1 to R3, the link from R3 to R4, and the link from R4 to R2 into the BitString of the BIER-TE message. Each node needs to know the link pointed to by these link information in the BitString and the corresponding encapsulation method in order to achieve the correct encapsulation, parsing and forwarding of the BIER-TE message.
  • BIER-TE technology is similar to BIER technology. It can notify link information through internal protocols, such as OSPF protocol, IS-IS protocol, Border Gateway Protocol (BGP), BABEL protocol, etc. in the three-layer network to form a BIER-TE forwarding table for guiding forwarding. Then, when BIER-TE encapsulated multicast traffic is received, traffic forwarding is completed according to the BIER-TE forwarding table.
  • internal protocols such as OSPF protocol, IS-IS protocol, Border Gateway Protocol (BGP), BABEL protocol, etc.
  • the way to announce link information is usually to announce the BIER-TE forwarding table index (Forwarding Table Identifier, FT-ID) information used to guide forwarding following the link BP (BitPosition), that is, when announcing a single link information, the sub-type-length-value (sub-TLV) representing the BIER-TE link BP will be announced.
  • the announcement of a single link information is in the form of Neighbor Information TLV, under which the sub-TLV used to represent the BIER-TE link BP is carried.
  • the BIER-TE forwarding table index used to guide forwarding is announced as a sub-sub-TLV following the sub-TLV of the link BP.
  • FIG. 2 is another network schematic diagram provided by an embodiment. As shown in Figure 2, the network includes nodes R1, R2, R3, R4, R5, R6, R11 and R12.
  • R1 and R2 announce 400 BIER-TE link BPs, and even if there is only one forwarding table index on a link, 400 need to be announced; correspondingly, R3, R4, R11 and R12 also need to announce 600 forwarding table indexes.
  • a link can have multiple forwarding table indexes, and the number of announcements will continue to increase: for example, if a link corresponds to 10 forwarding table indexes, the number of announcements will become 10 times. Calculated as a forwarding table index occupies 12 bytes, 600 announcements will occupy 7200 bytes, and 6000 announcements will occupy 72000 bytes.
  • a single node can support up to 60,000 links, and the occupancy is even greater, reaching 72 Even if there are multiple identical index values, they must be notified in this way. In this case, the size of the notification message is very large, which greatly increases the complexity of node processing and may even exceed the processing capacity of some nodes, causing problems.
  • the notification method of the forwarding table index provided in this application can be applied to various communication systems based on BIER-TE technology.
  • a notification method, node and storage medium for a forwarding table index are provided to reduce the scale of messages sent, simplify the complexity of node processing, and reduce the complexity of network deployment.
  • FIG3 is a flow chart of a method for notifying a forwarding table index provided by an embodiment. As shown in FIG3 , the method provided by this embodiment is applicable to a node, and the method includes:
  • the first information includes the sub-domain (Sub-Domain, SD) and the bit string length (BitStringLength, BSL).
  • the first information further includes a set identifier (Set-Identifier, SI).
  • SI set-Identifier
  • the forwarding table index of the BIER-TE of the current node is encoded using a preset encoding method.
  • the type of the forwarding table index of BIER-TE is at least one of a Multi-Protocol Label Switching (MPLS) type and a Non-Multi-Protocol Label Switching (Non-MPLS) type.
  • MPLS Multi-Protocol Label Switching
  • Non-MPLS Non-Multi-Protocol Label Switching
  • the preset encoding method may be a prefix reachability encoding method or a non-prefix reachability encoding method.
  • the forwarding table index of BIER-TE is the sub-TLV carried in the sub-TLV of the bit index explicit copy information, that is, the forwarding table index of BIER-TE is the sub-sub-TLV of the bit index explicit copy information).
  • the forwarding table index of BIER-TE is the sub-TLV carried in the newly added top-level BIER-TE-TLV.
  • the protocol used to notify other nodes of the forwarding table index of the current node's BIER-TE includes one of the following protocols: IS-IS protocol, OSPF protocol, BGP, BABEL protocol, Link Layer Discovery Protocol (LLDP).
  • IS-IS protocol IS-IS protocol
  • OSPF protocol OSPF protocol
  • BGP BGP
  • BABEL protocol Link Layer Discovery Protocol
  • LLDP Link Layer Discovery Protocol
  • OSPF 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 is a part of the interior gateway protocol (IGP), so it operates within the autonomous system.
  • the famous Dijkstra algorithm is used to calculate the shortest path tree.
  • OSPF is a typical link state routing protocol. (Link-state) routing protocol.
  • Link-state routing protocol.
  • all OSPF routers maintain the same database that describes the structure of the AS. The database stores the status information of the corresponding links in the routing domain. OSPF routers calculate their OSPF routing tables through this database.
  • OSPF transmits link-state multicast data (Link State Advertisement, LSA) to all routers in an area.
  • LSA Link State Advertisement
  • OSPF is also called interface state routing protocol.
  • OSPF establishes a link-state database and generates a shortest path tree by announcing the status of network interfaces between routers. Each OSPF router uses these shortest paths to construct a routing table.
  • IS-IS protocol is an internal gateway protocol and one of the internal gateway protocols commonly used by telecommunications operators.
  • the standard IS-IS protocol is standardized by the International Organization for Standardization/International Electrotechnical Commission (ISO/IEC) 10589:2002 developed by the International Organization for Standardization.
  • the standard IS-IS protocol is designed for connectionless network services (CLNS) and is not directly suitable for Internet Protocol (IP) networks. Therefore, the Internet Engineering Task Force has developed an integrated IS-IS protocol that can be applied to IP networks, called Integrated IS-IS, which is standardized by RFC documents such as Request For Comments (RFC) 1195.
  • IS-IS is an internal gateway routing protocol used within an autonomous system.
  • IS-IS is a link state protocol, very similar to the OSPF protocol in the Transmission Control Protocol (TCP)/IP network, and uses the shortest path first algorithm for routing calculations.
  • BGP is an inter-AS routing protocol.
  • the network reachability information exchanged by BGP provides enough information to detect routing loops and make routing decisions based on performance priorities and policy constraints.
  • BGP exchanges network reachability information containing all AS paths and executes routing policies according to the configuration information.
  • BGP works in conjunction with IGP protocols.
  • BGP is usually used between autonomous systems, as the network develops, some scenarios tend to use only BGP as a routing protocol.
  • the BABEL protocol is a routing protocol that supports Internet Protocol version 6 (IP version 6, IPv6) and IPv4 and uses a vector distance algorithm. It is stable and efficient and can be used in wired and wireless networks. Compared with wired network protocols represented by the Routing Information Protocol (RIP), the BABEL protocol no longer uses the number of hops to select the optimal path, but uses the "Expected Transmission Count" (ETC) to calculate the number of hops to reach a node. ETC not only considers the number of hops to reach a node, but also comprehensively considers a series of indicators such as link bandwidth and congestion as the basis for route selection.
  • ETC Exected Transmission Count
  • BABEL uses a history-sensitive mechanism to accelerate the convergence of the network, that is, to select the path that has been used when the ETC value is similar. After the network converges, the BABEL protocol will not perform periodic route updates and announcements throughout the network. The update will only be passively triggered when the node information and status change.
  • the protocol used to notify the forwarding table index of the current node's 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. In this way, the size of the message sent can be reduced.
  • the preset encoding method is the prefix reachability encoding method
  • the protocol used to notify other nodes of the forwarding table index of the current node's BIER-TE is BGP or BABEL
  • BGP or BABEL only notifies the prefix information. In this way, the size of the message sent can be reduced.
  • the protocol used to notify other nodes of the forwarding table index of the current node's BIER-TE is LLDP
  • the characteristic of LLDP itself that it does not transmit across hops can also reduce the size of the message sent.
  • FIG4 is a flowchart of another method for notifying a forwarding table index provided by an embodiment. As shown in FIG4 , after S110 is executed, the method further includes:
  • the current node in addition to generating its own BIER-TE forwarding table, can also: receive the BIER-TE forwarding table indexes of other nodes notified by other nodes; and fill the BIER-TE forwarding table indexes of other nodes into the BIER-TE forwarding table of the current node to ensure the smooth forwarding of subsequent traffic.
  • S110 and S120 are operations for notifying the forwarding table index of the BIER-TE of the current node.
  • the current node after determining the forwarding table index 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.
  • S140 is the process of forwarding traffic. Usually, in order for the traffic to be forwarded smoothly, the network has completed the notification of the BIER-TE forwarding table index before the traffic is forwarded. Therefore, S140 often needs to be executed after step S120.
  • the method of "forwarding traffic according to the forwarding table of the BIER-TE of the current node" in S140 may include S1-S4:
  • S1 Receive a first message sent by other nodes, and obtain a forwarding table index of the first message.
  • the forwarding table of the BIER-TE of the current node does not include the target forwarding table, then The first message is discarded.
  • the current node does not receive the BIER-TE forwarding table index of other nodes notified by other nodes, and cannot find the target forwarding table in the BIER-TE forwarding table of the current node, so the first message is discarded.
  • S3 Determine the next hop node based on the target forwarding table.
  • S4 Send a second message to the next hop node, where the second message includes the forwarding table index of the BIER-TE of the next hop node.
  • the first message and the second message can be understood as traffic that needs to be forwarded.
  • the notification method of the forwarding table index of the present application will not change due to changes in the number of interfaces of the node. Therefore, each forwarding table index only needs to be notified once (except for updates, re-notifications, etc.).
  • the notification method in the background technology when the number of interfaces is large, it can reduce the scale of messages sent, simplify the complexity of node processing, and reduce the complexity of network deployment.
  • R11 can allocate the MPLS type forwarding table index Index-x according to SD1 and BSL256; allocate the Non-MPLS forwarding table index Index-y according to SD2 and BSL256; allocate the MPLS forwarding table index Index-z according to SD3 and BSL256, and so on.
  • R11 can allocate 10 BIER-TE forwarding table indexes according to 10 subdomains and a BSL length of 256.
  • two BIER-TE forwarding table indexes of both MPLS and Non-MPLS types can also be allocated at the same time.
  • R11 carries the node's Prefix Reachability announcement when using the IS-IS protocol for announcement.
  • a Prefix can be specified by configuration.
  • a new BIER-TE sub-tlv is added, which contains the forwarding table index of BIER-TE for MPLS and Non-MPLS, as shown in Figure 5.
  • For the forwarding table index structure of BIER-TE refer to Figure 6, which contains SD, BSL, and forwarding table index Index.
  • R11 will also receive the BIER-TE forwarding table index notified by other nodes such as R1, R3, R12, R5 through the IS-IS protocol, and then combine the link BP notified by other nodes to generate the following table 1, Table 2 shows the forwarding table of BIER-TE.
  • the index value of the BIER-TE forwarding table shown in Table 1 is x, which means the forwarding table of the MPLS type allocated by the current node according to SD1 and BSL256; for link Link-1, its corresponding neighbor is Neighbor-1, and the index value of the forwarding table announced by the neighbor is also SD1, BSL256, and the MPLS type is Index-1.
  • the index value of the BIER-TE forwarding table shown in Table 2 is y, which means the forwarding table of the Non-MPLS type allocated by the current node according to SD2 and BSL256; for link Link-1, its corresponding neighbor is Neighbor-1, and the index value of the forwarding table notified by the neighbor is Index-11, which is also SD2, BSL256 and Non-MPLS type.
  • R11 When R11 receives a BIER-TE message from other nodes, for example, R11 receives a BIER-TE message from R1, it locates the corresponding forwarding table (i.e., the target forwarding table) according to the forwarding table index field of the message. Assuming that the forwarding table of SD1, BSL256, and MPLS type shown in Table 1 is located, the message is forwarded according to the neighbor found (i.e., the next node). Assuming that it needs to be sent to Neighbor-1 and Neighbor-3, R11 will copy the message into two copies, fill in the forwarding table index field with the forwarding table index value announced by Neighbor-1 and Neighbor-3 respectively, and then send it to these two nodes. Each node The processing of all packets adopts a similar process, so that the message is forwarded to the destination.
  • OSPF in addition to using the IS-IS protocol, other protocols such as OSPF may be used for notification.
  • OSPF when notifying the OSPFv2 Extend Prefix TLV of the specified Prefix, the notification of the BIER-TE sub-tlv may also be added, and the information carried therein is similar to IS-IS.
  • BGP or BGP-Link State (LS) protocol is used for notification, a new BIER-TE Path Attribute may be created to follow the Prefix specified by the node for notification, and the information carried therein is similar to IS-IS.
  • the prefix with the largest or smallest value in the notification may be automatically selected for notification.
  • the announcement can be made by adding a Top-Level BIER-TE tlv, and the MPLS and Non-MPLS BIER-TE forwarding table indexes included in the tlv are similar to the definition in the first exemplary embodiment.
  • This method can also announce the BIER-TE forwarding table index of the current node, as well as the BIER-TE forwarding table index of other nodes announced by other nodes, thereby achieving the correct organization of the BIER-TE forwarding table and thus achieving the correct processing and forwarding of BIER-TE messages.
  • nodes in the network will send link information to the entire network, so that the link information of all nodes in the network, including the forwarding table index information, will be learned by the entire network.
  • R1 can receive notifications from R3, R5, and R11 as well as R2, R4, R6, and R12. This notification method is more useful when only one node in the network reports this information to the controller through the BGP-LS protocol.
  • the link BP and forwarding table index of BIER-TE only need to be notified between adjacent nodes. For example, after the link information of R11 (including the forwarding table index) is notified to the R1, R3, R5 and R12 nodes, the R3, R5 and R12 nodes do not need to notify the R11 information to the R2, R4, R6 and other nodes.
  • the current node and other nodes are adjacent nodes, and to other nodes If the protocol used to announce the forwarding table index 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. In this way, information can be prevented from being flooded to non-adjacent nodes, reducing the size of the sent messages.
  • the protocol used to announce the forwarding table index of the BIER-TE of the current node is the IS-IS protocol or the OSPF protocol
  • the preset encoding method is the prefix reachability encoding method
  • the protocol used to announce the forwarding table index of the BIER-TE of the current node to other nodes is the BGP or BABEL protocol
  • the BGP or BABEL protocol only announces the prefix information. In this way, there is no need to announce the forwarding table index of the BIER-TE it carries, which can reduce the size of the sent messages.
  • the protocol used to announce the forwarding table index of the BIER-TE of the current node to other nodes is LLDP, then the characteristic of LLDP itself that it does not transmit across hops can also reduce the size of the sent messages.
  • FIG. 7 is a notification device for a forwarding table index provided by an embodiment.
  • the device may be configured in a node. As shown in FIG. 7 , the device includes: a determination module 10 and a notification module 11 .
  • the determination module 10 is configured to determine the forwarding table index of the current node's BIER-TE that is explicitly copied based on the bit index of the specified path according to the first information, and the first information includes the subdomain SD and the bit string length BSL; the notification module 11 is configured to notify other nodes of the forwarding table index of the current node's BIER-TE, and the forwarding table index of the current node's BIER-TE is encoded using a preset encoding method.
  • the notification device for the forwarding table index provided in this embodiment is to implement the notification method for the forwarding table index of the embodiment shown in Figures 3-4.
  • the implementation principle and technical effect of the notification device for the forwarding table index provided in this embodiment are similar to those of the above embodiment and will not be repeated here.
  • the first information further includes a set identifier SI.
  • the type of the forwarding table index of 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 preset encoding method is the prefix reachability encoding method
  • the forwarding table index of BIER-TE is the sub-TLV carried in the subtype-length-value sub-TLV of the bit index explicit replication information.
  • the preset encoding method is a non-prefix reachability encoding method
  • the forwarding table index of BIER-TE is the sub-TLV carried in the newly added top-level BIER-TE-TLV.
  • the protocol used to notify other nodes of the forwarding table index of the current node's BIER-TE includes one of the following protocols: 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.
  • Figure 8 is another notification device for a forwarding table index provided by one embodiment, the device also includes a forwarding module 12; the determination module 10 is also configured to generate a forwarding table of the BIER-TE of the current node based on the forwarding table index of the BIER-TE of the current node; the forwarding module 12 is configured to forward traffic based on the forwarding table of the BIER-TE of the current node.
  • the notification module 11 is also configured to receive the forwarding table index of BIER-TE of other nodes notified by other nodes; the determination module 10 is also configured to fill the forwarding table index of BIER-TE of other nodes into the forwarding table of BIER-TE of the current node.
  • the forwarding module 12 is configured to receive a first message sent by other nodes and obtain a forwarding table index of the first message; determine a target forwarding table from a forwarding table of the BIER-TE of the current node according to the forwarding table index of the first message, the target forwarding table corresponds to the forwarding table index of the first message; determine a next hop node according to the target forwarding table; send a second message to the next hop node, the second message including the forwarding table index of the BIER-TE of the next hop node.
  • the forwarding module 12 is also configured to not include the target forwarding table in the forwarding table of the BIER-TE of the current node, and discard the first message.
  • the current node and other nodes are adjacent nodes, and the protocol used to notify the forwarding table index of the current node's BIER-TE to other nodes 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 current node and other nodes are adjacent nodes
  • the preset encoding method is the prefix reachability encoding method
  • the protocol used to notify other nodes of the forwarding table index of the current node's BIER-TE is BGP or BABEL protocol, and BGP or BABEL protocol only notifies prefix information.
  • the embodiment of the present application further provides a node, including: a processor, the processor is used to implement the method provided in any embodiment of the present application when executing a computer program.
  • a node including: a processor, the processor is used to implement the method provided in any embodiment of the present application when executing a computer program.
  • the following embodiment provides a schematic diagram of a structure in which a node is a base station.
  • FIG9 is a schematic diagram of the structure of a base station provided by an embodiment.
  • the base station includes a processor 60, a memory 61 and a communication interface 62.
  • the number of processors 60 in the base station can be one or more, and FIG9 takes one processor 60 as an example.
  • the processor 60, the memory 61 and the communication interface 62 in the base station can be connected through a bus or other means, and FIG9 takes the connection through a bus as an example.
  • the bus represents one or more of several types of bus structures, including a memory bus or a memory controller, a peripheral bus, a graphics acceleration port, a processor or a local bus using any bus structure in a variety of bus structures.
  • the memory 61 can be configured to store software programs, computer executable programs and modules, such as program instructions/modules corresponding to the method in the embodiment of the present application.
  • the processor 60 executes at least one functional application and data processing of the base station by running the software programs, instructions and modules stored in the memory 61, that is, implementing the above method.
  • the memory 61 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application required for at least one function; the data storage area may store data created according to the use of the terminal, etc.
  • the memory 61 may include a high-speed random access memory and may also include a non-volatile memory.
  • the memory 61 may include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device.
  • the memory 61 may include a memory remotely located relative to the processor 60, and these remote memories may be connected to the base station via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a network, a mobile communication network, and combinations thereof.
  • the communication interface 62 may be configured to receive and send data.
  • An embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored.
  • a computer program is stored on which a computer program is stored.
  • the computer storage medium of the embodiment of the present application may adopt 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 electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above.
  • Computer-readable storage media include (a non-exhaustive list): an electrical connection with one or more wires, 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 disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.
  • a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in conjunction with an instruction execution system, device or device.
  • Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, the data signals carrying computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.
  • the program code contained on the computer-readable medium can be transmitted using any appropriate medium, including but not limited to wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the above.
  • any appropriate medium including but not limited to wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the above.
  • Computer program code for performing the operations of the present disclosure may be written in one or more programming languages or a combination of multiple programming languages, including object-oriented programming languages (such as Java, Smalltalk, C++, Ruby, Go), and conventional procedural programming languages (such as "C" language or similar programming languages).
  • the program code may be executed entirely on a user's computer, Partially executed on the user's computer, executed as a separate software package, partially executed on the user's computer and partially executed on a remote computer, or executed entirely on a remote computer or server.
  • the remote computer can be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or can be connected to an external computer (e.g., through the Internet using an Internet service provider).
  • LAN Local Area Network
  • WAN Wide Area Network
  • user terminal covers any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser or a vehicle-mounted mobile station.
  • various embodiments of the present application can be implemented in hardware or dedicated circuits, software, logic or any combination thereof.
  • some aspects can be implemented in hardware, while other aspects can be implemented in firmware or software that can be executed by a controller, microprocessor or other computing device, although the present application is not limited thereto.
  • Embodiments of the present application may be implemented by executing computer program instructions by a data processor of a mobile device, for example in a processor entity, or 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-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.
  • ISA instruction set architecture
  • the block diagram of any logic flow in the drawings of the present application may represent program steps, or may represent interconnected logic circuits, modules and functions, or may represent a combination of program steps and logic circuits, modules and functions.
  • the computer program may be stored in a memory.
  • the memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as but not limited to read-only memory (ROM), random access memory (RAM), optical memory devices and systems (digital versatile discs DVD or CD discs), etc.
  • Computer-readable media may include non-transient storage media.
  • the data processor may be of any type suitable for the local technical environment, such as but not limited to a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (Digital Signal Processing, DSP), an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), a programmable logic device (Field-Programmable Gate Array, FPGA) and a processor based on a multi-core processor architecture.
  • a general-purpose computer such as but not limited to a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (Digital Signal Processing, DSP), an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), a programmable logic device (Field-Programmable Gate Array, FPGA) and a processor based on a multi-core processor architecture.
  • DSP Digital Signal Processing
  • ASIC Application Specific Integrated Circuit
  • FPGA Field-Programmable Gate Array

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本申请公开了转发表索引的通告方法、节点及存储介质。该转发表索引的通告方法包括：根据第一信息，确定当前节点的基于指定路径的位索引显式复制BIER-TE的转发表索引，第一信息包括子域SD和位串长度BSL；向其他节点通告当前节点的BIER-TE的转发表索引，当前节点的BIER-TE的转发表索引采用预设编码方式编码。

Description

转发表索引的通告方法、节点及存储介质 技术领域
本申请涉及通信技术领域，例如涉及转发表索引的通告方法、节点及存储介质。
背景技术
位索引显式复制(Bit Indexed Explicit Replication，BIER)技术是一种组播数据转发技术，能够按照到达目的节点的最短路径转发组播流量；而基于指定路径的位索引显式复制流量工程(Bit Indexed Explicit Replication-Traffic Engineering，BIER-TE)技术则是使组播流量按照既定的链路进行传输，直到到达目的节点。BIER-TE技术和BIER技术类似，可以通过内部协议通告链路信息，形成用于指导转发的BIER-TE转发表，进而在收到BIER-TE封装的组播流量时，根据BIER-TE转发表完成流量转发。然而，通告链路信息的方式通告的报文数量会根据节点的接口数量变化而变化，在网络包括的节点数量众多或者节点之间的链路数量巨大时，通告的报文规模很大，这极大的增加了节点处理的复杂度，甚至可能会超出一些节点的处理能力，引发问题。
发明内容
本申请实施例提供一种转发表索引的通告方法，包括：
根据第一信息，确定当前节点的基于指定路径的位索引显式复制流量工程BIER-TE的转发表索引，第一信息包括子域SD和位串长度BSL；向其他节点通告当前节点的BIER-TE的转发表索引，当前节点的BIER-TE的转发表索引采用预设编码方式编码。
本申请实施例提供一种节点，包括：处理器；处理器用于在执行计算机程序时实现上述实施例的转发表索引的通告方法。
本申请实施例还提供一种计算机可读存储介质，存储有计算机程序，计算机程序被处理器执行时实现上述实施例的转发表索引的通告方法。
附图说明
图1是一实施例提供的一种网络示意图；
图2是一实施例提供的另一种网络示意图；
图3是一实施例提供的一种转发表索引的通告方法的流程示意图；
图4是一实施例提供的另一种转发表索引的通告方法的流程示意图；
图5是一实施例提供的一种BIER-TE的转发表索引的编码示意图；
图6是一实施例提供的一种BIER-TE的转发表索引的结构图；
图7是一实施例提供的一种转发表索引的通告装置；
图8是一实施例提供的另一种转发表索引的通告装置；
图9是一实施例提供的一种基站的结构示意图。
具体实施方式
此处所描述的具体实施例仅仅用以解释本申请。下文中将结合附图对本申请的实施例进行说明。
组播技术在互联网业务中发挥着越来越重要的作用，比如工作相关的诸如网络会议，娱乐相关的诸如体育赛事、演唱会等的直播，教育相关的诸如网上授课，还有医疗手术与会诊等，都应用到了组播技术。
BIER技术的核心思想，是将网络边缘的节点都只用一个比特位(BIT位)来表示，组播流量在中间网络传输，额外封装一个特定的BIER头，这个报文头以BIT位串(BitString)的形式标注了该组播流量的所有目的节点，中间节点根据BIT位进行路由，保障流量能够发送到所有目的节点。这种数据面转发技术因为没有组播树的建立问题，消除了组播树建立的时延，并且收敛速度与开放式最短路径优先(Open Shortest Path First，OSPF)协议和中间系统到中间系统(Intermediate system to intermediate system，IS-IS)协议的收敛速度相同，相比于原来的组播树重建降低了巨大的时延。
BIER-TE技术的核心思想，是将BIER报文头中BIT位串中的Bit进行转义，每个Bit位不再用于表示目的节点，而是用来表示链路。同样，报文在进入BIER网络中进行转发时，节点对这个报文的处理也跟传统的BIER方式不一样，首先，所查询的BIER-TE转发表，是形式与BIER转发表很类似，但实际上完全独立的一个转发表，该表的转发表项中每一位，标识的是一条链路，而不是节点。并且，在根据该转发表项进行转发时，只根据本节点所相连的链路BIT位进行转发和相应处理，保证报文不会回环并且能正确到达目的地。也就是说，BIER技术能够按照到达目的节点的最短路径转发组播流量；而BIER-TE技术则是使组播流量按照既定的链路进行传输，直到到达目的节点。
图1是一实施例提供的一种网络示意图。如图1所示，网络包括节点R1、 R2、R3、R4、R5、R6、R11和R12。如果有流量需要从R1发送到R2，采用BIER技术传输的话，假设R1到R2的最短路径是R1→R11→R12→R2，则流量会根据该路径传输。但假设需要传输的流量非常多，全部按照最短路径走的话，R11和R12会成为性能瓶颈。因此对于部分流量，可以采用BIER-TE技术，指定传输路径进行传输，如指定流量经过R1→R3→R4→R2的路径传输，这样可以绕开R11和R12的路径。BIER-TE技术的实现就是将R1到R3的链路，R3到R4的链路，R4到R2的链路封装到BIER-TE报文的BitString中来实现的，各节点需要知道BitString中这些链路信息所指向的链路以及对应的封装方式，才能实现BIER-TE报文的正确封装、解析和转发。
BIER-TE技术和BIER技术类似，可以通过内部协议，比如三层网络中的OSPF协议、IS-IS协议、边界网关协议(Border Gateway Protocol，BGP)、BABEL协议等，通告链路信息，形成用于指导转发的BIER-TE转发表，进而在收到BIER-TE封装的组播流量时，根据BIER-TE转发表完成流量转发。
通告链路信息的方式，通常是将用于指导转发的BIER-TE转发表索引(Forwarding Table Identifier，FT-ID)信息跟随链路BP(BitPosition)进行通告，即在通告单条链路信息时会通告表示BIER-TE链路BP的子类型-长度-值(sub-type-length-value，sub-TLV)，比如IS-IS协议中，通告单条链路信息采用Neighbor Information TLV形式，在该TLV下携带用于表示BIER-TE链路BP的sub-TLV。用于指导转发的BIER-TE转发表索引，则是作为sub-sub-TLV，跟随该链路BP的sub-TLV进行通告。
通告方式通告的报文数量会根据节点的接口数量变化而变化。如果网络很简单，并且每台节点的链路并不多时，这样的通告方式不会有太大的问题；但在实际网络中，节点的链路数量往往很庞大：比如网络包括的节点数量众多，互相之间连接复杂，这样每个节点的链路都有很多；又比如网络包括的节点数量可能并不算很多，但节点之间的链路数量巨大。图2是一实施例提供的另一种网络示意图。如图2所示，网络包括节点R1、R2、R3、R4、R5、R6、R11和R12。假设R1和R3、R3和R4、R4和R2、R1和R11、R11和R12、R12和R2、R3和R11、R4和R12之间都具有200条链路，那么R1、R2的链路超过400条，R3、R4、R11和R12的链路就超过600条。采用的通告方式，R1和R2通告的BIER-TE链路BP有400条，即使在一条链路仅有一个转发表索引也需要通告400个；相应的R3、R4、R11和R12也需要通告600个转发表索引。但实际上一条链路可以有多个转发表索引，这时通告的数量会继续上涨：比如一条链路对应10个转发表索引，则通告的数量则变成10倍。以一个转发表索引占用12字节计算，600个通告会占用7200字节，6000个通告则会占用72000字节。单个节点最高可以支持高达6万条链路，占用量则更为巨大，可达到72 万字节。即使存在多个相同索引值，也必须按照该方法进行通告。在这种情况下，通告的报文规模很大，这极大的增加了节点处理的复杂度，甚至可能会超出一些节点的处理能力，引发问题。
本申请提供的转发表索引的通告方法可以应用于基于BIER-TE技术的各种通信系统中。在本申请实施例中，提供一种转发表索引的通告方法、节点及存储介质，以降低发送的报文规模，简化节点处理的复杂度，降低网络部署的复杂度。
下面，对转发表索引的通告方法，节点及其技术效果进行描述。
图3是一实施例提供的一种转发表索引的通告方法的流程示意图，如图3所示，本实施例提供的方法适用于节点，该方法包括。
S110、根据第一信息，确定当前节点的BIER-TE的转发表索引，第一信息包括子域(Sub-Domain，SD)和位串长度(BitStringLength，BSL)。
在一实施例中，第一信息还包括集标识(Set-Identifier，SI)。
S120、向其他节点通告当前节点的BIER-TE的转发表索引，当前节点的BIER-TE的转发表索引采用预设编码方式编码。
在一实施例中，BIER-TE的转发表索引的类型为多协议标签交换(Multi Protocol Label Switching，MPLS)类型和非多协议标签交换(Non-Multi Protocol Label Switching，Non-MPLS)类型中的至少之一。
在一实施例中，预设编码方式可以为前缀可达性编码方式或者非前缀可达性编码方式。当预设编码方式为前缀可达性编码方式时，BIER-TE的转发表索引为位索引显式复制信息的sub-TLV中携带的sub-TLV，即BIER-TE的转发表索引为位索引显式复制信息的sub-sub-TLV)。当预设编码方式为非前缀可达性编码方式时，BIER-TE的转发表索引为新增的顶层Top-Level的BIER-TE-TLV中携带的sub-TLV。
在一实施例中，向其他节点通告当前节点的BIER-TE的转发表索引所采用的协议包括以下协议中的一种：IS-IS协议、OSPF协议、BGP、BABEL协议、链路层发现协议(Link Layer Discovery Protocol，LLDP)。
OSPF协议是一个内部网关协议(Interior Gateway Protocol，IGP)，用于在单一自治系统(autonomous system，AS)内决策路由。是对链路状态路由协议的一种实现，隶属内部网关协议(IGP)，故运作于自治系统内部。著名的迪克斯加算法(Dijkstra)被用来计算最短路径树。OSPF协议是一种典型的链路状态 (Link-state)的路由协议。在一个自治系统中，所有的OSPF路由器都维护一个相同的描述这个AS结构的数据库，该数据库中存放的是路由域中相应链路的状态信息，OSPF路由器正是通过这个数据库计算出其OSPF路由表的。作为一种链路状态的路由协议，OSPF将链路状态组播数据(Link State Advertisement，LSA)传送给在一区域内的所有路由器。链路是路由器接口的另一种说法，因此OSPF也称为接口状态路由协议。OSPF通过路由器之间通告网络接口的状态来建立链路状态数据库，生成最短路径树，每个OSPF路由器使用这些最短路径构造路由表。
IS-IS协议是一种内部网关协议，是电信运营商普遍采用的内部网关协议之一。标准的IS-IS协议是由国际标准化组织制定的国际标准化组织/国际电工委员会(International Organization for Standardization/International Electrotechnical Commission，ISO/IEC)10589:2002所规范的。但是标准的IS-IS协议是为无连接网络服务(CLNS)设计的，并不直接适合于互联网协议(Internet Protocol，IP)网络，因此互联网工程任务组制定了可以适用于IP网络的集成化的IS-IS协议，称为集成IS-IS，它由请求评论(Request For Comments，RFC)1195等RFC文档所规范。IS-IS属于内部网关路由协议，用于自治系统内部。IS-IS是一种链路状态协议，与传输控制协议(Transmission Control Protocol，TCP)/IP网络中的OSPF协议非常相似，使用最短路径优先算法进行路由计算。
BGP是自治系统间的路由协议。BGP交换的网络可达性信息提供了足够的信息来检测路由回路并根据性能优先和策略约束对路由进行决策。BGP交换包含全部AS path的网络可达性信息，按照配置信息执行路由策略。通常BGP与IGP协议协同作用。虽然BGP通常使用在自治系统之间，但随着网络的发展，一些场景也倾向于只使用BGP作为路由协议。
BABEL协议是一个支持互联网协议第6版(IP version 6，IPv6)和IPv4的使用矢量距离算法的路由协议，具有稳定和高效的特点，可用于有线和无线网络。与路由信息协议(Routing Information Protocol，RIP)为代表的有线网络协议相比，BABEL协议不再使用跳数来进行最优路径的选择，而是使用“期望传输跳数”(Expected Transmission Count，ETC)来计算到达一节点的跳数。ETC不仅考虑了到达一节点的跳数信息，还综合考虑了链路带宽、拥塞度等一系列指标来作为选路的依据。然而ETC会由于无线环境的变化和网络节点的加入/退出不断变化，这也就造成路由的不断翻转使得网络难以收敛。因此BABEL使用历史感知机制(History-sensitive)来加速网络的收敛，即具有相近ETC值的情况下选择曾经使用过的路径。BABEL协议在网络收敛后不会在整个网络范围内进行周期性的路由更新和宣告，只有当节点信息和状态发生变化时才会被动触发更新。
在一实施例中，若当前节点和其他节点为相邻的节点、且向其他节点通告当前节点的BIER-TE的转发表索引所采用的协议为IS-IS协议或者OSPF协议，则IS-IS协议或者OSPF协议的泛洪功能被抑制。如此，可以减少发送的报文规模。
在一实施例中，若当前节点和其他节点为相邻的节点、预设编码方式为前缀可达性编码方式、且向其他节点通告当前节点的BIER-TE的转发表索引所采用的协议为BGP或者BABEL协议，则BGP或者BABEL协议仅通告前缀信息。如此，可以减少发送的报文规模。
在一实施例中，若向其他节点通告当前节点的BIER-TE的转发表索引所采用的协议为LLDP，那么LLDP本身不跨跳传输的特性也可以减少发送的报文规模。
在上述实施例的基础上，图4是一实施例提供的另一种转发表索引的通告方法的流程示意图，如图4所示，在S110执行完毕后，该方法还包括。
S130、根据当前节点的BIER-TE的转发表索引，生成当前节点的BIER-TE的转发表。
在一实施例中，当前节点除了生成自身的BIER-TE的转发表外，还可以：接收其他节点通告的其他节点的BIER-TE的转发表索引；并将其他节点的BIER-TE的转发表索引填入当前节点的BIER-TE的转发表中。以保证后续流量的顺利转发。
S140、根据当前节点的BIER-TE的转发表转发流量。
通过上述实施例的描述可知，S110和S120是对当前节点的BIER-TE的转发表索引进行通告的操作。但是对于当前节点来说，在确定当前节点的BIER-TE的转发表索引后，当前节点就可以生成当前节点的BIER-TE的转发表。即S120和S130之间没有执行先后顺序的关系。而S140是转发流量的过程，通常，为了流量能够顺利转发，在流量转发前网络已经完成了BIER-TE的转发表索引的通告，因此，S140往往需要在步骤S120后执行。
S140中“根据当前节点的BIER-TE的转发表转发流量”的方法可以包括S1-S4：
S1：接收其他节点发送的第一报文，并获取第一报文的转发表索引。
S2：根据第一报文的转发表索引，从当前节点的BIER-TE的转发表中确定目标转发表，目标转发表与第一报文的转发表索引对应。
在一实施例中，若当前节点的BIER-TE的转发表中不包括目标转发表，则 丢弃第一报文。例如，上述S130中当前节点并未接收其他节点通告的其他节点的BIER-TE的转发表索引，无法在当前节点的BIER-TE的转发表中查找到目标转发表，第一报文被丢弃。
S3：根据目标转发表，确定下一跳节点。
S4：向下一跳节点发送第二报文，第二报文包括下一跳节点的BIER-TE的转发表索引。
第一报文和第二报文可以理解为需要转发的流量。
本申请的转发表索引的通告方法，不会因节点的接口数量变化而发生变化，因此各转发表索引仅需通告一次(更新、重通告等情况除外)，相比于背景技术中的通告方式，在接口数量庞大时，能降低发送的报文规模，简化节点处理的复杂度，降低网络部署的复杂度。
下面，罗列一些示例性实施方式，用于解释说明本申请上述实施例的转发表索引的通告方法。下述示例性实施方式可以单一执行，也可以组合执行。
在第一个示例性实施方式中，假设以图2所示的网络中的R11为例，R11与R1、R3和R12之间的链路各有200条，与R5之间的链路有1条，这些链路BP信息，仍然采用背景技术中的通告方式进行通告，但转发表索引不再跟随链路BP进行通告。
假设R11的链路，分别属于SD1到SD10，一共10个子域，仅支持一种BSL长度(如256)，则R11可根据SD1和BSL256，分配MPLS类型的转发表索引Index-x；根据SD2和BSL256，分配Non-MPLS的转发表索引Index-y；根据SD3和BSL256，分配MPLS转发表索引Index-z，以此类推，R11可根据10个子域和256的BSL长度，分配10个BIER-TE的转发表索引。在一实施例中，根据同一个SD和BSL(比如SD1和BSL256)，也可同时分配MPLS和Non-MPLS两种类型的2个BIER-TE的转发表索引。
假设R11在使用IS-IS协议进行通告时，携带了节点的Prefix Reachability通告，可通过配置指定一个Prefix，在此Prefix通告时，新增BIER-TE sub-tlv，其中包含MPLS和Non-MPLS的BIER-TE的转发表索引，如图5所示。对于BIER-TE的转发表索引结构，则参照图6所示，其中包含SD、BSL、转发表索引Index。当节点是根据SD、BSL和SI三者分配BIER-TE的转发表索引时，可以仍然采用图6类似的结构，仅需在其中再增加一个SI即可。
R11也会收到如R1、R3、R12、R5等其他节点通过IS-IS协议所通告过来的BIER-TE的转发表索引，则结合其他节点所通告的链路BP，可生成如表1、 表2所示的BIER-TE的转发表。
表1
表1所示的BIER-TE的转发表的索引值是x，意思是当前节点根据SD1、BSL256所分配的、类型为MPLS的转发表；其中对于链路Link-1，其对应的邻居是Neighbor-1，该邻居所通告的，同样是SD1、BSL256、类型为MPLS的转发表索引值为Index-1。
表2
表2所示的BIER-TE的转发表的索引值是y，意思是当前节点根据SD2、BSL256所分配的、类型为Non-MPLS的转发表；其中对于链路Link-1，其对应的邻居是Neighbor-1，该邻居所通告的，同样是SD2、BSL256、类型为Non-MPLS的转发表索引值是Index-11。
当R11收到其他节点发送过来的BIER-TE报文时，比如R11从R1收到了BIER-TE报文，根据报文的转发表索引字段定位到对应的转发表(即目标转发表)，假设定位到表1所示的SD1、BSL256、类型为MPLS的转发表后，根据查找到的邻居(即下一条节点)进行报文转发。假设需要发送给Neighbor-1和Neighbor-3，则R11将报文复制成2份，其中的转发表索引字段分别填写为Neighbor-1、Neighbor-3所通告的转发表索引值后发送给这两个节点。每个节点 的处理都采用类似的流程，从而使报文转发到目的地。
在一实施例中，除了使用IS-IS协议，还可使用其他协议如OSPF进行通告，在使用OSPF进行通告时，可在通告指定Prefix的OSPFv2 Extend Prefix TLV时，同样增加BIER-TE sub-tlv的通告，其中所携带的信息类似IS-IS。假设使用BGP或者BGP-链路状态(Link State，LS)协议进行通告时，可通过新建BIER-TE Path Attribute，跟随节点指定的Prefix进行通告，其中所携带的信息类似IS-IS。
在一实施例中，假设不能通过配置或者其他方式指定所跟随的Prefix时，可以自动选择通告Prefix里值最大或者最小的进行通告。
在第二个示例性实施方式中，假设网络中的节点并没有采用Prefix进行通告，如IS-IS协议，可能并未配置三层Prefix，无法采用如第一个示例性实施方式中跟随Prefix通告的方式。此时可以通过新增Top-Level的BIER-TE tlv方式进行通告，该tlv里包括的MPLS和Non-MPLS的BIER-TE的转发表索引类似第一个示例性实施方式的定义。
假设网络中的节点使用LLDP进行通告时，也可采用类似的方式，直接新增BIER-TE的TLV，并携带类型为MPLS和/或Non-MPLS的BIER-TE的转发表索引进行通告。
该方法同样可以通告当前节点的BIER-TE的转发表索引，以及收到其他节点所通告的其他节点的BIER-TE的转发表索引，由此实现BIER-TE转发表的正确组织，从而实现BIER-TE报文的正确处理和转发。
在上述第一个示例性实施方式中，默认情况下网络中的节点会将链路信息进行整网发送，这样网络中所有节点的链路信息，包括转发表索引信息都会整网学习到，比如R1除了能够收到R3、R5和R11的通告，也能收到R2、R4、R6和R12的通告。这种通告方式在网络中仅有一个节点通过BGP-LS协议上报这些信息给控制器时较为有用。
在第三个示例性实施方式中，仍以图2所示的网络为例，假设该网络中不需通过一台节点，经由BGP-LS技术通告BIER-TE相关信息，包括转发表索引等给控制器，那么BIER-TE的链路BP以及转发表索引，仅需要在相邻的节点之间进行通告，比如R11的各链路信息(包括转发表索引)，通告给R1、R3、R5和R12节点后，R3、R5和R12节点不需要将R11的这些信息通告给R2、R4和R6等节点。
为了实现上述功能，若当前节点和其他节点为相邻的节点、且向其他节点 通告当前节点的BIER-TE的转发表索引所采用的协议为IS-IS协议或者OSPF协议，则IS-IS协议或者OSPF协议的泛洪功能被抑制。如此，可以避免信息泛洪到非相邻的节点上，减少发送的报文规模。若当前节点和其他节点为相邻的节点、预设编码方式为前缀可达性编码方式、且向其他节点通告当前节点的BIER-TE的转发表索引所采用的协议为BGP或者BABEL协议，则BGP或者BABEL协议仅通告前缀信息。如此，无需将其携带的BIER-TE的转发表索引一并通告，可以减少发送的报文规模。若向其他节点通告当前节点的BIER-TE的转发表索引所采用的协议为LLDP，那么LLDP本身不跨跳传输的特性也可以减少发送的报文规模。
图7是一实施例提供的一种转发表索引的通告装置，该装置可以配置于节点中，如图7所示，该装置包括：确定模块10和通告模块11。
确定模块10，设置为根据第一信息，确定当前节点的基于指定路径的位索引显式复制BIER-TE的转发表索引，第一信息包括子域SD和位串长度BSL；通告模块11，设置为向其他节点通告当前节点的BIER-TE的转发表索引，当前节点的BIER-TE的转发表索引采用预设编码方式编码。
本实施例提供的转发表索引的通告装置为实现图3-4所示实施例的转发表索引的通告方法，本实施例提供的转发表索引的通告装置实现原理和技术效果与上述实施例类似，此处不再赘述。
在一实施例中，第一信息还包括集标识SI。
在一实施例中，BIER-TE的转发表索引的类型为多协议标签交换MPLS类型和非多协议标签交换Non-MPLS类型中的至少之一。
在一实施例中，预设编码方式为前缀可达性编码方式，BIER-TE的转发表索引为位索引显式复制信息的子类型-长度-值sub-TLV中携带的sub-TLV。
在一实施例中，预设编码方式为非前缀可达性编码方式，BIER-TE的转发表索引为新增的顶层Top-Level的BIER-TE-TLV中携带的sub-TLV。
在一实施例中，向其他节点通告当前节点的BIER-TE的转发表索引所采用的协议包括以下协议中的一种：中间系统到中间系统IS-IS协议、开放式最短路径优先OSPF协议、边界网关协议BGP、BABEL协议、链路层发现协议LLDP。
在一实施例中，结合图7，图8是一实施例提供的另一种转发表索引的通告装置，该装置还包括转发模块12；确定模块10，还设置为根据当前节点的BIER-TE的转发表索引，生成当前节点的BIER-TE的转发表；转发模块12，设置为根据当前节点的BIER-TE的转发表转发流量。
在一实施例中，通告模块11，还设置为接收其他节点通告的其他节点的BIER-TE的转发表索引；确定模块10，还设置为将其他节点的BIER-TE的转发表索引填入当前节点的BIER-TE的转发表中。
在一实施例中，转发模块12，是设置为接收其他节点发送的第一报文，并获取第一报文的转发表索引；根据第一报文的转发表索引，从当前节点的BIER-TE的转发表中确定目标转发表，目标转发表与第一报文的转发表索引对应；根据目标转发表，确定下一跳节点；向下一跳节点发送第二报文，第二报文包括下一跳节点的BIER-TE的转发表索引。
在一实施例中，转发模块12，还设置为当前节点的BIER-TE的转发表中不包括目标转发表，丢弃第一报文。
在一实施例中，当前节点和其他节点为相邻的节点、且向其他节点通告当前节点的BIER-TE的转发表索引所采用的协议为IS-IS协议或者OSPF协议，IS-IS协议或者OSPF协议的泛洪功能被抑制。
在一实施例中，当前节点和其他节点为相邻的节点、预设编码方式为前缀可达性编码方式、且向其他节点通告当前节点的BIER-TE的转发表索引所采用的协议为BGP或者BABEL协议，BGP或者BABEL协议仅通告前缀信息。
本申请实施例还提供了一种节点，包括：处理器，处理器用于在执行计算机程序时实现如本申请任意实施例所提供的方法。示例性的，下述实施例提供一种节点为基站的结构示意图。
图9是一实施例提供的一种基站的结构示意图，如图9所示，该基站包括处理器60、存储器61和通信接口62；基站中处理器60的数量可以是一个或多个，图9中以一个处理器60为例；基站中的处理器60、存储器61、通信接口62可以通过总线或其他方式连接，图9中以通过总线连接为例。总线表示几类总线结构中的一种或多种，包括存储器总线或者存储器控制器，外围总线，图形加速端口，处理器或者使用多种总线结构中的任意总线结构的局域总线。
存储器61作为一种计算机可读存储介质，可设置为存储软件程序、计算机可执行程序以及模块，如本申请实施例中的方法对应的程序指令/模块。处理器60通过运行存储在存储器61中的软件程序、指令以及模块，从而执行基站的至少一种功能应用以及数据处理，即实现上述的方法。
存储器61可包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据终端的使用所创建的数据等。此外，存储器61可以包括高速随机存取存储器，还可以包括非易 失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。在一些实例中，存储器61可包括相对于处理器60远程设置的存储器，这些远程存储器可以通过网络连接至基站。上述网络的实例包括但不限于互联网、企业内部网、网络、移动通信网及其组合。
通信接口62可设置为数据的接收与发送。
本申请实施例还提供了一种计算机可读存储介质，计算机可读存储介质上存储有计算机程序，该计算机程序被处理器执行时实现如本申请任意实施例所提供的方法。
本申请实施例的计算机存储介质，可以采用一个或多个计算机可读的介质的任意组合。计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质。计算机可读存储介质例如可以是但不限于：电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。计算机可读存储介质包括(非穷举的列表)：具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机存取存储器(Random Access Memory，RAM)、只读存储器(Read-Only Memory，ROM)、可擦式可编程只读存储器(Erasable Programmable Read-Only Memory，EPROM)、闪存、光纤、便携式紧凑磁盘只读存储器(Compact Disc Read-Only Memory，CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。在本申请中，计算机可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、装置或者器件使用或者与其结合使用。
计算机可读的信号介质可以包括在基带中或者作为载波一部分传播的数据信号，数据信号中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。计算机可读的信号介质还可以是计算机可读存储介质以外的任何计算机可读介质，该计算机可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。
计算机可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于无线、电线、光缆、射频(Radio Frequency，RF)等等，或者上述的任意合适的组合。
可以以一种或多种程序设计语言或多种程序设计语言组合来编写用于执行本公开操作的计算机程序代码，程序设计语言包括面向对象的程序设计语言(诸如Java、Smalltalk、C++、Ruby、Go)，还包括常规的过程式程序设计语言(诸如“C”语言或类似的程序设计语言)。程序代码可以完全地在用户计算机上执行、 部分地在用户计算机上执行、作为一个独立的软件包执行、部分在用户计算机上部分在远程计算机上执行、或者完全在远程计算机或服务器上执行。在涉及远程计算机的情形中，远程计算机可以通过任意种类的网络(包括网络(Local Area Network，LAN)或广域网(Wide Area Network，WAN))连接到用户计算机，或者，可以连接到外部计算机(例如利用因特网服务提供商来通过因特网连接)。
本领域内的技术人员应明白，术语用户终端涵盖任何适合类型的无线用户设备，例如移动电话、便携数据处理装置、便携网络浏览器或车载移动台。
一般来说，本申请的多种实施例可以在硬件或专用电路、软件、逻辑或其任何组合中实现。例如，一些方面可以被实现在硬件中，而其它方面可以被实现在可以被控制器、微处理器或其它计算装置执行的固件或软件中，尽管本申请不限于此。
本申请的实施例可以通过移动装置的数据处理器执行计算机程序指令来实现，例如在处理器实体中，或者通过硬件，或者通过软件和硬件的组合。计算机程序指令可以是汇编指令、指令集架构(Instruction Set Architecture，ISA)指令、机器指令、机器相关指令、微代码、固件指令、状态设置数据、或者以一种或多种编程语言的任意组合编写的源代码或目标代码。
本申请附图中的任何逻辑流程的框图可以表示程序步骤，或者可以表示相互连接的逻辑电路、模块和功能，或者可以表示程序步骤与逻辑电路、模块和功能的组合。计算机程序可以存储在存储器上。存储器可以具有任何适合于本地技术环境的类型并且可以使用任何适合的数据存储技术实现，例如但不限于只读存储器(ROM)、随机访问存储器(RAM)、光存储器装置和系统(数码多功能光碟DVD或CD光盘)等。计算机可读介质可以包括非瞬时性存储介质。数据处理器可以是任何适合于本地技术环境的类型，例如但不限于通用计算机、专用计算机、微处理器、数字信号处理器(Digital Signal Processing，DSP)、专用集成电路(Application Specific Integrated Circuit，ASIC)、可编程逻辑器件(Field－Programmable Gate Array，FPGA)以及基于多核处理器架构的处理器。

Claims (14)

  1. 一种转发表索引的通告方法，包括：
    根据第一信息，确定当前节点的基于指定路径的位索引显式复制流量工程BIER-TE的转发表索引，所述第一信息包括子域SD和位串长度BSL；
    向其他节点通告所述当前节点的BIER-TE的转发表索引，所述当前节点的BIER-TE的转发表索引采用预设编码方式编码。
  2. 根据权利要求1所述的方法，其中，所述第一信息还包括集标识SI。
  3. 根据权利要求1所述的方法，其中，所述BIER-TE的转发表索引的类型为多协议标签交换MPLS类型和非多协议标签交换Non-MPLS类型中的至少之一。
  4. 根据权利要求1所述的方法，其中，所述预设编码方式为前缀可达性编码方式，所述BIER-TE的转发表索引为位索引显式复制信息的子类型-长度-值sub-TLV中携带的sub-TLV。
  5. 根据权利要求1所述的方法，其中，所述预设编码方式为非前缀可达性编码方式，所述BIER-TE的转发表索引为新增的顶层Top-Level的BIER-TE-TLV中携带的sub-TLV。
  6. 根据权利要求1所述的方法，其中，所述向其他节点通告所述当前节点的BIER-TE的转发表索引所采用的协议包括以下协议中的一种：中间系统到中间系统IS-IS协议、开放式最短路径优先OSPF协议、边界网关路协议BGP、BABEL协议、链路层发现协议LLDP。
  7. 根据权利要求1所述的方法，还包括：
    根据所述当前节点的BIER-TE的转发表索引，生成所述当前节点的BIER-TE的转发表；
    根据所述当前节点的BIER-TE的转发表转发流量。
  8. 根据权利要求7所述的方法，在所述生成当前节点的BIER-TE的转发表后，还包括：
    接收其他节点通告的其他节点的BIER-TE的转发表索引；
    将所述其他节点的BIER-TE的转发表索引填入所述当前节点的BIER-TE的转发表中。
  9. 根据权利要求7所述的方法，其中，所述根据所述当前节点的BIER-TE的转发表转发流量，包括：
    接收其他节点发送的第一报文，并获取所述第一报文的转发表索引；
    根据所述第一报文的转发表索引，从所述当前节点的BIER-TE的转发表中确定目标转发表，所述目标转发表与所述第一报文的转发表索引对应；
    根据所述目标转发表，确定下一跳节点；
    向所述下一跳节点发送第二报文，所述第二报文包括所述下一跳节点的BIER-TE的转发表索引。
  10. 根据权利要求9所述的方法，还包括：
    在所述当前节点的BIER-TE的转发表中不包括所述目标转发表的情况下，丢弃所述第一报文。
  11. 根据权利要求1所述的方法，其中，所述当前节点和所述其他节点为相邻的节点、且所述向其他节点通告所述当前节点的BIER-TE的转发表索引所采用的协议为IS-IS协议或者OSPF协议，所述IS-IS协议或者所述OSPF协议的泛洪功能被抑制。
  12. 根据权利要求1所述的方法，其中，所述当前节点和所述其他节点为相邻的节点、所述预设编码方式为前缀可达性编码方式、且所述向其他节点通告所述当前节点的BIER-TE的转发表索引所采用的协议为BGP或者BABEL协议，所述BGP或者所述BABEL协议仅通告前缀信息。
  13. 一种节点，包括：处理器；所述处理器设置为在执行计算机程序时实现如权利要求1-12中任一所述的转发表索引的通告方法。
  14. 一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时实现如权利要求1-12中任一所述的转发表索引的通告方法。
PCT/CN2023/093772 2022-10-17 2023-05-12 转发表索引的通告方法、节点及存储介质 WO2024082617A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211267967.7 2022-10-17
CN202211267967.7A CN117938813A (zh) 2022-10-17 2022-10-17 一种转发表索引的通告方法、节点及存储介质

Publications (1)

Publication Number Publication Date
WO2024082617A1 true WO2024082617A1 (zh) 2024-04-25

Family

ID=90736766

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/093772 WO2024082617A1 (zh) 2022-10-17 2023-05-12 转发表索引的通告方法、节点及存储介质

Country Status (2)

Country Link
CN (1) CN117938813A (zh)
WO (1) WO2024082617A1 (zh)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109246018A (zh) * 2017-07-11 2019-01-18 中兴通讯股份有限公司 基于bier-te的报文转发方法、节点装置及存储介质
CN109660460A (zh) * 2017-10-10 2019-04-19 中兴通讯股份有限公司 Bier-te信息的处理方法、服务器及存储介质
WO2019169268A1 (en) * 2018-03-02 2019-09-06 Huawei Technologies Co.Ltd. Igp topology information and use for bier-te
US20200344162A1 (en) * 2019-04-25 2020-10-29 Nokia Solutions And Networks Oy Bier Traffic Engineering (Bier-Te) Using Unicast MPLS-TE Tunnels
CN112187647A (zh) * 2019-07-05 2021-01-05 华为技术有限公司 报文转发方法、设备及计算机可读存储介质
CN112491718A (zh) * 2020-08-31 2021-03-12 中兴通讯股份有限公司 报文头的处理方法及装置、存储介质、电子装置
CN112511319A (zh) * 2020-07-03 2021-03-16 中兴通讯股份有限公司 信息通告、报文转发、报文消除方法、装置、设备和介质

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109246018A (zh) * 2017-07-11 2019-01-18 中兴通讯股份有限公司 基于bier-te的报文转发方法、节点装置及存储介质
CN109660460A (zh) * 2017-10-10 2019-04-19 中兴通讯股份有限公司 Bier-te信息的处理方法、服务器及存储介质
WO2019169268A1 (en) * 2018-03-02 2019-09-06 Huawei Technologies Co.Ltd. Igp topology information and use for bier-te
US20200344162A1 (en) * 2019-04-25 2020-10-29 Nokia Solutions And Networks Oy Bier Traffic Engineering (Bier-Te) Using Unicast MPLS-TE Tunnels
CN112187647A (zh) * 2019-07-05 2021-01-05 华为技术有限公司 报文转发方法、设备及计算机可读存储介质
CN112511319A (zh) * 2020-07-03 2021-03-16 中兴通讯股份有限公司 信息通告、报文转发、报文消除方法、装置、设备和介质
CN112491718A (zh) * 2020-08-31 2021-03-12 中兴通讯股份有限公司 报文头的处理方法及装置、存储介质、电子装置

Also Published As

Publication number Publication date
CN117938813A (zh) 2024-04-26

Similar Documents

Publication Publication Date Title
US10616063B1 (en) Stateless multicast in IP networks
US11689452B2 (en) Method for forwarding service data, network device, and network system
US9667550B2 (en) Advertising traffic engineering information with the border gateway protocol for traffic engineered path computation
US9660897B1 (en) BGP link-state extensions for segment routing
US11362941B2 (en) Stateless multicast in label switched packet networks
CN113347091B (zh) 灵活算法感知边界网关协议前缀分段路由标识符
US11431618B2 (en) Flexible path encoding in packet switched networks
US8549176B2 (en) Propagation of routing information in RSVP-TE for inter-domain TE-LSPs
US20160006614A1 (en) Source Routing Using Path Computation Elements
EP3808041A1 (en) Flow-specific fast rerouting of source routed packets
US20170149685A1 (en) Address information publishing method and apparatus
JP2011524728A (ja) ポイントツーマルチポイントドメイン間マルチプロトコルラベルスイッチングトラフィックエンジニアリング経路計算のシステム、及び方法
WO2006065440A2 (en) Fast reroute (frr) protection at the edge of a rfc 2547 network
US10630581B2 (en) Dynamic tunnel report for path computation and traffic engineering within a computer network
WO2018010658A1 (zh) 一种位索引显式复制信息传递方法及装置
US20240007397A1 (en) Supporting stateful explicit paths
US11368564B2 (en) Packet fragmentation and reassembly
WO2024082617A1 (zh) 转发表索引的通告方法、节点及存储介质
CN112055954B (zh) 网络中优选路径路由的资源预留和维护
WO2020021558A1 (en) Methods, apparatus and machine-readable media relating to path computation in a communication network
WO2022042610A1 (zh) 信息处理方法、网络控制器、节点及计算机可读存储介质
WO2023173989A1 (zh) 转发表的生成方法及装置、存储介质、电子装置
US20230022876A1 (en) Source routing with shadow addresses
US20220174003A1 (en) A System and a Method for Routing Traffic in an MPLS Network

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23878615

Country of ref document: EP

Kind code of ref document: A1