WO2024055633A1 - 位索引路由表建立方法、网络设备及存储介质 - Google Patents

位索引路由表建立方法、网络设备及存储介质 Download PDF

Info

Publication number
WO2024055633A1
WO2024055633A1 PCT/CN2023/096864 CN2023096864W WO2024055633A1 WO 2024055633 A1 WO2024055633 A1 WO 2024055633A1 CN 2023096864 W CN2023096864 W CN 2023096864W WO 2024055633 A1 WO2024055633 A1 WO 2024055633A1
Authority
WO
WIPO (PCT)
Prior art keywords
sub
route advertisement
tlv
advertisement message
bier
Prior art date
Application number
PCT/CN2023/096864
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 WO2024055633A1 publication Critical patent/WO2024055633A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • 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/09—Mapping addresses
    • H04L61/25—Mapping addresses of the same type
    • H04L61/2503—Translation of Internet protocol [IP] addresses
    • H04L61/255—Maintenance or indexing of mapping tables

Definitions

  • the embodiments of the present application relate to but are not limited to the field of communication technology, and in particular, to a method for establishing a bit index routing table, network equipment, and storage media.
  • BIER Bit Index Explicit Replication
  • This multicast technology uses a bit string (Bit String) to send multicast messages to a set of destination nodes.
  • BS bit string
  • the network intermediate nodes do not need to establish a multicast tree and save the multicast flow status for each multicast flow (Per-flow). They only need to copy and forward based on the set of destination nodes in the message header. Therefore, this The technology can greatly reduce the protocol complexity of the intermediate network, and can easily realize the transmission of multicast traffic in the intermediate network. There is no need for the intermediate network to record any multicast traffic status, which greatly simplifies the operation and maintenance of the network.
  • IGP Interior Gateway Protocol
  • Flex-algorithm Flexible algorithm
  • SA slice aggregation
  • the overlay service is aggregated based on each slice or each slice segment identifier (Segment Identity document, SID), and is announced through the control plane.
  • SID Segment Identity document
  • Flex-algorithm technology it is all specific ways to implement slicing functions in IP (Internet Protocol)/MPLS (Multi-Protocol Label Switching) networks.
  • IP Internet Protocol
  • MPLS Multi-Protocol Label Switching
  • the embodiment of the present application provides a method, network equipment and storage medium for establishing a bit index routing table, which can be used in BIER Data is transmitted in slices across the network.
  • embodiments of the present application provide a method for establishing a bit index routing table, including: receiving a bit index to explicitly copy mapping information advertised by a bit forwarding router in a network domain, where the mapping information is used to characterize a target A mapping relationship between the identification information and the target network resource division identification; establishing a bit index routing table corresponding to the target network resource division identification according to the mapping information.
  • embodiments of the present application provide a method for establishing a bit index routing table, which includes: advertising mapping information in a bit index explicit copy network domain, so that the bit index forwarding router in the bit index explicit copy network domain is based on The mapping information establishes a bit index routing table corresponding to the target network resource division identifier, wherein the mapping information is used to represent the mapping relationship between the target identification information and the target network resource division identifier.
  • embodiments of the present application also provide a network device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the above is implemented.
  • the bit index routing table establishment method When the processor executes the computer program, the above is implemented.
  • embodiments of the present application further provide a computer-readable storage medium that stores computer-executable instructions, and the computer-executable instructions are used to execute the bit index routing table establishment method as described above.
  • embodiments of the present application further provide a computer program product, which includes a computer program or computer instructions.
  • the computer program or computer instructions are stored in a computer-readable storage medium.
  • the processor of the computer device obtains the information from the computer program or computer instructions.
  • the computer readable storage medium reads the computer program or the computer instructions, and the processor executes the computer program or the computer instructions, so that the computer device performs the bit index routing table establishing method as described above.
  • Embodiments of the present application include: first, the bit forwarding router receives the bit index and explicitly copies the mapping information advertised by the bit forwarding router in the network domain, where the mapping information is used to represent the mapping between the target identification information and the target network resource division identification. relationship, and then establishes a bit index routing table corresponding to the target network resource division identifier based on the mapping information.
  • the bit forwarding router forwards the message based on the slice granularity bit index forwarding table. Therefore, the embodiment of the present application can be used in the BIER network Transfer data in slice form.
  • Figure 1 is a flow chart of a method for establishing a bit index routing table provided by an embodiment of the present application
  • Figure 2 is a schematic diagram of a first route advertisement message provided by a specific example of this application.
  • Figure 3 is a schematic diagram of a first route advertisement message provided by another specific example of this application.
  • Figure 4 is a schematic diagram of a first route advertisement message provided by another specific example of this application.
  • Figure 5 is a flow chart of a method for establishing a bit index routing table provided by another embodiment of the present application.
  • Figure 6 is a schematic structural diagram of a network slice provided by a specific example of this application.
  • Figure 7 is a schematic structural diagram of a network device provided by an embodiment of the present application.
  • Embodiments of the present application include: first, the bit forwarding router receives the bit index and explicitly copies the mapping information advertised by the bit forwarding router in the network domain, where the mapping information is used to represent the mapping between the target identification information and the target network resource division identification. relationship, and then establishes a bit index routing table corresponding to the target network resource division identifier based on the mapping information.
  • the bit forwarding router forwards the message based on the slice granularity bit index forwarding table. Therefore, the embodiment of the present application can be used in the BIER network Transfer data in slice form.
  • Figure 1 is a flow chart of a bit index routing table establishment method provided by an embodiment of the present application.
  • the bit index routing table establishment method may include but is not limited to step S110 and step S120.
  • Step S110 Receive the bit index to explicitly copy the mapping information advertised by the bit forwarding router in the network domain, where the mapping information is used to represent the mapping relationship between the target identification information and the target network resource division identification.
  • the target identification information may include any one of a bit forwarding router identification (BFR-id), a bit index explicit replication subdomain identification, or a bit index forwarding table identification.
  • BFR-id bit forwarding router identification
  • the target identification information may include any one of the bit-indexed explicit replication subdomain identifier, the bit-index forwarding table identifier, or the bit position, Among them, the bit index forwarding table identifier (BIFT-ID) is the identifier of the bit index forwarding table (Bit Index Forwarding Table, BIFT). The bit index forwarding table identifier is used to instruct the bit forwarding router to find the corresponding BIFT to forward the BIER message.
  • the Bit Forwarding Router includes the Bit Forwarding Ingress Router (BFIR), the intermediate Bit Forwarding Router (Transit BFR) and the Bit Forwarding Egress Router (BFER). ), among which, only the bit-forwarding ingress router and the bit-forwarding egress router need to be assigned a unique bit-forwarding router identifier for identification, and the intermediate bit-forwarding router does not need to be assigned a bit-forwarding router identifier for identification.
  • the target network resource partition identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier, which is not specifically limited here.
  • Step S120 Establish a bit index routing table corresponding to the target network resource division identifier according to the mapping information.
  • the Bit Index Routing Table can also include BIER information and other information, where the BIER information includes BIER sub-domain (Sub-Domain, SD), BSL (Bit String Length, bit string length), target identification information, SI (Set Identifier, set identification) and BFR-prefix (prefix) and other information.
  • BIER subdomain can be divided into multiple subsets and identified with SI, and SI can forward the router identification and The BSL is calculated.
  • the bit string (Bit String) needs to be divided into different sets, and each set passes SI is marked.
  • the BIER subdomain needs to be divided into four sets, which are SI 0, SI 1, SI 2 and SI 3. No specific restrictions are made here.
  • the slice-based bit index routing table maps from the forwarding router ID of the bit forwarding egress router to the BFR-prefix of the bit forwarding egress router within a specific slice, and maps to the path to the bit forwarding egress router.
  • BFR-NBR Bit Forwarding Neighbor Router
  • bit index routing tables with the same SI and the same BFR-NBR in a specific slice can be integrated to obtain a slice-based bit index forwarding table, and the bit index forwarding table is used to establish the F-NBR within the slice.
  • BM Forwarding-Bit Mask, forwarding bit string mask
  • BFR-NBR BFR-NBR
  • F-BM means that when copying and sending a message to the next hop BFR-NBR, it can be reached through this BFR-NBR.
  • BIER domain edge node collection In addition, in the bit index explicit replication network domain, each bit forwarding egress router corresponds to a bit position (Bit Position). This bit position is globally unique in the BIER subdomain within a specific slice.
  • All bit forwarding egress routers The location constitutes a bit string, and the delivery and routing of BIER messages in the bit index explicitly replicated network domain depends on the bit string.
  • bit forwarding routers receive the BIER message header containing BIER information and/or target network resource division identification, they forward the BIER message based on the slice bit index forwarding table.
  • the bit forwarding router can receive the mapping information advertised by the bit index explicit copying router in the network domain, where, The mapping information is used to characterize the mapping relationship between the target identification information and the target network resource division identification, and then establishes a bit index routing table corresponding to the target network resource division identification based on the mapping information.
  • the bit forwarding router is based on the slice granularity bit index routing table. Therefore, the embodiment of the present application can transmit data in the form of slices in the BIER network.
  • the mapping information may be advertised by a bit-forwarding router in a bit-indexed explicit replication network domain through a first route advertisement message, wherein the first route advertisement message may be based on the Intermediate System to Intermediate System (ISIS) protocol
  • the route advertisement message may also be a route advertisement message based on the Open Shortest Path First (OSPF) protocol or a route advertisement message based on the Border Gateway Protocol (Border Gateway Protocol, BGP).
  • OSPF Open Shortest Path First
  • BGP Border Gateway Protocol
  • the target protocol type can be the Open Shortest Path First protocol version 2 (i.e. OSPFv2) or the Open Shortest Path First protocol version 3 (i.e. OSPFv3) , no specific restrictions are made here.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the intermediate system to intermediate system protocol, the first route advertisement message includes NRP BIER Info-Sub-TLV, and the mapping information is carried in the NRP BIER Info-Sub-TLV , And the NRP BIER Info-Sub-TLV is carried in the ISIS prefix-reachability TLV.
  • Figure 2 is a schematic diagram of a first route advertisement message, and the mapping information in this embodiment refers to the mapping relationship between the BFR-id and the target network resource partition identifier NRP-ID.
  • the field length of Type, Length, BAR, IPA and Sub-Domain-ID can be 1 byte (ie 8 bits)
  • the field length of BFR-id can be 2 bytes
  • the NRP- The field length of ID can be 4 bytes, 3 bytes or 1 byte
  • the field length of sub-sub-TLVs is variable length.
  • the meaning of each field in Figure 2 is shown in Table 1.
  • the BIER encapsulation type can be MPLS (Multi-Protocol Label Switching, multi-protocol label switching) type, non-MPLS type, or other encapsulation types.
  • the type of sub-sub-TLVs is NRP BIER Info-Sub-TLV.
  • the target The network resource partition identifier NRP-ID can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on an intermediate system to intermediate system protocol, the first route advertisement message includes a BIER Info-Sub-TLV, and the mapping information is carried in the BIER Info-Sub-TLV.
  • the mapping message refers to the mapping relationship between the BIFT ID and/or the bit forwarding router identifier and/or the bit index explicit copy subdomain identifier and the target network resource division identifier.
  • the first route advertisement message also Including NRP Sub-sub-TLV
  • the target network resource partition identification is carried in the NRP Sub-sub-TLV
  • the NRP Sub-sub-TLV is carried in the BIER Info-Sub-TLV
  • the BIFT ID and/or the forwarding router identification and/or the bit Index explicit replication subdomain identification is carried in BIER Info-Sub-TLV.
  • Figure 3 is a schematic diagram of another first route advertisement message, in which Type is to be defined (To Be Defined, TBD), and the field lengths of Type and Length can each be 2 bytes (i.e. 16bit), the field length of NRP-ID can be 4 bytes, 3 bytes or 1 byte.
  • the target network resource partition identifier NRP-ID can be a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier or a flexible algorithm identifier. any one of.
  • the slice identifier is allocated based on each BIFT-ID
  • the first route advertisement message is a route advertisement message based on the intermediate system to intermediate system protocol
  • the first route advertisement message is based on the intermediate system to intermediate system protocol.
  • a route advertisement message may include an NRP sub-sub-sub-TLV, the target network resource allocation identifier is carried in the NRP sub-sub-sub-TLV, and the NRP sub-sub-sub-TLV is carried in the sub-sub-sub- TLV, this sub-sub-sub-TLV is carried on BIER MPLS Encapsulation Extended Sub-sub-TLV, where the target network resource partition identifier NRP-ID can be a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or Any one of the flexible algorithm flags.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the intermediate system to intermediate system protocol, the first route The notification message may include NRP sub-sub-sub-TLV, the target network resource allocation identifier is carried in the NRP sub-sub-sub-TLV, and the NRP sub-sub-sub-TLV is carried in the sub-sub-sub-TLV, This sub-sub-sub-TLV is carried by IS-IS BIER non-MPLS Encapsulation Sub-sub TLV.
  • the target network resource partition identifier NRP-ID can be a slice identifier, a slice aggregation identifier, a network resource partition identifier, or a multi-topology identifier. or any one of the flexible algorithm flags.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the Open Shortest Path First Protocol, the first route advertisement message may include an NRP BIER Sub-TLV, and the mapping information is carried in the NRP BIER Sub-TLV, where , when the open shortest path first protocol is the OSPFv2 protocol, the NRP BIER Sub-TLV can be carried on the OSPFv2 Extended Prefix TLV, and when the open shortest path first protocol is the OSPFv3 protocol, the NRP BIER Sub-TLV can be carried on the Intra- Area-Prefix TLV or Inter-Area-Prefix TLV; alternatively, the first route advertisement message includes NRP Sub-TLV, mapping information is carried in NRP Sub-TLV.
  • Figure 4 is a schematic diagram of another first route advertisement message, in which Reserved is a reserved field, which is used for byte alignment; MT-ID represents a multi-topology identifier, where each BIER sub- The domain must be associated with one and only one OSPF topology identified by MT-ID; Sub-TLVs represent different BIER encapsulation types, and a BIER Sub-TLV can carry multiple different sub-sub-TLVs.
  • Table 1 The meaning of the fields is shown in Table 1.
  • the target network resource partition identifier NRP-ID may be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the Open Shortest Path First protocol, the first route advertisement message includes a BIER Sub-TLV, and the mapping information is carried in the BIER Sub-TLV.
  • the first route advertisement message includes an NRP Sub-TLV, the target network resource division identifier is carried in the NRP Sub-TLV, and the NRP Sub-TLV is carried in a BIER Sub-TLV, wherein the target network resource division identifier may be Any one of the slice identifier, slice aggregation identifier, network resource partition identifier, multi-topology identifier, or flexible algorithm identifier.
  • the first route advertisement message is a route advertisement message based on the open shortest path first protocol
  • the first route advertisement message Including NRP sub-sub-TLV
  • the target network resource division identifier is carried in the NRP sub-sub-TLV
  • the NRP sub-sub-TLV is carried in the sub-sub-TLV
  • the sub-sub-TLV is carried in the BIER MPLS Encapsulation Sub -TLV
  • the target network resource division identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the open shortest path first protocol, the first route The notification message includes NRP sub-sub-TLV.
  • the target network resource partition identifier is carried in NRP sub-sub-TLV, and the NRP sub-sub-TLV is carried in sub-sub-TLV.
  • the sub-sub-TLV is carried in OSPFv2/ OSPFv3 BIER non-MPLS Encapsulation Sub-TLV, where the target network resource division identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the Border Gateway Protocol, the first route advertisement message includes a BIER TLV, and the mapping information is carried in the BIER TLV.
  • the first route advertisement message includes an NRP Sub-TLV.
  • the target network resource partition identifier is carried in the NRP Sub-TLV.
  • the NRP Sub-TLV is carried in a BIER TLV.
  • the target network resource partition identifier may be a slice. Any one of the identifier, slice aggregation identifier, network resource partition identifier, multi-topology identifier, or flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the Border Gateway Protocol, the first route advertisement message includes NRP sub -sub-TLV, the target network resource division identifier is carried in NRP sub-sub-TLV, and NRP sub-sub-TLV is carried in sub-sub-TLV, and the sub-sub-TLV is carried in BIER MPLS Encapsulation Sub-TLV,
  • the target network resource division identifier may be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the Border Gateway Protocol, the first route advertisement message includes NRP sub-sub-TLV, the target network resource division identifier is carried in NRP sub-sub-TLV, and the NRP sub-sub-TLV is carried in sub-sub-TLV, and the sub-sub-TLV is carried in BIER non-MPLS Encapsulation sub-TLV, where the target network resource division identification can be a slice identification, a slice aggregation identification, a network resource division identification, a multi-topology identification or a flexible Any one of the algorithm identifiers.
  • the mapping information may be used by the bit-forwarding router in the bit-indexed explicit replication engineering-based network domain.
  • the announcement is made through a second route advertisement message.
  • BIER-TE can be BIET tree engineering or BIER traffic engineering;
  • the second route advertisement message can be a route advertisement message based on the intermediate system to intermediate system protocol, or it can be a route advertisement message based on the open shortest path first protocol, or It can be a routing advertisement message based on the Border Gateway Protocol.
  • the target protocol type is the Open Shortest Path First protocol type
  • the target protocol type can be the Open Shortest Path First protocol version 2 (i.e. OSPFv2) or the Open Shortest Path First protocol version 3 (i.e. OSPFv3).
  • OSPFv2 Open Shortest Path First protocol version 2
  • OSPFv3 Open Shortest Path First protocol version 3
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the intermediate system to intermediate system protocol, the second route advertisement message includes BIER-TE Info Sub-TLV, and the mapping information is carried in the BIER-TE Info Sub-TLV .
  • the second route advertisement message includes NRP sub-sub-sub-TLV, and the target network resource division identifier is carried in the NRP sub-sub-sub-TLV , and NRP sub-sub-sub-TLV is carried on sub-sub-sub-TLV, sub-sub-sub-TLV is carried on BIER-TE MPLS Encapsulation Extended Sub-sub-TLV; if the slice identifier is allocated based on each BIFT-ID , then in the BIER-non-MPLS encapsulation scenario, the second route advertisement message includes NRP sub-sub-sub-TLV, the target network resource division identifier is carried in NRP sub-
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the intermediate system to intermediate system protocol, the second route advertisement message includes BIER-TE Info Sub-TLV, and the mapping information is carried in the BIER-TE Info Sub- TLV.
  • the second route advertisement message also includes NRP sub-sub-TLV, the target network resource division identifier is carried in the NRP sub-sub-TLV, and the NRP sub-sub-TLV is carried in the BIER-TE Info Sub-TLV, where , the target network resource division identification may be any one of a slice identification, a slice aggregation identification, a network resource division identification, a multi-topology identification or a flexible algorithm identification.
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the Open Shortest Path First protocol, the second route advertisement message includes BIER-TE Sub-TLV, and the mapping information is carried in the BIER-TE Sub-TLV. If the slice identifier is allocated based on each BIFT-ID, in the BIER-MPLS encapsulation scenario, the second route advertisement message includes NRP sub-sub-TLV, and the target network resource division identifier is carried in the NRP sub-sub-TLV, NRP sub- The sub-TLV is carried on the sub-sub-TLV, and the sub-sub-TLV is carried on the BIER-TE MPLS Encapsulation Sub-TLV; if the slice identifier is allocated based on each BIFT-ID, in the BIER-non-MPLS encapsulation scenario, the The second route advertisement message includes NRP sub-sub-TLV.
  • the target network resource division identifier is carried in NRP sub-sub-TLV.
  • NRP sub-sub-TLV is carried in sub-sub-TLV.
  • Sub-sub-TLV is carried in OSPFv2/ OSPFv3 BIER-TE non-MPLS Encapsulation Sub-TLV, where the target network resource division identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the Open Shortest Path First protocol, the second route advertisement message includes BIER-TE Sub-TLV, and the mapping information is carried in the BIER-TE Sub-TLV. Specifically, the second route advertisement message also includes NRP sub-sub-sub-TLV. The target network resource division identifier is carried in the NRP sub-sub-sub-TLV.
  • the NRP sub-sub-sub-TLV is carried in the sub-sub- sub-TLV, sub-sub-sub-TLV carried on BIER-TE Sub-TLV, where the target network resource division identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the Border Gateway Protocol, the second route advertisement message includes a BIER-TE TLV, and the mapping information is carried in the BIER-TE TLV. If the slice identifier is allocated based on each BIFT-ID, in the BIER-MPLS encapsulation scenario, the second route advertisement message includes NRP sub-sub-TLV, and the target network resource division identifier is carried in the NRP sub-sub-TLV, NRP sub- The sub-TLV is carried on the sub-sub-TLV, and the sub-sub-TLV is carried on the BIER MPLS Encapsulation Sub-TLV; if the slice identifier is allocated based on each BIFT-ID, in the BIER-non-MPLS encapsulation scenario, the second route The notification message includes NRP sub-sub-TLV.
  • the target network resource division identifier is carried in NRP sub-sub-TLV.
  • NRP sub-sub-TLV is carried in sub-sub-TLV.
  • Sub-sub-TLV is carried in BIER non-MPLS.
  • Encapsulation Sub-TLV where the target network resource division identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the Border Gateway Protocol, the second route advertisement message includes a BIER-TE TLV, and the mapping information is carried in the BIER-TE TLV.
  • the second route advertisement message may also include an NRP sub-TLV, the target network resource division identification is carried in the NRP sub-TLV, and the NRP sub-TLV is carried in the BIER-TE TLV, wherein the target network resource division identification is carried in the NRP sub-TLV. It can be any one of the slice identifier, slice aggregation identifier, network resource division identifier, multi-topology identifier, or flexible algorithm identifier.
  • Figure 5 is a flow chart of a bit index routing table creation method provided by another embodiment of the present application.
  • the bit index routing table creation method may include but is not limited to step S210 and step S220.
  • Step S210 Announce the mapping information in the bit index explicit replication network domain, so that the bit forwarding router in the bit index explicit replication network domain establishes a bit index routing table corresponding to the target network resource division identifier based on the mapping information, where the mapping information Used to characterize the mapping relationship between target identification information and target network resource division identification.
  • the target identification information may include any one of a bit forwarding router identification, a bit index explicit replication subdomain identification, or a bit index forwarding table identification.
  • the target identification information may include any one of the bit-indexed explicit replication subdomain identifier, the bit-index forwarding table identifier, or the bit position, Among them, the bit index forwarding table identifier is the identifier of the bit index forwarding table, and the bit index forwarding table identifier is used to instruct the bit forwarding router to find the corresponding BIFT to forward the BIER message.
  • bit forwarding routers include bit forwarding ingress routers, intermediate bit forwarding routers and bit forwarding egress routers. Among them, in the BIER network, only bit forwarding ingress routers and bit forwarding egress routers need to be assigned unique bit forwarding router identifiers. Identification, the intermediate bit forwarding router does not need to assign a bit forwarding router identifier for identification.
  • the target network resource partition identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier, which is not specifically limited here.
  • the bit index routing table may also include BIER information and other information.
  • the BIER information includes BIER subdomain, BSL, target identification information, SI, BFR-prefix and other information.
  • the BIER subdomain may be divided into multiple subdomains. subset, and identified by SI, and SI can be calculated based on the bit forwarding router identifier and BSL. Specifically, when the BSL used in a BIER subdomain is not enough to represent the maximum value of the bit forwarding router identifier configured in the subdomain, it is required The bit string is divided into different sets, each set is identified by SI.
  • the BIER subdomain needs to be divided into four sets, which are SI 0, SI 1, SI 2 and SI 3. No specific restrictions are made here.
  • the slice-based bit index routing table is the forwarding from the bit forwarding egress router within a specific slice.
  • the router ID maps to the BFR-prefix of that bit-forwarding egress router and maps to a table of BFR-NBRs on the path to that bit-forwarding egress router. Therefore, this slice-based bit-indexed routing table describes the BFR within a specific slice. -prefix and BFR-NBR correspondence, which can be used to generate a BIER forwarding table.
  • bit index routing tables with the same SI and the same BFR-NBR in a specific slice can be integrated to obtain a slice-based bit index forwarding table, and the bit index forwarding table is used to establish the F-NBR within the slice.
  • each bit-forwarding egress router corresponds to a bit position that is globally unique in the BIER subdomain within a specific slice. The bit positions of all bit-forwarding egress routers form a bit position.
  • BIER messages are delivered and routed within slices in bit-indexed explicitly replicated network domains relying on bit strings.
  • bit forwarding routers receive the BIER message header containing BIER information and/or target network resource division identification, they forward the BIER message based on the slice bit index forwarding table.
  • the bit forwarding router can advertise mapping information in the bit index explicit copy network domain, so that the bit index explicitly copies the bit index in the network domain.
  • the forwarding router establishes a bit index routing table corresponding to the target network resource division identifier based on the mapping information.
  • the mapping information is used to characterize the mapping relationship between the target identification information and the target network resource division identifier.
  • the bit forwarding router is based on the slice granularity bit index.
  • the forwarding table is used to forward messages. Therefore, the embodiment of the present application can transmit data in the form of slices in the BIER network.
  • the mapping information may be advertised by a bit forwarding router in a bit index explicit replication network domain through a first route advertisement message, wherein the first route advertisement message may be a route advertisement based on an intermediate system to intermediate system protocol
  • the message may also be a route advertisement message based on the Open Shortest Path First Protocol or a route advertisement message based on the Border Gateway Protocol.
  • the target protocol type is the open shortest path first protocol type
  • the target protocol type can be OSPFv2 or OSPFv3, and there is no specific restriction here.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the intermediate system to intermediate system protocol, the first route advertisement message includes NRP BIER Info-Sub-TLV, and the mapping information is carried in the NRP BIER Info-Sub-TLV , and the NRP BIER Info-Sub-TLV is carried by the ISIS prefix-reachability TLV.
  • Figure 2 is a schematic diagram of a first route advertisement message, and the mapping information in this embodiment refers to the mapping relationship between the BFR-id and the target network resource partition identifier NRP-ID.
  • the field length of Type, Length, BAR, IPA and Sub-Domain-ID can be 1 byte (ie 8 bits)
  • the field length of BFR-id can be 2 bytes
  • the NRP- The field length of ID can be 4 bytes, 3 bytes or 1 byte
  • the field length of sub-sub-TLVs is variable length.
  • the meaning of each field in Figure 2 is shown in Table 1.
  • the BIER encapsulation type can be MPLS (Multi-Protocol Label Switching, multi-protocol label switching) type, non-MPLS type, or other encapsulation types.
  • the type of sub-sub-TLVs is NRP BIER Info-Sub-TLV, NRP -The ID can be any one of a slice identifier, a slice aggregation identifier, a network resource division identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on an intermediate system to intermediate system protocol, the first route advertisement message includes a BIER Info-Sub-TLV, and the mapping information is carried in the BIER Info-Sub-TLV.
  • the mapping message refers to the mapping relationship between the BIFT ID and/or the bit forwarding router identifier and/or the bit index explicit copy subdomain identifier and the target network resource division identifier.
  • the first route advertisement message also Including NRP Sub-sub-TLV
  • the target network resource division identification is carried in the NRP Sub-sub-TLV
  • the NRP Sub-sub-TLV is carried in the BIER Info-Sub-TLV
  • the index explicit replication subdomain identifier is carried in the BIER Info-Sub-TLV.
  • Figure 3 is a schematic diagram of another first route advertisement message, in which Type is to be defined (To Be Defined, TBD), the field length of Type and Length can be 2 bytes (ie 16 bits), and the field length of NRP-ID can be 4 bytes, 3 bytes or 1 byte.
  • the target network resource partition identifier NRP-ID can be a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier or a flexible algorithm identifier. any one of.
  • the slice identifier is allocated based on each BIFT-ID
  • the first route advertisement message is a route advertisement message based on the intermediate system to intermediate system protocol
  • the first route advertisement message is based on the intermediate system to intermediate system protocol.
  • a route advertisement message may include an NRP sub-sub-sub-TLV, the target network resource allocation identifier is carried in the NRP sub-sub-sub-TLV, and the NRP sub-sub-sub-TLV is carried in the sub-sub-sub- TLV, this sub-sub-sub-TLV is carried on BIER MPLS Encapsulation Extended Sub-sub-TLV, where the target network resource partition identifier NRP-ID can be a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or Any one of the flexible algorithm flags.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the intermediate system to intermediate system protocol, then the first The route advertisement message may include NRP sub-sub-sub-TLV, the target network resource partition identifier is carried in the NRP sub-sub-sub-TLV, and the NRP sub-sub-sub-TLV is carried in the sub-sub-sub-TLV , this sub-sub-sub-TLV is carried on IS-IS BIER non-MPLS Encapsulation Sub-sub TLV, where the target network resource partition identifier NRP-ID can be a slice identifier, a slice aggregation identifier, a network resource partition identifier, or a multi-topology identifier. Either the identifier or the flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the Open Shortest Path First Protocol, the first route advertisement message may include NRP BIER Sub-TLV, and the mapping information is carried in the NRP BIER Sub-TLV, where , when the open shortest path first protocol is OSPFv2 protocol, the NRP BIER Sub-TLV can be carried on the OSPFv2 Extended Prefix TLV, and when the open shortest path first protocol is OSPFv3 protocol, the NRP BIER Sub-TLV can be carried on the Intra- Area-Prefix TLV or Inter-Area-Prefix TLV; or, the first route advertisement message includes NRP Sub-TLV, and the mapping information is carried in NRP Sub-TLV.
  • Figure 4 is a schematic diagram of another first route advertisement message, in which Reserved is a reserved field, which is used for byte alignment; MT-ID represents a multi-topology identifier, where each BIER sub- The domain must be associated with one and only one OSPF topology identified by MT-ID; Sub-TLVs represent different BIER encapsulation types, and a BIER Sub-TLV can carry multiple different sub-sub-TLVs.
  • Table 1 The meaning of the fields is shown in Table 1.
  • the target network resource partition identifier NRP-ID may be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the Open Shortest Path First protocol, the first route advertisement message includes a BIER Sub-TLV, and the mapping information is carried in the BIER Sub-TLV.
  • the first route advertisement message includes an NRP Sub-TLV, the target network resource division identifier is carried in the NRP Sub-TLV, and the NRP Sub-TLV is carried in a BIER Sub-TLV, wherein the target network resource division identifier may be Any one of the slice identifier, slice aggregation identifier, network resource partition identifier, multi-topology identifier, or flexible algorithm identifier.
  • the first route advertisement message is a route advertisement message based on the open shortest path first protocol
  • the first route advertisement message Including NRP sub-sub-TLV
  • the target network resource partition identifier is carried in the NRP sub-sub-TLV
  • the NRP sub-sub-TLV is carried in the sub-sub-TLV
  • the sub-sub-TLV is carried in the BIER MPLS Encapsulation Sub -TLV
  • the target network resource division identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the open shortest path first protocol, the first route The notification message includes NRP sub-sub-TLV.
  • the target network resource partition identifier is carried in NRP sub-sub-TLV, and the NRP sub-sub-TLV is carried in sub-sub-TLV.
  • the sub-sub-TLV is carried in OSPFv2/ OSPFv3 BIER non-MPLS Encapsulation Sub-TLV, where the target network resource division identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the first routing announcement message when the first routing announcement message is a routing announcement message based on the Border Gateway Protocol, the first routing announcement message includes a BIER TLV, and the mapping information is carried in the BIER TLV.
  • the first routing announcement message includes a target network resource partition identifier and an NRP Sub-TLV, the target network resource partition identifier is carried in the NRP Sub-TLV, and the NRP Sub-TLV is carried in the BIER TLV, wherein the target network resource partition identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the Border Gateway Protocol, the first route advertisement message includes NRP sub -sub-TLV, the target network resource division identifier is carried in NRP sub-sub-TLV, and NRP sub-sub-TLV is carried in sub-sub-TLV, and the sub-sub-TLV is carried in BIER MPLS Encapsulation Sub-TLV,
  • the target network resource division identifier may be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the first route advertisement message when the first route advertisement message is a route advertisement message based on the Border Gateway Protocol, the first route advertisement message includes NRP sub-sub-TLV, the target network resource division identifier is carried in NRP sub-sub-TLV, and the NRP sub-sub-TLV is carried in sub-sub-TLV, and sub-sub-TLV is carried in BIER non-MPLS Encapsulation sub-TLV, where the target network resource partition identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the mapping information may be used by the bit-forwarding router in the bit-indexed explicit replication engineering-based network domain.
  • the announcement is made through a second route advertisement message.
  • BIER-TE can be BIET tree engineering or BIER traffic engineering
  • the second route advertisement message can be a route advertisement message based on the intermediate system to intermediate system protocol, or it can be a route advertisement message based on the open shortest path first protocol, or It can be a route advertisement message based on the Border Gateway Protocol.
  • the target protocol type is the open shortest path first protocol type
  • the target protocol type can be OSPFv2 or OSPFv3, and there is no specific restriction here.
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the intermediate system to intermediate system protocol, the second route advertisement message includes BIER-TE Info Sub-TLV, and the mapping information is carried in the BIER-TE Info Sub-TLV .
  • the second route advertisement message includes NRP sub-sub-sub-TLV, and the target network resource division identifier is carried in the NRP sub-sub-sub-TLV , and NRP sub-sub-sub-TLV is carried on sub-sub-sub-TLV, sub-sub-sub-TLV is carried on BIER-TE MPLS Encapsulation Extended Sub-sub-TLV; if the slice identifier is allocated based on each BIFT-ID , then in the BIER-non-MPLS encapsulation scenario, the second route advertisement message includes NRP sub-sub-sub-TLV, and the target network resource division identifier is carried in the NRP
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the intermediate system to intermediate system protocol, the second route advertisement message includes BIER-TE Info Sub-TLV, and the mapping information is carried in the BIER-TE Info Sub- TLV. Moreover, the second route advertisement message also includes the NRP sub-sub-TLV and the target network resource partition identifier. The target network resource partition identifier is carried in the NRP sub-sub-TLV, and the NRP sub-sub-TLV is carried in the BIER-TE.
  • the target network resource division identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the Open Shortest Path First protocol, the second route advertisement message includes BIER-TE Sub-TLV, and the mapping information is carried in the BIER-TE Sub-TLV. If the slice identifier is allocated based on each BIFT-ID, in the BIER-MPLS encapsulation scenario, the second route advertisement message includes NRP sub-sub-TLV, and the target network resource division identifier is carried in the NRP sub-sub-TLV, NRP sub- The sub-TLV is carried on the sub-sub-TLV, and the sub-sub-TLV is carried on the BIER-TE MPLS Encapsulation Sub-TLV; if the slice identifier is allocated based on each BIFT-ID, in the BIER-non-MPLS encapsulation scenario, the The second route advertisement message includes NRP sub-sub-TLV.
  • the target network resource division identifier is carried in NRP sub-sub-TLV.
  • NRP sub-sub-TLV is carried in sub-sub-TLV.
  • Sub-sub-TLV is carried in OSPFv2/ OSPFv3 BIER-TE non-MPLS Encapsulation Sub-TLV, where the target network resource division identifier can be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the Open Shortest Path First protocol, the second route advertisement message includes BIER-TE Sub-TLV, and the mapping information is carried in the BIER-TE Sub-TLV.
  • the second route advertisement message also includes the NRP sub-sub-sub-TLV and the target network resource partition identifier.
  • the target network resource partition identifier is carried in the NRP sub-sub-sub-TLV, and the NRP sub-sub-sub-TLV Carried on sub-sub-sub-TLV, sub-sub-sub-TLV is carried on BIER-TE Sub-TLV.
  • the target network resource division identifier can be a slice identifier, a slice aggregation identifier, a network resource partition identifier, or a multi-topology identifier. Either the identifier or the flexible algorithm identifier.
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the Border Gateway Protocol, the second route advertisement message includes a BIER-TE TLV, and the mapping information is carried in the BIER-TE TLV. If the slice identifier is allocated based on each BIFT-ID, in the BIER-MPLS encapsulation scenario, the second route advertisement message includes NRP sub-sub-TLV, and the target network resource division identifier is carried in the NRP sub-sub-TLV, NRP sub-sub -TLV is carried on sub-sub-TLV, and the sub-sub-TLV is carried on BIER MPLS Encapsulation Sub-TLV; if the slice identifier is allocated based on each BIFT-ID, in the BIER-non-MPLS encapsulation scenario, the second route advertisement message Including NRP sub-sub-TLV, the target network resource division identifier is carried in NRP sub-sub-TLV, NRP sub-sub-TLV is carried in sub-sub-TLV,
  • the second route advertisement message when the second route advertisement message is a route advertisement message based on the Border Gateway Protocol, the second route advertisement message includes a BIER-TE TLV, and the mapping information is carried in the BIER-TE TLV.
  • the second route advertisement message may also include an NRP sub-TLV and a target network resource partition identifier.
  • the target network resource partition identifier is carried in the NRP sub-TLV, and the NRP sub-TLV is carried in the BIER-TE TLV, where,
  • the target network resource division identifier may be any one of a slice identifier, a slice aggregation identifier, a network resource partition identifier, a multi-topology identifier, or a flexible algorithm identifier.
  • the target identification information is used as the forwarding router identification as an example.
  • different bit forwarding routers advertise the mapping information between the bit forwarding router identifier and the flexible algorithm identifier through the first route advertisement message in the bit index explicit replication network domain.
  • the mapping information Establish a bit index routing table corresponding to the target network resource division identifier. Prior to this, each bit-forwarding egress router needed to assign a bit-forwarding router ID to a different Flex-algorithm plane.
  • the network connected to the bit forwarding routers gBFR1, gBFR2, gBFR3, and gBFR4 is divided into the first Flex-algorithm plane
  • the network connected to rBFR1, rBFR2, rBFR3, and rBFR4 is divided into the second Flex-algorithm plane.
  • the forwarding egress router BFER assigns the first forwarding router identifier 0001 to the first Flex-algorithm plane, and assigns the second forwarding router identifier 0010 to the second Flex-algorithm plane, thereby achieving topology and resource isolation.
  • the first route advertisement message may be a route advertisement message based on the intermediate system to intermediate system protocol, or it may be a route advertisement message based on the open shortest path first protocol, or it may be a route advertisement message based on the border gateway protocol.
  • the first route advertisement message includes the target network resource division identification, and the target network resource division identification is a flexible algorithm identification, and the flexible algorithm identification only requires 1 byte. .
  • the target identification information is a bit index explicit copy subdomain identifier or a bit index forwarding table identifier (BIFT-ID) as an example, wherein the bit index explicit copy subdomain identifier can be a bit index explicit copy subdomain identifier.
  • Label forwarding identifier BIER-MPLS label.
  • BIER-MPLS networks BIFT-ID can also be called BIER-MPLS label.
  • Non-BIER-MPLS networks use BIFT-ID.
  • different bit forwarding routers advertise the BIFT-ID and flexible algorithm identification mapping information through the first route advertisement message in the bit index explicit copy network domain, and establish and The bit index routing table corresponding to the target network resource division identifier.
  • each bit forwarding egress router assigned different BIER-MPLS labels or BIFT-IDs to different Flex-algorithm planes.
  • the network connected to the bit forwarding routers gBFR1, gBFR2, gBFR3, and gBFR4 is divided into the first Flex-algorithm plane
  • the network connected to rBFR1, rBFR2, rBFR3, and rBFR4 is divided into the second Flex-algorithm plane.
  • the bit forwarding egress router assigns label 1 or BIFT-ID1 to the first Flex-algorithm plane, and assigns label 2 or BIFT-ID2 to the second Flex-algorithm plane, thereby achieving topology and resource isolation.
  • BIER supports MPLS encapsulation and non-MPLS encapsulation.
  • the first route advertisement message may be a route advertisement message based on the intermediate system to intermediate system protocol, or it may be a route advertisement message based on the open shortest path first protocol, or it may be a route advertisement based on the border gateway protocol. Message, no specific restrictions are made here.
  • the first route advertisement message includes the target network resource division identification, and the target network resource division identification is a flexible algorithm identification, and the flexible algorithm identification only requires 1 byte. .
  • the target identification information is a bit-indexed explicit copy sub-domain identifier or a bit-index forwarding table identifier (ie, BIFT-ID) as an example.
  • the bit-index explicit copy sub-domain identifier may be a bit-index explicit copy sub-domain identifier.
  • Copy label forwarding identifier BIER-MPLS label.
  • BIFT-ID can also be called BIER-MPLS label.
  • different bit forwarding routers advertise BIFT-ID and NRP-ID through the first route advertisement message in the bit index explicit replication based on engineering (ie BIER-TE) network domain.
  • Mapping information establish a bit index routing table corresponding to the target network resource division identifier based on the mapping information. Prior to this, each bit-forwarding router was not Different slices are assigned different BIER-MPLS labels or BIFT-IDs. For example, as shown in Figure 6, the network connected to the bit forwarding routers gBFR1, gBFR2, gBFR3, and gBFR4 is classified as an NRP-ID1 network, and the network connected to rBFR1, rBFR2, rBFR3, and rBFR4 is classified as an NRP-ID2 network. , the bit forwarding router assigns label 1 or BIFT-ID1 to the first slice, and assigns label 2 or BIFT-ID2 to the second slice, thereby achieving topology and resource isolation.
  • the first route advertisement message may be a route advertisement message based on the intermediate system to intermediate system protocol, or it may be a route advertisement message based on the open shortest path first protocol, or it may be a route advertisement based on the border gateway protocol. Message, no specific restrictions are made here.
  • the first route advertisement message includes a target network resource partition identifier, and the target network resource partition identifier is a slice aggregation identifier.
  • the target identification information is an explicitly copied bit position (ie, Bit Position) based on a bit index.
  • Bit Position an explicitly copied bit position
  • different bit forwarding routers advertise mapping information through the first route advertisement message in the bit index explicit replication based on engineering (ie BIER-TE) network domain, and establish based on the mapping information.
  • a bit-indexed routing table corresponding to the target network resource partition identifier. Previously, each bit-forwarding router assigned different bit positions to different slices.
  • the network where the bit forwarding routers gBFR1, gBFR2, gBFR3, and gBFR4 are located is divided into an NRP-ID1 network
  • the network where rBFR1, rBFR2, rBFR3, and rBFR4 are located is divided into an NRP-ID2 network.
  • the bit forwarding routers are The first slice is assigned Bit Position 1, and the second slice is assigned Bit Position 2, thereby achieving topology and resource isolation.
  • the first route advertisement message may be a route advertisement message based on the intermediate system to intermediate system protocol, or it may be a route advertisement message based on the open shortest path first protocol, or it may be a route advertisement based on the border gateway protocol. Message, no specific restrictions are made here.
  • the first route advertisement message includes a target network resource partition identifier, and the target network resource partition identifier is a slice aggregation identifier.
  • the network device 200 includes a memory 202 , a processor 201 , and a computer program stored on the memory 202 and executable on the processor 201 .
  • the processor 201 and the memory 202 may be connected through a bus or other means.
  • the memory 202 can be used to store non-transitory software programs and non-transitory computer executable programs.
  • the memory 202 may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid-state storage device.
  • the memory 202 optionally includes memory located remotely relative to the processor 201, and these remote memories may be connected to the processor 201 through a network. Examples of the above-mentioned networks include but are not limited to the Internet, intranets, local area networks, mobile communication networks and combinations thereof.
  • the non-transitory software programs and instructions required to implement the bit index routing table establishment method in the above embodiment are stored in the memory 202.
  • the bit index routing table establishment method in the above embodiment is executed, for example, The above-described method steps S110 to S120 in FIG. 1 and method step S210 in FIG. 5 are performed.
  • the device embodiments described above are only illustrative, and the units described as separate components may or may not be physically separate, that is, they may be located in one place, or they may be distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
  • one embodiment of the present application also provides a computer-readable storage medium that stores computer-executable instructions, and the computer-executable instructions are executed by a processor or controller, for example, executing the above Method steps S110 to S120 in FIG. 1 and method step S210 in FIG. 5 are described.
  • an embodiment of the present application also provides a computer program product, including a computer program or computer instructions.
  • the computer program or computer instructions are stored in a computer-readable storage medium.
  • the processor of the computer device reads the computer program from the computer-readable storage medium. Get the computer program or computer instructions, and the processor executes the computer program or computer instructions, so that the computer device performs the bit index routing table establishment method in the above embodiment, for example, performs the above-described method steps S110 to S120 in Figure 1 and Figure 5 Method step S210 in .
  • Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disk (DVD) or other optical disk storage, magnetic cassettes, tapes, disk storage or other magnetic storage devices, or may Any other medium used to store the desired information and that can be accessed by a computer.
  • communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media .

Landscapes

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

Abstract

本申请提供一种位索引路由表建立方法、网络设备及存储介质，该方法包括：接收位索引显式复制网络域中的位转发路由器所通告的映射信息，其中，映射信息用于表征目标标识信息与目标网络资源划分标识之间的映射关系；根据映射信息建立与目标网络资源划分标识对应的位索引路由表，其中，位转发路由器基于切片粒度的位索引转发表来转发报文。

Description

位索引路由表建立方法、网络设备及存储介质
相关申请的交叉引用
本申请基于申请号为202211122862.2、申请日为2022年9月15日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请实施例涉及但不限于通信技术领域，尤其涉及一种位索引路由表建立方法、网络设备及存储介质。
背景技术
网络通信中，BIER(Bit Index Explicit Replication，位索引显式复制)技术是一种新的组播技术，该组播技术通过将组播报文要发送到目的节点的集合以位串(Bit String，BS)的方式封装在报文头部发送。在BIER域中，网络中间节点无需为每一个组播流(Per-flow)建立组播树及保存组播流状态，仅需根据报文头部的目的节点的集合进行复制转发，因此，该技术能极大地减轻中间网络的协议复杂度，而且能够非常容易地实现组播流量在中间网络中的传输，无需中间网络记录任何的组播流量状态，极大地简化了网络的运维。
目前，相关技术中，提出了多种5G承载网切片技术，比如，IGP(Interior Gateway Protocol，内部网关协仪)多拓扑技术，将同一张物理网络拓扑划分成多张逻辑子拓扑，将不同的上层(overlay)业务归属至不同的逻辑子拓扑；或者，采用IGP灵活算法(Flex-algorithm)技术，在同一拓扑内运行多种IGP算法计算得到多种Flex-algorithm平面，将不同的overlay业务迭代到不同的Flex-algorithm平面；或者，采用切片聚合(SA)技术，即底层拓扑可以是物理拓扑、Flex-algorithm或者多拓扑，将同一张物理网络拓扑或者逻辑拓扑划分成多张逻辑子拓扑，将overlay业务基于每个切片聚合或者每个切片分段标识(Segment Identity document，SID)，通过控制面通告出去。但是，无论是多拓扑技术、Flex-algorithm技术还是SA技术均是IP(Internet Protocol，网际互连协议)/MPLS(Multi-Protocol Label Switching，多协议标签交换)网络中实现切片功能的具体方式。而在BIER网络中，以切片形式传输数据的方案还不完善，比如，即便为每个Flex-algorithm分配一个BFR-ID(Bit Forwarding Router-Identity Document，位转发路由器标识)，或者为每个网络切片分配一个BIRT-ID(Bit Index Routing Table-Identity Document，位索引路由表标识)，但是在转发数据时位转发路由器仍无法找到特定切片内的下一跳信息，从而无法传输数据。另外，针对BIER-TE(Bit Index Explicit Replication-Traffic Engineering，基于工程的位索引显式复制)网络，迄今为止还没有关于如何以切片形式传输数据的研究。
发明内容
本申请实施例提供了一种位索引路由表建立方法、网络设备及存储介质，能够在BIER 网络中以切片形式传输数据。
第一方面，本申请实施例提供了一种位索引路由表建立方法，包括：接收位索引显式复制网络域中的位转发路由器所通告的映射信息，其中，所述映射信息用于表征目标标识信息与目标网络资源划分标识之间的映射关系；根据所述映射信息建立与所述目标网络资源划分标识对应的位索引路由表。
第二方面，本申请实施例提供了一种位索引路由表建立方法，包括：在位索引显式复制网络域中通告映射信息，使得所述位索引显式复制网络域中的位转发路由器根据映射信息建立与目标网络资源划分标识对应的位索引路由表，其中，所述映射信息用于表征目标标识信息与所述目标网络资源划分标识之间的映射关系。
第三方面，本申请实施例还提供了一种网络设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如上所述的位索引路由表建立方法。
第四方面，本申请实施例还提供了一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行如上所述的位索引路由表建立方法。
第五方面，本申请实施例还提供了一种计算机程序产品，包括计算机程序或计算机指令，所述计算机程序或所述计算机指令存储在计算机可读存储介质中，计算机设备的处理器从所述计算机可读存储介质读取所述计算机程序或所述计算机指令，所述处理器执行所述计算机程序或所述计算机指令，使得所述计算机设备执行如上所述的位索引路由表建立方法。
本申请实施例包括：首先位转发路由器接收位索引显式复制网络域中的位转发路由器所通告的映射信息，其中，该映射信息用于表征目标标识信息与目标网络资源划分标识之间的映射关系，然后根据映射信息建立与目标网络资源划分标识对应的位索引路由表，其中，位转发路由器基于切片粒度的位索引转发表来转发报文，因此，本申请实施例能够在BIER网络中以切片形式传输数据。
附图说明
图1是本申请一个实施例提供的位索引路由表建立方法的流程图；
图2是本申请一个具体示例提供的第一路由通告消息的示意图；
图3是本申请另一个具体示例提供的第一路由通告消息的示意图；
图4是本申请另一个具体示例提供的第一路由通告消息的示意图；
图5是本申请另一个实施例提供的位索引路由表建立方法的流程图；
图6是本申请一个具体示例提供的网络切片的结构示意图；
图7是本申请一个实施例提供的网络设备的结构示意图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本申请，并不用于限定本申请。
需要说明的是，虽然在流程图中示出了逻辑顺序，但是在某些情况下，可以以不同于流程图中的顺序执行所示出或描述的步骤。说明书和权利要求书及上述附图的描述中，多个(或 多项)的含义是两个以上，大于、小于、超过等理解为不包括本数，以上、以下、以内等理解为包括本数。如果有描述到“第一”、“第二”等只是用于区分技术特征为目的，而不能理解为指示或暗示相对重要性或者隐含指明所指示的技术特征的数量或者隐含指明所指示的技术特征的先后关系。
本申请实施例包括：首先位转发路由器接收位索引显式复制网络域中的位转发路由器所通告的映射信息，其中，该映射信息用于表征目标标识信息与目标网络资源划分标识之间的映射关系，然后根据映射信息建立与目标网络资源划分标识对应的位索引路由表，其中，位转发路由器基于切片粒度的位索引转发表来转发报文，因此，本申请实施例能够在BIER网络中以切片形式传输数据。
下面结合附图，对本申请实施例作进一步阐述。
参照图1，图1是本申请一个实施例提供的位索引路由表建立方法的流程图，该位索引路由表建立方法可以包括但不限于步骤S110和步骤S120。
步骤S110：接收位索引显式复制网络域中的位转发路由器所通告的映射信息，其中，映射信息用于表征目标标识信息与目标网络资源划分标识之间的映射关系。
一可行的实施方式，目标标识信息可以包括位转发路由器标识(BFR-id)、位索引显式复制子域标识或者位索引转发表标识中的任意之一。当位索引显式复制网络域为基于工程的位索引显式复制网络域时，该目标标识信息可以包括位索引显式复制子域标识、位索引转发表标识或者比特位置中的任意之一，其中，位索引转发表标识(BIFT-ID)为位索引转发表(Bit Index Forwarding Table，BIFT)的标识，该位索引转发表标识用于指示位转发路由器查找对应的BIFT以转发BIER报文。
可以理解的是，位转发路由器(Bit Forwarding Router，BFR)包括位转发入口路由器(Bit Forwarding Ingress Router，BFIR)、中间位转发路由器(即Transit BFR)和位转发出口路由器(Bit Forwarding Egress Router，BFER)，其中，只有位转发入口路由器和位转发出口路由器需要分配唯一的位转发路由器标识进行标识，中间位转发路由器无需分配位转发路由器标识进行标识。
一可行的实施方式，目标网络资源划分标识可以为切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意一个，在此不作具体限制。
步骤S120：根据映射信息建立与目标网络资源划分标识对应的位索引路由表。
一可行的实施方式，位索引路由表(Bit Index Routing Table，BIRT)还可以包括BIER信息以及其他信息，其中，BIER信息包括BIER子域(Sub-Domain，SD)、BSL(Bit String Length，位串长度)、目标标识信息、SI(Set Identifier，集合标识)以及BFR-prefix(前缀)等信息，其中，BIER子域可以划分多个子集，并用SI标识，而SI可以根据位转发路由器标识和BSL计算得出，具体地，当一个BIER子域内使用的BSL不足以表示该子域内配置的位转发路由器标识的最大值时，需要将位串(Bit String)分成不同的集合，每个集合通过SI进行标识。比如，假设BIER子域内位转发路由器标识的最大值为1024，若BSL设置为256，则需要将BIER子域分为四个集合，该集合分别为SI 0，SI 1、SI 2和SI 3，在此不作具体限制。
可以理解的是，基于切片的位索引路由表是在特定切片内从位转发出口路由器的转发路由器标识映射到该位转发出口路由器的BFR-prefix，并映射到到达该位转发出口路由器的路 径上的BFR-NBR(BFR-Neighbor，位转发邻居路由器)的表，因此，该基于切片的位索引路由表描述了特定切片内的BFR-prefix以及BFR-NBR的对应关系，其可以用于指导BIER报文在BIER在特定切片内的子域内转发。
在一实施例中，可以将特定切片内的具有相同SI和相同BFR-NBR的位索引路由表可以进行整合，得到基于切片的位索引转发表，并利用位索引转发表建立切片内的F-BM(Forwarding-Bit Mask，转发位串掩码)与BFR-NBR之间的映射关系，其中，F-BM表示往下一跳BFR-NBR复制发送报文时，通过该BFR-NBR能到达的BIER域边缘节点集合。另外，在位索引显式复制网络域中，每个位转发出口路由器对应一个比特位置(Bit Position)，该比特位置在特定切片内的BIER子域中全局唯一，所有的位转发出口路由器的比特位置组成一个位串，BIER报文在位索引显式复制网络域中的传递和路由依赖于位串。当其他的位转发路由器收到了包含有BIER信息和/或目标网络资源划分标识的BIER报文头时，基于切片的位索引转发表对BIER报文进行转发。
本实施例中，通过采用包括有上述步骤S110至步骤S120的位索引路由表建立方法，首先，位转发路由器可以接收位索引显式复制网络域中的位转发路由器所通告的映射信息，其中，映射信息用于表征目标标识信息与目标网络资源划分标识之间的映射关系，然后根据映射信息建立与目标网络资源划分标识对应的位索引路由表，其中，位转发路由器基于切片粒度的位索引转发表来转发报文，因此，本申请实施例能够在BIER网络中以切片形式传输数据。
在一实施例中，映射信息可以由位转发路由器在位索引显式复制网络域中通过第一路由通告消息进行通告，其中，第一路由通告消息可以是基于中间系统到中间系统(ISIS)协议的路由通告消息，也可以是基于开放式最短路径优先(OSPF)协议的路由通告消息，还可以是基于边界网关协议(Border Gateway Protocol，BGP)的路由通告消息。当目标协议类型为开放式最短路径优先(OSPF)协议类型时，目标协议类型可以是开放式最短路径优先协议版本2(即OSPFv2)，也可以是开放式最短路径优先协议版本3(即OSPFv3)，在此不做具体限制。
表1
在一实施例中，当第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，第一路由通告消息包括NRP BIER Info-Sub-TLV，映射信息携带于NRP BIER Info-Sub-TLV， 且该NRP BIER Info-Sub-TLV承载于ISIS prefix-reachability TLV。例如，如图2所示，图2为一种第一路由通告消息的示意图，并且本实施例中的映射信息指的是BFR-id与目标网络资源划分标识NRP-ID的映射关系。其中，Type、Length、BAR、IPA以及Sub-Domain-ID(子域标识)的字段长度均可以为1个字节(即8bit)，BFR-id的字段长度可以是2个字节，NRP-ID的字段长度可以为4个字节、3个字节或者1个字节，sub-sub-TLVs的字段长度为可变长度，此外，图2中各个字段的字段含义如表1所示，其中，BIER封装类型可以是MPLS(Multi-Protocol Label Switching，多协议标签交换)类型、非MPLS类型，也可以是其他封装类型，sub-sub-TLVs的类型为NRP BIER Info-Sub-TLV，目标网络资源划分标识NRP-ID可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，当第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，第一路由通告消息包括BIER Info-Sub-TLV，映射信息携带于BIER Info-Sub-TLV。具体地，在本实施例中，映射消息指的是BIFT ID和/或位转发路由器标识和/或位索引显式复制子域标识与目标网络资源划分标识的映射关系，第一路由通告消息还包括NRP Sub-sub-TLV，目标网络资源划分标识携带于NRP Sub-sub-TLV，NRP Sub-sub-TLV承载于BIER Info-Sub-TLV，BIFT ID和/或位转发路由器标识和/或位索引显式复制子域标识携带在BIER Info-Sub-TLV中。例如，如图3所示，图3为另一种第一路由通告消息的示意图，其中，Type待定义(To Be Defined，TBD)，Type和Length的字段长度均可以为2个字节(即16bit)，NRP-ID的字段长度可以为4个字节、3个字节或者1个字节。此外，Type、Length以及NRP-ID的字段含义如表1所示，其中，目标网络资源划分标识NRP-ID可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
基于上述实施例，在一实施例中，若基于每BIFT-ID分配切片标识，则在BIER-MPLS封装场景下，当第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，第一路由通告消息可以包括NRP sub-sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-sub-TLV，且该NRP sub-sub-sub-TLV承载于sub-sub-sub-TLV，该sub-sub-sub-TLV承载于BIER MPLS Encapsulation Extended Sub-sub-TLV，其中，目标网络资源划分标识NRP-ID可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，以基于每BIFT-ID分配切片标识为例，在BIER-非MPLS封装场景下，当第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，第一路由通告消息可以包括NRP sub-sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-sub-TLV，且该NRP sub-sub-sub-TLV承载于sub-sub-sub-TLV，该sub-sub-sub-TLV承载于IS-IS BIER non-MPLS Encapsulation Sub-sub TLV，其中，目标网络资源划分标识NRP-ID可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，当第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，第一路由通告消息可以包括NRP BIER Sub-TLV，且映射信息携带于NRP BIER Sub-TLV，其中，当开放式最短路径优先协议为OSPFv2协议时，该NRP BIER Sub-TLV可以承载于OSPFv2 Extended Prefix TLV，当开放式最短路径优先协议为OSPFv3协议时，该NRP BIER Sub-TLV可以承载于Intra-Area-Prefix TLV或者Inter-Area-Prefix TLV；或者，第一路由通告消息包括 NRP Sub-TLV，映射信息携带于NRP Sub-TLV。例如，如图4所示，图4为另一种第一路由通告消息的示意图，其中，Reserved为保留字段，其用于字节对齐；MT-ID表示多拓扑标识，其中，每个BIER子域必须与一个由MT-ID标识的且只有一个OSPF拓扑相关联；Sub-TLVs表示不同的BIER封装类型，且一个BIER的Sub-TLV可以携带多个不同的sub-sub-TLV，其他字段的字段含义如表1所示。另外，该目标网络资源划分标识NRP-ID可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，当第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，第一路由通告消息包括BIER Sub-TLV，映射信息携带于BIER Sub-TLV。另外，该第一路由通告消息包括NRP Sub-TLV，该目标网络资源划分标识携带于该NRP Sub-TLV，该NRP Sub-TLV承载于BIER Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，以基于每BIFT-ID分配切片标识为例，在BIER-MPLS封装场景下，当第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，第一路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，且NRP sub-sub-TLV承载于sub-sub-TLV，该sub-sub-TLV承载于BIER MPLS Encapsulation Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，以基于每BIFT-ID分配切片标识为例，在BIER-非MPLS封装场景下，当第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，第一路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，且该NRP sub-sub-TLV承载于sub-sub-TLV，sub-sub-TLV承载于OSPFv2/OSPFv3 BIER non-MPLS Encapsulation Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，当第一路由通告消息为基于边界网关协议的路由通告消息，第一路由通告消息包括BIER TLV，映射信息携带于BIER TLV。具体地，该第一路由通告消息包括NRP Sub-TLV，该目标网络资源划分标识携带于该NRP Sub-TLV，该NRP Sub-TLV承载于BIER TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，以基于每BIFT-ID分配切片标识为例，在BIER-MPLS封装场景下，当第一路由通告消息为基于边界网关协议的路由通告消息，第一路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，且NRP sub-sub-TLV承载于sub-sub-TLV，该sub-sub-TLV承载于BIER MPLS Encapsulation Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，以基于每BIFT-ID分配切片标识为例，在BIER-非MPLS封装场景下，当第一路由通告消息为基于边界网关协议的路由通告消息，第一路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，且该NRP sub-sub-TLV承载于sub-sub-TLV，sub-sub-TLV承载于BIER non-MPLS Encapsulation sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活 算法标识中的任意之一。
在一实施例中，当位索引显式复制网络域为基于工程的位索引显式复制(BIER-TE)网络域，映射信息可以由位转发路由器在基于工程的位索引显式复制网络域中通过第二路由通告消息进行通告。其中，BIER-TE可以为BIET tree工程或者BIER流量工程；第二路由通告消息可以是基于中间系统到中间系统协议的路由通告消息，也可以是基于开放式最短路径优先协议的路由通告消息，还可以是基于边界网关协议的路由通告消息。当目标协议类型为开放式最短路径优先协议类型时，目标协议类型可以是开放式最短路径优先协议版本2(即OSPFv2)，也可以是开放式最短路径优先协议版本3(即OSPFv3)，在此不做具体限制。
在一实施例中，当第二路由通告消息为基于中间系统到中间系统协议的路由通告消息，第二路由通告消息包括BIER-TE Info Sub-TLV，映射信息携带于BIER-TE Info Sub-TLV。若基于每BIFT-ID分配切片标识，则在BIER-MPLS封装场景下，第二路由通告消息包括NRP sub-sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-sub-TLV，且NRP sub-sub-sub-TLV承载于sub-sub-sub-TLV，sub-sub-sub-TLV承载于BIER-TE MPLS Encapsulation Extended Sub-sub-TLV；若基于每BIFT-ID分配切片标识，则在BIER-非MPLS封装场景下，该第二路由通告消息包括NRP sub-sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-sub-TLV，NRP sub-sub-sub-TLV承载于sub-sub-sub-TLV，该sub-sub-sub-TLV承载于IS-IS BIER-TE non-MPLS Encapsulation Sub-sub TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，当第二路由通告消息为基于中间系统到中间系统协议的路由通告消息，第二路由通告消息包括BIER-TE Info Sub-TLV，映射信息携带于BIER-TE Info Sub-TLV。并且，该第二路由通告消息还包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，且NRP sub-sub-TLV承载于BIER-TE Info Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，当第二路由通告消息为基于开放式最短路径优先协议的路由通告消息，第二路由通告消息包括BIER-TE Sub-TLV，映射信息携带于BIER-TE Sub-TLV。若基于每BIFT-ID分配切片标识，则在BIER-MPLS封装场景下，第二路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，NRP sub-sub-TLV承载于sub-sub-TLV，且该sub-sub-TLV承载于BIER-TE MPLS Encapsulation Sub-TLV；若基于每BIFT-ID分配切片标识，则在BIER-非MPLS封装场景下，第二路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，NRP sub-sub-TLV承载于sub-sub-TLV，sub-sub-TLV承载于OSPFv2/OSPFv3 BIER-TE non-MPLS Encapsulation Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，当第二路由通告消息为基于开放式最短路径优先协议的路由通告消息，第二路由通告消息包括BIER-TE Sub-TLV，映射信息携带于BIER-TE Sub-TLV。具体地，第二路由通告消息还包括NRP sub-sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-sub-TLV，NRP sub-sub-sub-TLV承载于sub-sub-sub-TLV，sub-sub-sub-TLV承载于 BIER-TE Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，当第二路由通告消息为基于边界网关协议的路由通告消息，第二路由通告消息包括BIER-TE TLV，映射信息携带于BIER-TE TLV。若基于每BIFT-ID分配切片标识，则在BIER-MPLS封装场景下，第二路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，NRP sub-sub-TLV承载于sub-sub-TLV，且该sub-sub-TLV承载于BIER MPLS Encapsulation Sub-TLV；若基于每BIFT-ID分配切片标识，则在BIER-非MPLS封装场景下，第二路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，NRP sub-sub-TLV承载于sub-sub-TLV，sub-sub-TLV承载于BIER non-MPLS Encapsulation Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，当第二路由通告消息为基于边界网关协议的路由通告消息，第二路由通告消息包括BIER-TE TLV，映射信息携带于BIER-TE TLV。具体地，该第二路由通告消息还可以包括NRP sub-TLV，该目标网络资源划分标识携带于NRP sub-TLV，且NRP sub-TLV承载于BIER-TE TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
参照图5，图5是本申请另一个实施例提供的位索引路由表建立方法的流程图，该位索引路由表建立方法可以包括但不限于步骤S210和步骤S220。
步骤S210：在位索引显式复制网络域中通告映射信息，使得位索引显式复制网络域中的位转发路由器根据映射信息建立与目标网络资源划分标识对应的位索引路由表，其中，映射信息用于表征目标标识信息与目标网络资源划分标识之间的映射关系。
一可行的实施方式，目标标识信息可以包括位转发路由器标识、位索引显式复制子域标识或者位索引转发表标识中的任意之一。当位索引显式复制网络域为基于工程的位索引显式复制网络域时，该目标标识信息可以包括位索引显式复制子域标识、位索引转发表标识或者比特位置中的任意之一，其中，位索引转发表标识为位索引转发表的标识，该位索引转发表标识用于指示位转发路由器查找对应的BIFT以转发BIER报文。
可以理解的是，位转发路由器包括位转发入口路由器、中间位转发路由器和位转发出口路由器，其中，在BIER网络中，只有位转发入口路由器和位转发出口路由器需要分配唯一的位转发路由器标识进行标识，中间位转发路由器无需分配位转发路由器标识进行标识。
一可行的实施方式，目标网络资源划分标识可以为切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意一个，在此不作具体限制。
一可行的实施方式，位索引路由表还可以包括BIER信息以及其他信息，其中，BIER信息包括BIER子域、BSL、目标标识信息、SI以及BFR-prefix等信息，其中，BIER子域可以划分多个子集，并用SI标识，而SI可以根据位转发路由器标识和BSL计算得出，具体地，当一个BIER子域内使用的BSL不足以表示该子域内配置的位转发路由器标识的最大值时，需要将位串分成不同的集合，每个集合通过SI进行标识。比如，假设BIER子域内位转发路由器标识的最大值为1024，若BSL设置为256，则需要将BIER子域分为四个集合，该集合分别为SI 0，SI 1、SI 2和SI 3，在此不作具体限制。
可以理解的是，基于切片的位索引路由表是在特定切片内，从位转发出口路由器的转发 路由器标识映射到该位转发出口路由器的BFR-prefix，并映射到到达该位转发出口路由器的路径上的BFR-NBR的表，因此，该基于切片的位索引路由表描述了特定切片内的BFR-prefix以及BFR-NBR的对应关系，其可以用于生成BIER转发表。
在一实施例中，可以将特定切片内的具有相同SI和相同BFR-NBR的位索引路由表可以进行整合，得到基于切片的位索引转发表，并利用位索引转发表建立切片内的F-BM与BFR-NBR之间的映射关系，其中，F-BM表示往下一跳BFR-NBR复制发送报文时，通过该BFR-NBR能到达的BIER域边缘节点集合。另外，在位索引显式复制网络域中，每个位转发出口路由器对应一个比特位置，该比特位置在特定切片内的BIER子域中全局唯一，所有的位转发出口路由器的比特位置组成一个位串，BIER报文在位索引显式复制网络域中的切片内传递和路由依赖于位串。当其他的位转发路由器收到了包含有BIER信息和/或目标网络资源划分标识的BIER报文头时，基于切片的位索引转发表对BIER报文进行转发。
本实施例中，通过采用包括有上述步骤S210的位索引路由表建立方法，因此，位转发路由器可以在位索引显式复制网络域中通告映射信息，使得位索引显式复制网络域中的位转发路由器根据映射信息建立与目标网络资源划分标识对应的位索引路由表，其中，映射信息用于表征目标标识信息与目标网络资源划分标识之间的映射关系，位转发路由器基于切片粒度的位索引转发表来转发报文，因此，本申请实施例能够在BIER网络中以切片形式传输数据。
在一实施例中，映射信息可以由位转发路由器在位索引显式复制网络域中通过第一路由通告消息进行通告，其中，第一路由通告消息可以是基于中间系统到中间系统协议的路由通告消息，也可以是基于开放式最短路径优先协议的路由通告消息，还可以是基于边界网关协议的路由通告消息。当目标协议类型为开放式最短路径优先协议类型时，目标协议类型可以是OSPFv2，也可以是OSPFv3，在此不做具体限制。
在一实施例中，当第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，第一路由通告消息包括NRP BIER Info-Sub-TLV，映射信息携带于NRP BIER Info-Sub-TLV，且该NRP BIER Info-Sub-TLV承载于ISIS prefix-reachability TLV。例如，如图2所示，图2为一种第一路由通告消息的示意图，并且本实施例中的映射信息指的是BFR-id与目标网络资源划分标识NRP-ID的映射关系。其中，Type、Length、BAR、IPA以及Sub-Domain-ID(子域标识)的字段长度均可以为1个字节(即8bit)，BFR-id的字段长度可以是2个字节，NRP-ID的字段长度可以为4个字节、3个字节或者1个字节，sub-sub-TLVs的字段长度为可变长度，此外，图2中各个字段的字段含义如表1所示，其中，BIER封装类型可以是MPLS(Multi-Protocol Label Switching，多协议标签交换)类型、非MPLS类型，也可以是其他封装类型，sub-sub-TLVs的类型为NRP BIER Info-Sub-TLV，NRP-ID可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，当第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，第一路由通告消息包括BIER Info-Sub-TLV，映射信息携带于BIER Info-Sub-TLV。具体地，在本实施例中，映射消息指的是BIFT ID和/或位转发路由器标识和/或位索引显式复制子域标识与目标网络资源划分标识的映射关系，第一路由通告消息还包括NRP Sub-sub-TLV，目标网络资源划分标识携带于NRP Sub-sub-TLV，NRP Sub-sub-TLV承载于BIER Info-Sub-TLV，BIFT ID和/或位转发路由器标识和/或位索引显式复制子域标识携带在BIER Info-Sub-TLV中。例如，如图3所示，图3为另一种第一路由通告消息的示意图，其中，Type待定义(To Be Defined， TBD)，Type和Length的字段长度均可以为2个字节(即16bit)，NRP-ID的字段长度可以为4个字节、3个字节或者1个字节。此外，Type、Length以及NRP-ID的字段含义如表1所示，其中，目标网络资源划分标识NRP-ID可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
基于上述实施例，在一实施例中，若基于每BIFT-ID分配切片标识，则在BIER-MPLS封装场景下，当第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，第一路由通告消息可以包括NRP sub-sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-sub-TLV，且该NRP sub-sub-sub-TLV承载于sub-sub-sub-TLV，该sub-sub-sub-TLV承载于BIER MPLS Encapsulation Extended Sub-sub-TLV，其中，目标网络资源划分标识NRP-ID可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，以基于每BIFT-ID分配切片标识为例，在BIER-非MPLS封装场景下，当第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，则第一路由通告消息可以包括NRP sub-sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-sub-TLV，且该NRP sub-sub-sub-TLV承载于sub-sub-sub-TLV，该sub-sub-sub-TLV承载于IS-IS BIER non-MPLS Encapsulation Sub-sub TLV，其中，目标网络资源划分标识NRP-ID可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，当第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，第一路由通告消息可以包括NRP BIER Sub-TLV，且映射信息携带于NRP BIER Sub-TLV，其中，当开放式最短路径优先协议为OSPFv2协议时，该NRP BIER Sub-TLV可以承载于OSPFv2 Extended Prefix TLV，当开放式最短路径优先协议为OSPFv3协议时，该NRP BIER Sub-TLV可以承载于Intra-Area-Prefix TLV或者Inter-Area-Prefix TLV；或者，第一路由通告消息包括NRP Sub-TLV，映射信息携带于NRP Sub-TLV。例如，如图4所示，图4为另一种第一路由通告消息的示意图，其中，Reserved为保留字段，其用于字节对齐；MT-ID表示多拓扑标识，其中，每个BIER子域必须与一个由MT-ID标识的且只有一个OSPF拓扑相关联；Sub-TLVs表示不同的BIER封装类型，且一个BIER的Sub-TLV可以携带多个不同的sub-sub-TLV，其他字段的字段含义如表1所示。另外，该目标网络资源划分标识NRP-ID可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，当第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，第一路由通告消息包括BIER Sub-TLV，映射信息携带于BIER Sub-TLV。另外，该第一路由通告消息包括NRP Sub-TLV，该目标网络资源划分标识携带于该NRP Sub-TLV，该NRP Sub-TLV承载于BIER Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，以基于每BIFT-ID分配切片标识为例，在BIER-MPLS封装场景下，当第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，第一路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，且NRP sub-sub-TLV承载于sub-sub-TLV，该sub-sub-TLV承载于BIER MPLS Encapsulation Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，以基于每BIFT-ID分配切片标识为例，在BIER-非MPLS封装场景下，当第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，第一路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，且该NRP sub-sub-TLV承载于sub-sub-TLV，sub-sub-TLV承载于OSPFv2/OSPFv3 BIER non-MPLS Encapsulation Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，当第一路由通告消息为基于边界网关协议的路由通告消息，第一路由通告消息包括BIER TLV，映射信息携带于BIER TLV。具体地，该第一路由通告消息包括目标网络资源划分标识和NRP Sub-TLV，该目标网络资源划分标识携带于该NRP Sub-TLV，该NRP Sub-TLV承载于BIER TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，以基于每BIFT-ID分配切片标识为例，在BIER-MPLS封装场景下，当第一路由通告消息为基于边界网关协议的路由通告消息，第一路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，且NRP sub-sub-TLV承载于sub-sub-TLV，该sub-sub-TLV承载于BIER MPLS Encapsulation Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，以基于每BIFT-ID分配切片标识为例，在BIER-非MPLS封装场景下，当第一路由通告消息为基于边界网关协议的路由通告消息，第一路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，且该NRP sub-sub-TLV承载于sub-sub-TLV，sub-sub-TLV承载于BIER non-MPLS Encapsulation sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，当位索引显式复制网络域为基于工程的位索引显式复制(BIER-TE)网络域，映射信息可以由位转发路由器在基于工程的位索引显式复制网络域中通过第二路由通告消息进行通告。其中，BIER-TE可以为BIET tree工程或者BIER流量工程；第二路由通告消息可以是基于中间系统到中间系统协议的路由通告消息，也可以是基于开放式最短路径优先协议的路由通告消息，还可以是基于边界网关协议的路由通告消息。当目标协议类型为开放式最短路径优先协议类型时，目标协议类型可以是OSPFv2，也可以是OSPFv3，在此不做具体限制。
在一实施例中，当第二路由通告消息为基于中间系统到中间系统协议的路由通告消息，第二路由通告消息包括BIER-TE Info Sub-TLV，映射信息携带于BIER-TE Info Sub-TLV。若基于每BIFT-ID分配切片标识，则在BIER-MPLS封装场景下，第二路由通告消息包括NRP sub-sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-sub-TLV，且NRP sub-sub-sub-TLV承载于sub-sub-sub-TLV，sub-sub-sub-TLV承载于BIER-TE MPLS Encapsulation Extended Sub-sub-TLV；若基于每BIFT-ID分配切片标识，则在BIER-非MPLS封装场景下，第二路由通告消息包括NRP sub-sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-sub-TLV，NRP sub-sub-sub-TLV承载于sub-sub-sub-TLV，该sub-sub-sub-TLV承载于IS-IS BIER-TE non-MPLS Encapsulation Sub-sub TLV，其中，该目标网络资源划分标识可 以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，当第二路由通告消息为基于中间系统到中间系统协议的路由通告消息，第二路由通告消息包括BIER-TE Info Sub-TLV，映射信息携带于BIER-TE Info Sub-TLV。并且，该第二路由通告消息还包括NRP sub-sub-TLV和目标网络资源划分标识，该目标网络资源划分标识携带于NRP sub-sub-TLV，且NRP sub-sub-TLV承载于BIER-TE Info Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，当第二路由通告消息为基于开放式最短路径优先协议的路由通告消息，第二路由通告消息包括BIER-TE Sub-TLV，映射信息携带于BIER-TE Sub-TLV。若基于每BIFT-ID分配切片标识，则在BIER-MPLS封装场景下，第二路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，NRP sub-sub-TLV承载于sub-sub-TLV，且该sub-sub-TLV承载于BIER-TE MPLS Encapsulation Sub-TLV；若基于每BIFT-ID分配切片标识，则在BIER-非MPLS封装场景下，第二路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，NRP sub-sub-TLV承载于sub-sub-TLV，sub-sub-TLV承载于OSPFv2/OSPFv3 BIER-TE non-MPLS Encapsulation Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，当第二路由通告消息为基于开放式最短路径优先协议的路由通告消息，第二路由通告消息包括BIER-TE Sub-TLV，映射信息携带于BIER-TE Sub-TLV。具体地，第二路由通告消息还包括NRP sub-sub-sub-TLV和目标网络资源划分标识，该目标网络资源划分标识携带于NRP sub-sub-sub-TLV，NRP sub-sub-sub-TLV承载于sub-sub-sub-TLV，sub-sub-sub-TLV承载于BIER-TE Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在一实施例中，当第二路由通告消息为基于边界网关协议的路由通告消息，第二路由通告消息包括BIER-TE TLV，映射信息携带于BIER-TE TLV。若基于每BIFT-ID分配切片标识，在BIER-MPLS封装场景下，第二路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，NRP sub-sub-TLV承载于sub-sub-TLV，且该sub-sub-TLV承载于BIER MPLS Encapsulation Sub-TLV；若基于每BIFT-ID分配切片标识，在BIER-非MPLS封装场景下，第二路由通告消息包括NRP sub-sub-TLV，该目标网络资源划分标识携带于NRP sub-sub-TLV，NRP sub-sub-TLV承载于sub-sub-TLV，sub-sub-TLV承载于BIER non-MPLS Encapsulation Sub-TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
在另一实施例中，当第二路由通告消息为基于边界网关协议的路由通告消息，第二路由通告消息包括BIER-TE TLV，映射信息携带于BIER-TE TLV。具体地，该第二路由通告消息还可以包括NRP sub-TLV和目标网络资源划分标识，该目标网络资源划分标识携带于NRP sub-TLV，且NRP sub-TLV承载于BIER-TE TLV，其中，该目标网络资源划分标识可以是切片标识、切片聚合标识、网络资源划分标识、多拓扑标识或者灵活算法标识中的任意之一。
针对上述实施例所提供的位索引路由表建立方法，下面以具体的示例进行详细的描述：
示例一：
在一实施例中，以目标标识信息为位转发路由器标识为例。在采用IGP灵活算法实现切片的场景下，不同的位转发路由器之间在位索引显式复制网络域中通过第一路由通告消息进行通告位转发路由器标识与灵活算法标识的映射信息，根据映射信息建立与目标网络资源划分标识对应的位索引路由表。在此之前，每个位转发出口路由器需要为不同Flex-algorithm平面分配位转发路由器标识。如图6所示，将位转发路由器gBFR1、gBFR2、gBFR3、gBFR4所接入的网络划分为第一Flex-algorithm平面，将rBFR1、rBFR2、rBFR3、rBFR4所接入的网络划分为第二Flex-algorithm平面，位转发出口路由器BFER为第一Flex-algorithm平面分配第一位转发路由器标识0001，并且为第二Flex-algorithm平面分配第二位转发路由器标识0010，从而实现拓扑和资源隔离。其中，第一路由通告消息可以是基于中间系统到中间系统协议的路由通告消息，也可以是基于开放式最短路径优先协议的路由通告消息，还可以是基于边界网关协议的路由通告消息，在此不作具体限制。另外，在采用IGP灵活算法实现切片的场景下，该第一路由通告消息包括目标网络资源划分标识，且该目标网络资源划分标识为灵活算法标识，该灵活算法标识只需1个字节即可。
示例二：
在一实施例中，以目标标识信息为位索引显式复制子域标识或者位索引转发表标识(BIFT-ID)为例，其中，位索引显式复制子域标识可以为位索引显式复制标签转发标识(BIER-MPLS label)，在BIER-MPLS网络中，BIFT-ID也可以称作BIER-MPLS label，非BIER-MPLS网络使用BIFT-ID。在采用IGP灵活算法实现切片的场景下，不同的位转发路由器之间在位索引显式复制网络域中通过第一路由通告消息进行通告BIFT-ID与灵活算法标识映射信息，根据映射信息建立与目标网络资源划分标识对应的位索引路由表。在此之前，每个位转发出口路由器为不同的Flex-algorithm平面分配不同的BIER-MPLS label或者BIFT-ID。如图6所示，将位转发路由器gBFR1、gBFR2、gBFR3、gBFR4所接入的网络划分为第一Flex-algorithm平面，将rBFR1、rBFR2、rBFR3、rBFR4所接入的网络划分为第二Flex-algorithm平面，位转发出口路由器为第一Flex-algorithm平面分配label 1或者BIFT-ID1，并且为第二Flex-algorithm平面分配label 2或者BIFT-ID2，从而实现拓扑和资源隔离。此外，BIER支持MPLS封装和非MPLS封装。
一可行的实施方式，第一路由通告消息可以是基于中间系统到中间系统协议的路由通告消息，也可以是基于开放式最短路径优先协议的路由通告消息，还可以是基于边界网关协议的路由通告消息，在此不作具体限制。而且，在采用IGP灵活算法实现切片的场景下，该第一路由通告消息包括目标网络资源划分标识，且该目标网络资源划分标识为灵活算法标识，该灵活算法标识只需1个字节即可。
示例三：
在一实施例中，以目标标识信息为位索引显式复制子域标识或者位索引转发表标识(即BIFT-ID)为例，其中，位索引显式复制子域标识可以为位索引显式复制标签转发标识(BIER-MPLS label)，在BIER-MPLS网络中，BIFT-ID也可以称作BIER-MPLS label。在采用切片聚合实现切片的场景下，不同的位转发路由器之间在基于工程的位索引显式复制(即BIER-TE)网络域中通过第一路由通告消息进行通告BIFT-ID与NRP-ID映射信息，根据映射信息建立与目标网络资源划分标识对应的位索引路由表。在此之前，每个位转发路由器为不 同的切片分配不同的BIER-MPLS label或者BIFT-ID。比如，如图6所示，将位转发路由器gBFR1、gBFR2、gBFR3、gBFR4所接入的网络划分为NRP-ID1网络，将rBFR1、rBFR2、rBFR3、rBFR4所接入的网络划分为NRP-ID2网络，位转发路由器为第一切片分配label 1或者BIFT-ID1，并且为第二切片分配label 2或者BIFT-ID2，从而实现拓扑和资源隔离。
一可行的实施方式，第一路由通告消息可以是基于中间系统到中间系统协议的路由通告消息，也可以是基于开放式最短路径优先协议的路由通告消息，还可以是基于边界网关协议的路由通告消息，在此不作具体限制。而且，在采用切片聚合实现切片的场景下，该第一路由通告消息包括目标网络资源划分标识，且该目标网络资源划分标识为切片聚合标识。
示例四：
在一实施例中，以目标标识信息为基于位索引显式复制的比特位置(即Bit Position)为例。在采用切片聚合实现切片的场景下，不同的位转发路由器之间在基于工程的位索引显式复制(即BIER-TE)网络域中通过第一路由通告消息进行通告映射信息，根据映射信息建立与目标网络资源划分标识对应的位索引路由表。在此之前，每个位转发路由器为不同的切片分配不同的比特位置。比如，如图6所示，将位转发路由器gBFR1、gBFR2、gBFR3、gBFR4所在的网络划分NRP-ID1网络，将rBFR1、rBFR2、rBFR3、rBFR4所在的网络划分为NRP-ID2网络，位转发路由器为第一切片分配Bit Position 1，并且为第二切片分配Bit Position 2，从而实现拓扑和资源隔离。
一可行的实施方式，第一路由通告消息可以是基于中间系统到中间系统协议的路由通告消息，也可以是基于开放式最短路径优先协议的路由通告消息，还可以是基于边界网关协议的路由通告消息，在此不作具体限制。而且，在采用切片聚合实现切片的场景下，该第一路由通告消息包括目标网络资源划分标识，且该目标网络资源划分标识为切片聚合标识。
另外，参照图7，本申请的一个实施例还提供了一种网络设备，该网络设备200包括存储器202、处理器201及存储在存储器202上并可在处理器201上运行的计算机程序。
处理器201和存储器202可以通过总线或者其他方式连接。
存储器202作为一种非暂态计算机可读存储介质，可用于存储非暂态软件程序以及非暂态性计算机可执行程序。此外，存储器202可以包括高速随机存取存储器，还可以包括非暂态存储器，例如至少一个磁盘存储器件、闪存器件、或其他非暂态固态存储器件。在一些实施方式中，存储器202可选包括相对于处理器201远程设置的存储器，这些远程存储器可以通过网络连接至该处理器201。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
实现上述实施例的位索引路由表建立方法所需的非暂态软件程序以及指令存储在存储器202中，当被处理器201执行时，执行上述实施例中的位索引路由表建立方法，例如，执行以上描述的图1中的方法步骤S110至S120以及图5中的方法步骤S210。
以上所描述的设备实施例仅仅是示意性的，其中作为分离部件说明的单元可以是或者也可以不是物理上分开的，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。
此外，本申请的一个实施例还提供了一种计算机可读存储介质，该计算机可读存储介质存储有计算机可执行指令，该计算机可执行指令被一个处理器或控制器执行，例如，执行以上描述的图1中的方法步骤S110至S120以及图5中的方法步骤S210。
此外，本申请的一个实施例还提供了一种计算机程序产品，包括计算机程序或计算机指令，计算机程序或计算机指令存储在计算机可读存储介质中，计算机设备的处理器从计算机可读存储介质读取计算机程序或计算机指令，处理器执行计算机程序或计算机指令，使得计算机设备执行上述实施例中的位索引路由表建立方法，例如，执行以上描述的图1中的方法步骤S110至S120以及图5中的方法步骤S210。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统可以被实施为软件、固件、硬件及其适当的组合。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。

Claims (26)

  1. 一种位索引路由表建立方法，包括：
    接收位索引显式复制网络域中的位转发路由器所通告的映射信息，其中，所述映射信息用于表征目标标识信息与目标网络资源划分标识之间的映射关系；
    根据所述映射信息建立与所述目标网络资源划分标识对应的位索引路由表。
  2. 根据权利要求1所述的位索引路由表建立方法，其中，所述目标标识信息包括如下之一：
    位转发路由器标识；
    位索引转发表标识；
    位索引显式复制子域标识。
  3. 根据权利要求1所述的位索引路由表建立方法，其中，所述位索引显式复制网络域为基于工程的位索引显式复制网络域，所述目标标识信息包括如下之一：
    位索引转发表标识；
    位索引显式复制子域标识；
    比特位置。
  4. 根据权利要求1所述的位索引路由表建立方法，其中，所述映射信息由所述位转发路由器在所述位索引显式复制网络域中通过第一路由通告消息进行通告。
  5. 根据权利要求4所述的位索引路由表建立方法，其中，所述第一路由通告消息为如下之一：
    基于中间系统到中间系统协议的路由通告消息；
    基于开放式最短路径优先协议的路由通告消息；
    基于边界网关协议的路由通告消息。
  6. 根据权利要求5所述的位索引路由表建立方法，其中：
    当所述第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，所述第一路由通告消息包括NRP BIER Info-Sub-TLV，所述映射信息携带于所述NRP BIER Info-Sub-TLV；
    或者，
    当所述第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，所述第一路由通告消息包括BIER Info-Sub-TLV，所述映射信息携带于所述BIER Info-Sub-TLV。
  7. 根据权利要求5所述的位索引路由表建立方法，其中：
    当所述第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，所述第一路由通告消息包括NRP BIER Sub-TLV，所述映射信息携带于所述NRP BIER Sub-TLV；
    或者，
    当所述第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，所述第一路由通告消息包括BIER Sub-TLV，所述映射信息携带于所述BIER Sub-TLV。
  8. 根据权利要求5所述的位索引路由表建立方法，其中：
    当所述第一路由通告消息为基于边界网关协议的路由通告消息，所述第一路由通告消息包括BIER TLV，所述映射信息携带于所述BIER TLV。
  9. 根据权利要求1所述的位索引路由表建立方法，其中，所述位索引显式复制网络域为 基于工程的位索引显式复制网络域，所述映射信息由所述位转发路由器在所述基于工程的位索引显式复制网络域中通过第二路由通告消息进行通告。
  10. 根据权利要求9所述的位索引路由表建立方法，其中，所述第二路由通告消息为如下之一：
    基于中间系统到中间系统协议的路由通告消息；
    基于开放式最短路径优先协议的路由通告消息；
    基于边界网关协议的路由通告消息。
  11. 根据权利要求10所述的位索引路由表建立方法，其中：
    当所述第二路由通告消息为基于中间系统到中间系统协议的路由通告消息，所述第二路由通告消息包括BIER-TE Info Sub-TLV，所述映射信息携带于所述BIER-TE Info Sub-TLV；
    或者，
    当所述第二路由通告消息为基于开放式最短路径优先协议的路由通告消息，所述第二路由通告消息包括BIER-TE Sub-TLV，所述映射信息携带于所述BIER-TE Sub-TLV；
    或者，
    当所述第二路由通告消息为基于边界网关协议的路由通告消息，所述第二路由通告消息包括BIER-TE TLV，所述映射信息携带于所述BIER-TE TLV。
  12. 根据权利要求1所述的位索引路由表建立方法，其中，所述目标网络资源划分标识包括如下之一：
    切片标识；
    切片聚合标识；
    网络资源划分标识；
    多拓扑标识；
    灵活算法标识。
  13. 一种位索引路由表建立方法，包括：
    在位索引显式复制网络域中通告映射信息，使得所述位索引显式复制网络域中的位转发路由器根据映射信息建立与目标网络资源划分标识对应的位索引路由表，其中，所述映射信息用于表征目标标识信息与所述目标网络资源划分标识之间的映射关系。
  14. 根据权利要求13所述的位索引路由表建立方法，其中，所述目标标识信息包括如下之一：
    位转发路由器标识；
    位索引转发表标识；
    位索引显式复制子域标识。
  15. 根据权利要求13所述的位索引路由表建立方法，其中，所述位索引显式复制网络域为基于工程的位索引显式复制网络域，所述目标标识信息包括如下之一：
    位索引转发表标识；
    位索引显式复制子域标识；
    比特位置。
  16. 根据权利要求13所述的位索引路由表建立方法，其中，所述映射信息由所述位转发路由器在所述位索引显式复制网络域中通过第一路由通告消息进行通告。
  17. 根据权利要求16所述的位索引路由表建立方法，其中，所述第一路由通告消息为如下之一：
    基于中间系统到中间系统协议的路由通告消息；
    基于开放式最短路径优先协议的路由通告消息；
    基于边界网关协议的路由通告消息。
  18. 根据权利要求17所述的位索引路由表建立方法，其中：
    当所述第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，所述第一路由通告消息包括NRP BIER Info-Sub-TLV，所述映射信息携带于所述NRP BIER Info-Sub-TLV；
    或者，
    当所述第一路由通告消息为基于中间系统到中间系统协议的路由通告消息，所述第一路由通告消息包括BIER Info-Sub-TLV，所述映射信息携带于所述BIER Info-Sub-TLV。
  19. 根据权利要求17所述的位索引路由表建立方法，其中：
    当所述第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，所述第一路由通告消息包括NRP BIER Sub-TLV，所述映射信息携带于所述NRP BIER Sub-TLV；
    或者，
    当所述第一路由通告消息为基于开放式最短路径优先协议的路由通告消息，所述第一路由通告消息包括BIER Sub-TLV，所述映射信息携带于所述BIER Sub-TLV。
  20. 根据权利要求17所述的位索引路由表建立方法，其中：
    当所述第一路由通告消息为基于边界网关协议的路由通告消息，所述第一路由通告消息包括BIER TLV，所述映射信息携带于所述BIER TLV。
  21. 根据权利要求13所述的位索引路由表建立方法，其中，所述位索引显式复制网络域为基于工程的位索引显式复制网络域，所述映射信息由所述位转发路由器在所述基于工程的位索引显式复制网络域中通过第二路由通告消息进行通告。
  22. 根据权利要求21所述的位索引路由表建立方法，其中，所述第二路由通告消息为如下之一：
    基于中间系统到中间系统协议的路由通告消息；
    基于开放式最短路径优先协议的路由通告消息；
    基于边界网关协议的路由通告消息。
  23. 根据权利要求22所述的位索引路由表建立方法，其中：
    当所述第二路由通告消息为基于中间系统到中间系统协议的路由通告消息，所述第二路由通告消息包括BIER-TE Info Sub-TLV，所述映射信息携带于所述BIER-TE Info Sub-TLV；
    或者，
    当所述第二路由通告消息为基于开放式最短路径优先协议的路由通告消息，所述第二路由通告消息包括BIER-TE Sub-TLV，所述映射信息携带于所述BIER-TE Sub-TLV；
    或者，
    当所述第二路由通告消息为基于边界网关协议的路由通告消息，所述第二路由通告消息包括BIER-TE TLV，所述映射信息携带于所述BIER-TE TLV。
  24. 根据权利要求13所述的位索引路由表建立方法，其中，所述目标网络资源划分标识包括如下之一：
    切片标识；
    切片聚合标识；
    网络资源划分标识；
    多拓扑标识；
    灵活算法标识。
  25. 一种网络设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如权利要求1至24任意一项所述的位索引路由表建立方法。
  26. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行权利要求1至24任意一项所述的位索引路由表建立方法。
PCT/CN2023/096864 2022-09-15 2023-05-29 位索引路由表建立方法、网络设备及存储介质 WO2024055633A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211122862.2 2022-09-15
CN202211122862.2A CN117749687A (zh) 2022-09-15 2022-09-15 位索引路由表建立方法、网络设备及存储介质

Publications (1)

Publication Number Publication Date
WO2024055633A1 true WO2024055633A1 (zh) 2024-03-21

Family

ID=90256793

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/096864 WO2024055633A1 (zh) 2022-09-15 2023-05-29 位索引路由表建立方法、网络设备及存储介质

Country Status (2)

Country Link
CN (1) CN117749687A (zh)
WO (1) WO2024055633A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180316520A1 (en) * 2017-04-28 2018-11-01 Cisco Technology, Inc. Bridging of non-capable subnetworks in bit indexed explicit replication
CN108989209A (zh) * 2017-05-31 2018-12-11 中兴通讯股份有限公司 Bier mpls网络设备、及其报文转发方法和介质
US20190296922A1 (en) * 2018-03-21 2019-09-26 Nokia Solutions And Networks Oy Hierarchical bit indexed replication of multicast packets
CN112511319A (zh) * 2020-07-03 2021-03-16 中兴通讯股份有限公司 信息通告、报文转发、报文消除方法、装置、设备和介质
CN114465946A (zh) * 2020-11-09 2022-05-10 华为技术有限公司 获取转发表项的方法、装置以及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180316520A1 (en) * 2017-04-28 2018-11-01 Cisco Technology, Inc. Bridging of non-capable subnetworks in bit indexed explicit replication
CN108989209A (zh) * 2017-05-31 2018-12-11 中兴通讯股份有限公司 Bier mpls网络设备、及其报文转发方法和介质
US20190296922A1 (en) * 2018-03-21 2019-09-26 Nokia Solutions And Networks Oy Hierarchical bit indexed replication of multicast packets
CN112511319A (zh) * 2020-07-03 2021-03-16 中兴通讯股份有限公司 信息通告、报文转发、报文消除方法、装置、设备和介质
CN114465946A (zh) * 2020-11-09 2022-05-10 华为技术有限公司 获取转发表项的方法、装置以及系统

Also Published As

Publication number Publication date
CN117749687A (zh) 2024-03-22

Similar Documents

Publication Publication Date Title
CN110912795B (zh) 一种传输控制方法、节点、网络系统及存储介质
WO2021063232A1 (zh) 建立bier转发表项的方法、装置和系统
US9948574B2 (en) Bit indexed explicit replication packet encapsulation
US10581733B2 (en) Methods and devices for constructing label and forwarding label packet
CN105991302B (zh) 可靠传输上使用注册的多播流覆盖
CN106656781B (zh) 一种报文传输的方法、装置和系统
US9998368B2 (en) Zone routing system
WO2018228490A1 (zh) 组播跨域方法、装置、系统及计算机可读存储介质
EP3817446A1 (en) Method and apparatus for creating network slice
US8488614B1 (en) Upstream label assignment for the label distribution protocol
WO2021249021A1 (zh) 信息通告方法、通信节点、计算机可读介质
CN111355657B (zh) 一种流量工程路径建立方法及装置和系统
US11792044B2 (en) Offset label for aggregating multicasts from multiple virtual private networks on a single multicast distribution tree
US20200120020A1 (en) Stateless multicast in label switched packet networks
US20220255853A1 (en) Routing management method and apparatus, network device, and readable storage medium
WO2022048417A1 (zh) 报文处理方法、边界设备和计算机可读存储介质
WO2017211164A1 (zh) 一种确定跨域标签交换路径隧道的方法、设备和系统
EP3890256A1 (en) Stateless multicast based on local label spaces
WO2021073357A1 (zh) 报文处理方法、装置、系统、设备及存储介质
CN112350936B (zh) 一种内部网关协议泛洪优化方法及装置、存储介质
WO2024055633A1 (zh) 位索引路由表建立方法、网络设备及存储介质
EP3890255A1 (en) Stateless multicast based on network label space
WO2024055634A1 (zh) 信息通告方法、网络设备和计算机可读存储介质
CN112260949B (zh) 基于srv6协议的evpn本地优先转发方法和装置
US10924395B2 (en) Seamless multipoint label distribution protocol (mLDP) transport over a bit index explicit replication (BIER) core

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: 23864372

Country of ref document: EP

Kind code of ref document: A1