WO2017152576A1 - 报文转发方法及装置 - Google Patents

报文转发方法及装置 Download PDF

Info

Publication number
WO2017152576A1
WO2017152576A1 PCT/CN2016/094210 CN2016094210W WO2017152576A1 WO 2017152576 A1 WO2017152576 A1 WO 2017152576A1 CN 2016094210 W CN2016094210 W CN 2016094210W WO 2017152576 A1 WO2017152576 A1 WO 2017152576A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
bfr
packet
forwarding
identifier
Prior art date
Application number
PCT/CN2016/094210
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 中兴通讯股份有限公司
Priority to US16/083,242 priority Critical patent/US10547538B2/en
Priority to EP16893221.8A priority patent/EP3429143B1/en
Publication of WO2017152576A1 publication Critical patent/WO2017152576A1/zh

Links

Images

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
    • H04L45/24—Multipath
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding in a switch fabric
    • H04L49/252—Store and forward routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • 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/28—Routing or path finding of packets in data switching networks using route fault recovery
    • 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/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/35—Switches specially adapted for specific applications
    • H04L49/354—Switches specially adapted for specific applications for supporting virtual local area networks [VLAN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/70—Virtual switches

Definitions

  • This document relates to, but is not limited to, the field of communication technologies, and in particular, to a message forwarding method and apparatus.
  • BIER Bit Indexed Explicit Replication
  • BIER is a bit-based multicast replication technology.
  • each Bit-Forwarding Egress Routers (BFER) is assigned a globally unique bit position in the entire BIER sub-domain. Bit position, each BFER floods the BIER domain with its own bit position using the Interior Gateway Protocol (IGP). All bit positions form a bit string and the data packet is in the BIER domain. The passing and routing in it depends on the bitstring.
  • BFR packet forwarding router
  • receives the packet header containing the BIER it is based on the BIER packet header.
  • the carried bitstring is forwarded based on the bit forwarding table Bit Forwarding Table. This principle of forwarding based on the BIER bit greatly reduces the forwarding cost of the network.
  • Bit Index Explicit Replication-Traffic Enginering (BIER-TE) is similar to BIER. It forwards and copies packets according to BitString in the header, but the key of BIER-TE and BIER The differences are as follows:
  • Each bit position in a BitString represents one or more adjacency adjacency, rather than a BFER.
  • the way to protect the path in BIER-TE in the related art is mainly for explicitly creating a unique backup path for a certain path.
  • the path can only exist in one FRR (Fast Re-Route) entry.
  • FRR Fast Re-Route
  • the embodiment of the invention provides a message forwarding method and device, so as to at least solve the problem that the path protection can not be correctly and reasonably configured in the related art, thereby causing waste of resources.
  • a packet forwarding method including: receiving a packet to be sent to a bit forwarding export router BFER in a bit index display replication BIER-TE based on a traffic engineering extension, and a path identifier, where the path Identifying a primary path and a standby path for indicating that the message is sent by the first forwarding router BFR to the next hop BFR of the first BFR; determining, according to the path identifier, that the packet is forwarded to a bit string of the BFER; filling the bit string in the message, and forwarding the message according to the bit string.
  • the path identifier includes: using the main path and the standby path as a whole The adjacency identification ID assigned by the FRR adjacency is quickly rerouted.
  • the primary path has the capability of forming different fast reroute FRR adjacencies with different backup paths.
  • the standby path includes a path composed of two or more segments, or the standby path includes a tree path.
  • forwarding the packet according to the bit string includes: forwarding the packet to the first BFR according to the bit string, where, in a case where the determining that the primary path is normal, the Passing, by the primary path, the packet to the next hop BFR of the first BFR; and/or, in the case of determining that the primary path is faulty, the first BFR passes the standby path Forwarding the message to the next hop BFR of the first BFR.
  • the first BFR forwarding the packet to the next hop BFR of the first BFR by using the standby path includes: the first BFR is in a bit string filled in the packet The path identifier is replaced with the identifier of the standby path. The first BFR forwards the packet to the next hop BFR of the first BFR by using the standby path according to the identifier of the standby path.
  • the path identifier corresponding to the BIER-TE forwarding table BIFT includes information about the primary path and information of the standby path, where the information of the primary path includes an outgoing interface on the primary path. Information and/or the next hop BFR information; and/or the information of the standby path includes outbound interface information and/or the next hop BFR information on the first path segment on the standby path, And adding a bit mask AddBitmask, the clear bit mask ResetBitMask, wherein the AddBitmask is used to identify other path segments after the first path segment on the standby path, and the ResetBitMask includes the path identifier The path identifier that needs to be cleared within.
  • the BIFT is issued by a controller.
  • the path identifier is sent by the controller.
  • a packet forwarding method including: receiving a packet to be sent to a bit forwarding forwarding router BFER in a bit index display copy BIER-TE based on a traffic engineering extension; and filling according to the packet
  • the path identifier in the bit string forwards the message, wherein the path identifier in the bit string is used to indicate that the message is sent to the primary path and the standby path of the next hop forwarding router BFR.
  • the path identifier includes: an adjacency identification ID allocated by the main path and the standby path as a fast reroute FRR adjacency.
  • the primary path has the capability of forming different fast reroute FRR adjacencies with different backup paths.
  • the standby path includes a path composed of two or more segments, or the standby path includes a tree path.
  • forwarding the packet according to the path identifier in the bit string that is filled in the packet includes: forwarding, by the primary path, the packet to the message if the primary path is determined to be normal The next hop BFR; and/or, in the case of determining that the primary path is faulty, forwarding the message to the next hop BFR through the standby path.
  • forwarding the packet to the next hop BFR by using the standby path includes: replacing the path identifier in the bit string filled in the packet with the identifier of the standby path; The identifier of the standby path forwards the packet to the next hop BFR through the standby path.
  • the path identifier corresponding to the BIER-TE forwarding table BIFT includes information about the primary path and information of the standby path, where the information of the primary path includes an outgoing interface on the primary path. Information and/or the next hop BFR information; and/or the information of the standby path includes outbound interface information and/or the next hop BFR information on the first path segment on the standby path, And adding a bit mask AddBitmask, the clear bit mask ResetBitMask, wherein the AddBitmask is used to identify other path segments after the first path segment on the standby path, and the ResetBitMask includes the path identifier The path identifier that needs to be cleared within.
  • the BIFT is issued by a controller.
  • a packet forwarding method including: determining a path identifier for performing packet forwarding, where the path identifier is used to indicate that the packet is sent by the first forwarding router BFR to the a primary path and a backup path of the next hop BFR of the first BFR; the determined path identifier is sent to the BFR based on the traffic engineering extension to display the BFR in the replication BIER-TE, where the path identifier is used for The BFR forwards the message.
  • the path identifier includes: an adjacency identification ID allocated by the main path and the standby path as a fast reroute FRR adjacency.
  • the primary path has the capability of forming different fast reroute FRR adjacencies with different backup paths.
  • the standby path includes a path composed of two or more segments, and the standby path includes a tree path.
  • the path identifier corresponding to the BIER-TE forwarding table BIFT includes information about the primary path and information of the standby path, where the information of the primary path includes an outgoing interface on the primary path.
  • Information and/or next hop forwarding router BFR information; and/or information of the standby path includes outbound interface information on the first path segment on the standby path and/or next hop forwarding router BFR Information, and a new bit mask AddBitmask, a clear bit mask ResetBitMask, wherein the AddBitmask is used to identify other path segments after the first path segment on the standby path, and the ResetBitMask includes the The path ID that needs to be cleared, including the path identifier.
  • a message forwarding apparatus including: a first receiving module, configured to receive a message to be sent to a bit forwarding egress router BFER in a bit index display copy BIER-TE based on a traffic engineering extension, and a path identifier, where the path identifier is used to indicate a primary path and a backup path of the next hop BFR sent by the first bit forwarding router BFR to the first BFR; the first determining module is set to Determining, according to the path identifier, a bit string for forwarding the packet to the BFER; the first forwarding module is configured to fill the bit string in the packet, and forward the location according to the bit string Said message.
  • a packet forwarding apparatus including: a second receiving module, configured to receive a packet to be sent to a bit forwarding egress router BFER in a bit index display copy BIER-TE based on a traffic engineering extension; And the second forwarding module is configured to forward the packet according to the path identifier in the bit string filled in the packet, where the path identifier in the bit string is used to indicate that the packet is sent to the next The primary and backup paths of the BFR forwarding router.
  • a packet forwarding apparatus including: a second determining module, configured to determine a path identifier for performing packet forwarding, where the path identifier is used to indicate that the packet is first
  • the forwarding router BFR sends the primary path and the standby path to the next hop BFR of the first BFR; the sending module is configured to send the determined path identifier to the bit index display based on the traffic engineering extension to display the copy BIER-TE BFR in which the path identifier is used by the BFR to forward the message.
  • the embodiment of the invention further provides a computer readable storage medium storing computer executable instructions, which are implemented when executed by a processor.
  • a packet for transmitting a bit forwarding egress router BFER in a copy BIER-TE, and a path identifier, which is to be sent to a bit index based on a traffic engineering extension, is received, wherein the path identifier is used to indicate that the path is to be
  • the message is sent by the first forwarding router BFR to the primary path and the standby path of the next hop BFR of the first BFR; determining, according to the path identifier, a bit string for forwarding the message to the BFER; Filling the bit string in the message and forwarding the message according to the bit string.
  • FIG. 1 is a flowchart of a first packet forwarding method according to an embodiment of the present invention
  • FIG. 2 is a flowchart of a second packet forwarding method according to an embodiment of the present invention.
  • FIG. 3 is a flowchart of a third packet forwarding method according to an embodiment of the present invention.
  • FIG. 4 is a forwarding diagram of a BIER FRR packet according to a specific embodiment of the present invention.
  • FIG. 5 is a FRR forwarding table according to a specific embodiment of the present invention.
  • FIG. 6 is a forwarding diagram of a BIER FRR packet according to a second embodiment of the present invention.
  • FIG. 7 is a schematic diagram of a BIER-TE FRR networking in the related art
  • FIG. 9 is a forwarding diagram of a BIER FRR packet according to a third embodiment of the present invention.
  • FIG. 11 is a forwarding diagram of a BIER FRR packet according to a fourth embodiment of the present invention.
  • FIG. 12 is a structural block diagram of a first message forwarding apparatus according to an embodiment of the present invention.
  • FIG. 13 is a structural block diagram of a second packet forwarding apparatus according to an embodiment of the present invention.
  • FIG. 14 is a structural block diagram of a third message forwarding apparatus according to an embodiment of the present invention.
  • FIG. 1 is a flowchart of a first packet forwarding method according to an embodiment of the present invention. As shown in FIG. 1, the process includes the following steps:
  • Step S102 Receive a message to be sent to the bit forwarding forwarding router BFER in the BIER-TE based on the bit index of the traffic engineering extension, and a path identifier, where the path identifier is used to indicate that the packet is first The primary path and the standby path of the next hop BFR sent by the forwarding router BFR to the first BFR;
  • Step S104 determining, according to the path identifier, a bit string for forwarding the message to the BFER;
  • Step S106 the bit string is filled in the message, and the message is forwarded according to the bit string.
  • the above-mentioned operation may be a Bit-Forwarding Ingress Router (BFIR) in the BIER-TE.
  • the first BFR may be a BFIR and a Bit-Forwarding Egress Router (Bit-Forwarding Egress Routers).
  • the Bit Forwarding Router (BFR), which is abbreviated as BFER, may be composed of one or more path identifiers.
  • the path identifier can identify the primary path and the backup path for forwarding packets.
  • the content indicated by the path identifier can be configured according to the specific situation of the path, that is, the primary path and the standby path are performed.
  • the configuration can effectively solve the problem that the related technology cannot correctly and reasonably configure the path protection, thereby causing waste of resources, thereby achieving a reasonable and effective configuration path protection and avoiding the waste of resources.
  • the path identifier includes: adjacency identifier assigned by the main path and the standby path as a Fast Re-Route (FRR) adjacency. (Identification, referred to as ID). That is, the primary path and the standby path can be simultaneously represented by one identifier, so that it is not necessary to change the structure of the bit string, and the original bit string configuration mode can be used.
  • FRR Fast Re-Route
  • the primary path may form different fast reroute FRR adjacencies with different backup paths.
  • a primary path may correspond to more than two backup paths.
  • different primary paths may be configured for the primary path, thereby avoiding using only one type of backup. Path, the problem of idling other alternate paths.
  • the standby path includes a path composed of two or more segments, or the standby path includes a tree path.
  • the backup path type in this embodiment is only two examples, and other reasonable types of backup paths may also be used, which are not enumerated here.
  • forwarding the packet according to the bit string includes: forwarding the packet to the first BFR according to the bit string, where the first BFR is reported by the primary path when the primary path is determined to be normal. Forwarding to the next hop BFR of the first BFR; and/or, in the case of determining that the primary path is faulty, the first BFR forwards the message to the next hop BFR of the first BFR through the standby path.
  • the respective usage conditions of the foregoing active and standby paths are only an example, and the primary and secondary paths can be reasonably used under other conditions.
  • the primary path does not fail, but the load on the primary path exceeds a certain threshold. You can also use the standby path, or you can pre-configure the time range in which the primary path or the standby path is used.
  • the primary path is used to forward packets.
  • the standby path is used for packet forwarding.
  • the first BFR forwards the packet to the next hop BFR of the first BFR by using the standby path, where the first BFR replaces the path identifier in the bit string filled in the packet with the path identifier.
  • the identifier of the path is forwarded by the first BFR to the next hop BFR of the first BFR through the backup path according to the identifier of the standby path.
  • the path identifier is replaced with the identifier of the standby path, so that the next hop BFR is explicitly used to forward the packet, so that the packet is correctly forwarded.
  • the BIER-TE Forwarding Table (BIFT) corresponding to the path identifier includes the information of the primary path and the information of the standby path, where the primary path The information includes the outbound interface information on the primary path and/or the next hop forwarding router BFR information; and/or the information of the standby path includes the outbound interface information on the first path segment on the standby path and/or One-hop forwarding router BFR information, plus a new bit mask AddBitmask, clear bitmask ResetBitMask, where the AddBitmask is used to identify the backup path For other path segments after the first path segment on the path, ResetBitMask is the path identifier that needs to be cleared, including the path identifier.
  • AddBitmask clear bitmask ResetBitMask
  • the BIFT described above may be issued by the controller.
  • the path identifier may be sent by a controller.
  • FIG. 2 is a flowchart of a second packet forwarding method according to an embodiment of the present invention. As shown in FIG. 2, the process includes the following steps:
  • Step S202 receiving a message to be sent to the bit forwarding forwarding router BFER in the bit index display replication BIER-TE based on the traffic engineering extension;
  • Step S204 The packet is forwarded according to the path identifier in the bit string filled in the packet, where the path identifier in the bit string is used to indicate that the packet is sent to the primary path and the backup path of the next hop forwarding router BFR. .
  • the above operation may be BFR (for example, the first BFR described above) other than BFIR and BFER in the BIER-TE, and the bit string may be composed of one or more path identifiers.
  • the path identifier can identify the primary path and the backup path for forwarding packets.
  • the content indicated by the path identifier can be configured according to the specific situation of the path, that is, the primary path and the standby path are performed.
  • the configuration can effectively solve the problem that the related technology cannot correctly and reasonably configure the path protection, thereby causing waste of resources, thereby achieving a reasonable and effective configuration path protection and avoiding the waste of resources.
  • the path identifier includes: an adjacency identification ID assigned as an FRR adjacency as a whole of the primary path and the standby path. That is, the primary path and the standby path can be simultaneously represented by one identifier, so that it is not necessary to change the structure of the bit string, and the original bit string configuration mode can be used.
  • the primary path may form different fast reroute FRR adjacencies with different backup paths.
  • a primary path may correspond to more than two backup paths.
  • different primary paths may be configured for the primary path, thereby avoiding using only one type of backup. Path, the problem of idling other alternate paths.
  • the standby path includes a path composed of two or more segments.
  • the standby path includes a tree path.
  • the backup path type in this embodiment is only two examples, and other reasonable types of backup paths may also be used, which are not enumerated here.
  • forwarding the packet according to the path identifier in the bit string filled in the packet includes: forwarding the packet to the next hop through the primary path when the primary path is determined to be normal. BFR; and/or, in the case of determining that the primary path is faulty, the packet is forwarded to the next hop BFR through the standby path.
  • the primary and secondary paths can be reasonably used under other conditions. For example, when the primary path does not fail, but the load on the primary path exceeds a certain threshold, You can also use the standby path, or you can pre-configure the time range in which the primary path or the standby path is used. When the primary path is used, the primary path is used to forward packets. The standby path is used for packet forwarding.
  • forwarding the packet to the next hop BFR by using the backup path includes: replacing the path identifier in the bit string filled in the packet with the identifier of the standby path; The path forwards the packet to the next hop BFR.
  • the BIER-TE Forwarding Table (BIFT) corresponding to the path identifier includes the information of the primary path and the information of the standby path, where the primary path
  • the information includes the outbound interface information on the primary path and/or the next hop forwarding router BFR information; and/or the information of the standby path includes the outbound interface information on the first path segment on the standby path and/or One-bit forwarding router BFR information, and a new bit mask AddBitmask, clear bitmask ResetBitMask, wherein the AddBitmask is used to identify other path segments after the first path segment on the standby path, and ResetBitMask is included in the path identifier.
  • the path identifier within the need to be cleared.
  • the BIFT described above is issued by the controller.
  • FIG. 3 is a flowchart of a third packet forwarding method according to an embodiment of the present invention. As shown in FIG. 3, the process includes the following steps:
  • Step S302 determining a path identifier for performing packet forwarding, where the path identifier is used to indicate that the packet is sent by the first forwarding router BFR to the next hop forwarding route of the first BFR.
  • Step S304 The determined path identifier is sent to the BFR based on the traffic engineering extension to display the BFR in the replication BIER-TE, where the path identifier is used for the BFR forwarding packet.
  • the above operation may be performed by a controller.
  • the path identifier can identify the primary path and the backup path for forwarding packets.
  • the content indicated by the path identifier can be configured according to the specific situation of the path, that is, the primary path and the standby path are performed.
  • the configuration can effectively solve the problem that the related technology cannot correctly and reasonably configure the path protection, thereby causing waste of resources, thereby achieving a reasonable and effective configuration path protection and avoiding the waste of resources.
  • the path identifier includes: an identity of the adjacency (referred to as ID) assigned by the main path and the backup path as a Fast Re-Route (FRR) adjacency. . That is, the primary path and the standby path can be simultaneously represented by one identifier, so that it is not necessary to change the structure of the bit string, and the original bit string configuration mode can be used.
  • ID an identity of the adjacency assigned by the main path and the backup path
  • FRR Fast Re-Route
  • the primary path may form different fast reroute FRR adjacencies with different backup paths.
  • a primary path may correspond to more than two backup paths.
  • different primary paths may be configured for the primary path, thereby avoiding using only one type of backup. Path, the problem of idling other alternate paths.
  • the standby path includes a path composed of two or more segments, or the standby path includes a tree path.
  • the backup path type in this embodiment is only two examples, and other reasonable types of backup paths may also be used, which are not enumerated here.
  • the BIER-TE forwarding table BIFT corresponding to the path identifier carried in the bit string includes the information of the primary path and the information of the standby path, where the information of the primary path includes the outbound interface information on the primary path. And/or the next hop to forward the router BFR information; and/or the information of the standby path includes the outbound interface information on the first path segment on the standby path and/or the next hop forwarding router BFR information, and the new The addition bit mask AddBitmask and the clear bit mask ResetBitMask, wherein the AddBitmask is used to identify other path segments after the first path segment on the standby path, and ResetBitMask is the path identifier to be cleared including the path identifier.
  • the active/standby path as a whole is taken as one FRR adjacency, assign the corresponding adjacency id.
  • a primary path (generally just a direct link) can form different FRRs with different backup paths (paths or trees whose backup paths can be composed of multiple segments).
  • the corresponding FRR adjacency corresponding BIFT entry includes the primary and secondary forwarding information (the primary forwarding information is the outbound interface/next hop, and the standby forwarding information includes the outbound interface/next hop of the first segment. It also contains AddBitmask to indicate subsequent segments, and includes ResetBitMask to avoid duplicate replication of messages.
  • FIG. 4 is a forwarding diagram of a BIER FRR packet according to a specific embodiment of the present invention.
  • FIG. 5 is a FRR forwarding table according to a specific embodiment of the present invention.
  • Pxx represents a controller assigned to a link.
  • the bit, for example, P1 in Figure 4 represents the controller assigning P1 to the link of BFIR to BFR2
  • P2 represents the controller assigning P2 to the link of BFIR to BFR1
  • P12 represents the FRR of the controller from BFIR to BFR2 (main The path is BFIR-BFR2, and the backup path is BFIR-BFR1-BFR2).
  • the flow in this embodiment will be described below with reference to FIG. 4 and FIG. 5, including the following steps:
  • step S401 when the multicast data packet arrives at the BFIR node, the original BitString is generated as P2, P4, P9, P12, P5, P6, P7, and P8, as shown in FIG.
  • Step S402 the BFIR forwards the packet according to the BitString, and the BIFT table on the BFIR includes two entries: P2 and P12. Therefore, the messages match P2 and P12 respectively.
  • the BIFT table on the BFIR is shown in Figure 5.
  • the adjacency specified by the P2 entry is forwarded to the BFR1 through the link BFIR-BFR1, and the adjacency specified by the P12 entry is forwarded to the BFR2 through the link BFIR-BFR2.
  • BFIR finally copies two messages, one is forwarded to BFR1 through link BFIR-BFR1, and one is forwarded to BFR2 through link BFIR-BFR2. Both messages clear the P2 and P12 bits in BitString before sending.
  • Step S403 After receiving the multicast packet, the other BIER nodes also match the local forwarding entry of the BIER node through the packet, and after matching, forward the multicast packet according to the forwarding entry.
  • FIG. 6 is a forwarding diagram of a BIER FRR packet according to Embodiment 2 of the present invention.
  • Pxx represents a bit allocated by a controller to a link
  • P1 in FIG. 6 represents a controller as BFIR to BFR2.
  • the link assignment P1, P2 represents that the controller allocates P2 for the link of BFIR to BFR1
  • P12 represents that the controller allocates P12 for the FRR of BFIR to BFR2 (the primary path is BFIR-BFR2 and the backup path is BFIR-BFR1-BFR2).
  • the multicast packet can reach BFER1 and BFER2 through the alternate path BFIR-BFR1.
  • the FRR forwarding table in this embodiment may also be referred to FIG. 5.
  • the flow in this embodiment is described below with reference to FIG. 5 and FIG. 6.
  • the process includes the following steps:
  • step S501 when the multicast packet arrives at the BFIR node, the original BitString is generated as P2, P4, P9, P12, P5, P6, P7, and P8. As shown in Figure 6.
  • Step S502 the BFIR forwards the packet according to the BitString, and the BIFT table on the BFIR includes two entries: P2 and P12. Therefore, the packets match the P2 and P12 entries respectively.
  • the BIFT table on the BFIR is shown in Figure 5.
  • the adjacency specified by the P2 entry is forwarded to the BFR1 through the link BFIR-BFR1, and the adjacency specified by the P12 entry is forwarded to the BFR2 through the link BFIR-BFR2.
  • step S503 it is checked whether the primary path of P12 is faulty. If there is no fault, the process proceeds to S504. If there is a failure, go to S505.
  • step S504 the BFIR finally copies two messages, one of which is forwarded to the BFR1 through the link BFIR-BFR1, and one of which is forwarded to the BFR2 through the link BFIR-BFR2. Both messages clear the P2 and P12 bits in BitString before sending.
  • the other BIER nodes After receiving the multicast packet, the other BIER nodes also match the forwarding entry of the BIER node through the packet. After the matching, the packet is forwarded according to the forwarding entry.
  • step S505 the packet is sent to the standby adjacency.
  • the adjacency specified by the P12 entry is forwarded to the BFR2 through the alternate link BFIR-BFR1-BFR2. Before the packet is sent to the standby path, the bit P12 given in the ResetBitmask is cleared, and the bit P3 given in the AddBitmask is added.
  • BFIR finally duplicates two packets, one is forwarded to BFR1 through link BFIR-BFR1, and one is forwarded to BFR2 through link BFIR-BFR1. Both messages are cleared in BitString before being sent. P2, P12 bit, and set P4, P3 bit in BitString.
  • Step S506 After receiving the multicast packet, the other BIER nodes also match the local forwarding entry of the BIER node through the packet, and after matching, forward the multicast packet according to the forwarding entry.
  • the main purpose is to explicitly create a unique backup path for a link, so that the link can exist only in one FRR entry.
  • correct protection cannot be achieved.
  • FIG. 7 there are two alternate paths.
  • the correct FRR protection method is: when the primary link BFIR to BFR3 fails, it reaches BFER1 through the alternate path BFIR-BFR1, and reaches the exit node BFER2 through the alternate path BFIR-BFR2.
  • the current FRR protection method in the BIER-TE architecture draft is as follows: assume that the BitPosition of BFIR to BFR3 is 5. When detecting the failure of the primary link BFIR-BFR3, the Adjacency FRR entry is notified, indicating that the primary path has failed, and then the corresponding BitPosition of the failed primary path is recorded.
  • the Adjacency FRR is shown in Figure 8.
  • the BitPosition in the table is the BitPosition of the main path of the entire FRR.
  • the BitPosition is displayed in the BitString of the packet. When the packet is forwarded, it is required to check whether a BitPosition has the fault of the above record. If yes, the packet is sent to the standby member.
  • FIG. 9 is a forwarding diagram of a BIER FRR packet according to a third embodiment of the present invention.
  • FIG. 10 is a FRR forwarding table according to a third embodiment of the present invention.
  • Pxx represents a controller assigned to a link.
  • the bit such as P1 in Figure 9, represents the controller assigning P1 to the link of BFIR to BFR1
  • P4 represents the controller assigning P4 to the link of BFR1 to BFR3
  • P12 represents the FRR of the controller from BFIR to BFR3 (the primary path is BFIR-BFR3, the backup path is BFIR-BFR2-BFR3)
  • P12 is assigned
  • P13 represents P13, which is another FRR of the controller from BFIR to BFR3 (the main path is BFIR-BFR3, and the backup path is BFIR-BFR1-BFR3).
  • step S601 when the multicast packet arrives at the BFIR node, the original BitString is generated as P3, P6, P11, P12, P8, P10, P13, P7, and P9, as shown in FIG.
  • Step S602 the BFIR forwards the packet according to the BitString, and the BIFT table on the BFIR includes three entries: P3, P12, and P13. Therefore, the packets match the P3, P12, and P13 entries.
  • the BIFT table on the BFIR is shown in Figure 10.
  • the adjacency specified by the P3 entry is forwarded to the BFR2 through the link BFIR-BFR2.
  • the adjacency specified by the P12 entry is forwarded to the BFR3 through the link BFIR-BFR3, and the P13 entry is specified.
  • Adjacency is forwarded to BFR3 via link BFIR-BFR3.
  • BFIR finally copies two messages, one is forwarded to BFR2 through link BFIR-BFR2 (the share can be forwarded to BFER3), and one copy is forwarded to BFR3 through link BFIR-BFR3 (this copy can be copied by BFR3 again, Copy it into two copies, one forwarded to BFER1 and one forwarded to BFER2).
  • Both messages clear the P3, P12, and P13 bits in BitString before sending.
  • BFIR finally copies three messages, one forwards to BFR2 via link BFIR-BFR2 (the share can be forwarded to BFER3), and one forwards to BFR3 via link BFIR-BFR3 (this can be forwarded to BFER1)
  • One copy is forwarded to BFR3 via link BFIR-BFR3 (the share can be forwarded to BFER2).
  • Step S603 After receiving the multicast packet, the other BIER nodes also match the local forwarding entry of the BIER node by the packet, and after matching, forward the multicast packet according to the forwarding entry.
  • FIG. 11 is a forwarding diagram of a BIER FRR packet according to a fourth embodiment of the present invention.
  • the FRR forwarding table of this embodiment may refer to FIG. 10, and Pxx represents a bit allocated by the controller to the link, as shown in FIG.
  • P1 is assigned to the link of BFIR to BFR1
  • P4 represents P4 for the link of BFR1 to BFR3
  • P12 represents P12 for the pair of FRR of BFIR to BFR3
  • P13 represents BFIR to BFR3 for controller.
  • Another pair of FRRs is assigned P13.
  • the multicast packet can pass the alternate path.
  • BFIR-BFR1 arrives at BFER1 and the alternate path BFIR-BFR2 arrives at BFER2.
  • the process in this embodiment is described below, and the process includes the following steps:
  • step S701 when the multicast packet arrives at the BFIR node, the original BitString is generated as P3, P6, P11, P12, P8, P10, P13, P7, and P9. As shown in Figure 11.
  • Step S702 the BFIR forwards the packet according to the BitString, and the BIFT table on the BFIR includes three entries: P3, P12, and P13. Therefore, the packets match the P3, P12, and P13 entries.
  • the BIFT table on the BFIR is shown in Figure 10.
  • the adjacency specified by the P3 entry is forwarded to the BFR2 through the link BFIR-BFR2.
  • the adjacency specified by the P12 entry is forwarded to the BFR3 through the link BFIR-BFR3, and the P13 entry is specified.
  • Adjacency is forwarded to BFR3 via link BFIR-BFR3.
  • the BFIR is forwarded to the BFR2 through the link BFIR-BFR2 by matching the P3 entry.
  • step S704 it is checked whether the main path of P12 and P13 is faulty. If there is no fault, the process goes to S705, and if there is a fault, the process goes to S706.
  • step S705 the BFIR finally copies three messages, one is forwarded to the BFR2 through the link BFIR-BFR2 (the share can be forwarded to BFER3), and one copy is forwarded to the BFR3 through the link BFIR-BFR3 (the share can be forwarded to BFER1)
  • a copy is forwarded to BFR3 through the link BFIR-BFR3 (the share can be forwarded to BFER2), and the three messages clear the P3, P12, and P13 bits in the BitString before sending.
  • BFIR eventually copies two messages, one forwarded to BFR2 via link BFIR-BFR2 (the share can be forwarded to BFER3), and one forwarded to BFR3 via link BFIR-BFR3 (this copy can be replicated by BFR3) , copied into two copies, one forwarded to BFER1, one forwarded to BFER2), both messages clear the P3, P12, P13 bits in BitString before sending.
  • the other BIER nodes After receiving the multicast packet, the other BIER nodes also match the forwarding entry of the BIER node through the packet. After the matching, the packet is forwarded according to the forwarding entry.
  • step S706 the packet is sent to the standby adjacency.
  • the adjacency specified by the P12 entry is forwarded to the BFR3 through the alternate link BFIR-BFR2-BFR3. Before the packet is sent to the standby path, the bit P12 given in the ResetBitmask is cleared, and the bit P5 given in the AddBitmask is added.
  • the adjacency specified by the P13 entry is through the alternate link BFIR-BFR1-BFR3.
  • BFR3 forwards, before sending the packet to the standby member, clears the bit P12 given in the ResetBitmask and adds the bit P4 given in the AddBitmask.
  • BFIR finally copies three messages, one is forwarded to BFR2 via link BFIR-BFR2 (the share can be forwarded to BFER3), and one is forwarded to BFR3 via link BFIR-BFR1-BFR3 (the share can be forwarded to BFER1).
  • BFER3 One forwards to BFR3 via link BFIR-BFR2-BFR3 (the share can be forwarded to BFER2).
  • These three messages clear the P3, P12, and P13 bits in BitString and set P4 in BitString before sending. P5 bit.
  • BFIR eventually copies two messages, one of which is forwarded to BFR2 via link BFIR-BFR2 (this copy can be copied by BFR2, copied into two copies, one forwarded to BFER3, and one forwarded to BFER2 via BFR3)
  • Both messages clear P3, P12, P13 in BitString and set P4 in BitString before sending. , P5.
  • Step S707 After receiving the multicast packet, the other BIER nodes also match the local forwarding entry of the BIER node through the packet, and after matching, forward the multicast packet according to the forwarding entry.
  • the FRR entry generated in the fourth embodiment is for the scenario in which the link BFIR-BFR3 is invalid. In fact, for the scenario where the BFR3 fails, a similar FRR entry can be created, but the corresponding member of the FRR is given.
  • the AddBitMask will bypass the BFR3 node. Other processing is exactly the same as that of the fourth embodiment, and will not be described again.
  • the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is A better implementation.
  • the technical solution of the present invention which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk,
  • the optical disc includes a number of instructions for causing a terminal device (which may be a cell phone, a computer, a server, or a network device, etc.) to perform the methods described in various embodiments of the present invention.
  • a message forwarding device is also provided, which is used to implement the foregoing embodiments and preferred embodiments, and has not been described again.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 12 is a structural block diagram of a first message forwarding device according to an embodiment of the present invention. As shown in FIG. 12, the device includes a first receiving module 122, a first determining module 124, and a first forwarding module 126. The device is described.
  • the first receiving module 122 is configured to receive a packet to be sent to the bit forwarding forwarding router BFER in the bit index display replication BIER-TE based on the traffic engineering extension, and a path identifier, where the path identifier is used to indicate the packet a first path and a backup path sent by the first BFR to the next hop BFR of the first BFR;
  • the first determining module 124 is connected to the first receiving module 122, and is configured to determine, according to the path identifier, to forward the packet to
  • the first forwarding module 126 is connected to the first determining module 124, and is configured to fill the bit string in the packet and forward the packet according to the bit string.
  • the path identifier includes: an adjacency identification ID allocated by the primary path and the standby path as a fast reroute FRR adjacency.
  • the primary path has the capability to form different fast rerouted FRR adjacencies with different alternate paths.
  • the standby path includes a path composed of two or more segments, or the standby path includes a tree path.
  • the first forwarding module 126 may forward the packet according to the bit string by forwarding the packet to the first BFR according to the bit string, where the determining that the primary path is normal
  • the first BFR forwards the packet to the next hop BFR of the first BFR through the primary path; and/or, in the case of determining that the primary path is faulty, the first BFR forwards the packet to the first BFR through the standby path.
  • the first BFR forwarding the packet to the next hop BFR of the first BFR by using the standby path includes: the first BFR: the path identifier in the bit string filled in the packet The identifier is replaced with the identifier of the standby path. The first BFR forwards the packet to the next hop BFR of the first BFR through the backup path according to the identifier of the standby path.
  • the path identifier corresponding to the BIER-TE forwarding table BIFT includes the information of the primary path and the information of the standby path, where the information of the primary path includes the outbound interface information on the primary path and/or Or the next hop to forward the router BFR information; and/or the information of the backup path includes the outbound interface information on the first path segment on the standby path and/or the next hop forwarding router BFR information, and the newly added bit a mask AddBitmask, a clear bit mask ResetBitMask, where AddBitmask is used to identify other path segments after the first path segment on the standby path, and ResetBitMask is a path identifier to be cleared including the path identifier. .
  • the BIFT described above may be issued by the controller.
  • the path identifier may be sent by a controller.
  • FIG. 13 is a structural block diagram of a second packet forwarding apparatus according to an embodiment of the present invention. As shown in FIG. 13, the apparatus includes a second receiving module 132 and a second forwarding module 134, which will be described below.
  • the second receiving module 132 is configured to receive a packet to be sent to the bit forwarding forwarding router BFER in the bit index display copy BIER-TE based on the traffic engineering extension; the second forwarding module 134 is connected to the second receiving module 132, And the path identifier in the bit string is used to indicate that the packet is sent to the primary path and the backup path of the next hop forwarding router BFR.
  • the path identifier includes: an adjacency identification ID assigned as an FRR adjacency as a whole of the primary path and the standby path.
  • the primary path may form different fast reroute FRR adjacencies with different backup paths.
  • a primary path may correspond to more than two backup paths.
  • different primary paths may be configured for the primary path, thereby avoiding using only one type of backup. Path, the problem of idling other alternate paths.
  • the standby path includes a path composed of two or more segments, or the standby path includes a tree path.
  • the foregoing second forwarding module 134 may forward the packet according to the path identifier in the bit string filled in the packet in the following manner: in the case that the primary path is determined to be normal, the primary path is The packet is forwarded to the next hop BFR; and/or, in the case of determining that the primary path is faulty, the packet is forwarded to the next hop BFR through the standby path.
  • the second forwarding module 134 may forward the packet to the next hop BFR through the backup path by replacing the path identifier in the bit string filled in the packet with the identifier of the standby path. The packet is forwarded to the next hop BFR through the backup path according to the identifier of the standby path.
  • the BIER-TE Forwarding Table (BIFT) corresponding to the path identifier includes the information of the primary path and the information of the standby path, where the primary path
  • the information includes the outbound interface information on the primary path and/or the next hop forwarding router BFR information; and/or the information of the standby path includes the outbound interface information on the first path segment on the standby path and/or One-bit forwarding router BFR information, and a new bit mask AddBitmask, clear bitmask ResetBitMask, wherein the AddBitmask is used to identify other path segments after the first path segment on the standby path, and ResetBitMask is included in the path identifier.
  • the path identifier within the need to be cleared.
  • the BIFT described above is issued by the controller.
  • FIG. 14 is a structural block diagram of a third message forwarding device according to an embodiment of the present invention. As shown in FIG. 14, the device includes a second determining module 142 and a sending module 144, which will be described below.
  • the second determining module 142 is configured to determine a path identifier for performing packet forwarding, where the path identifier is used to indicate a primary path of sending a packet by the first forwarding router BFR to a next hop BFR of the first BFR, and
  • the backup path 144 is connected to the second determining module 142, and is configured to send the determined path identifier to the BFR based on the traffic engineering extension to display the BFR in the copy BIER-TE, where the path identifier is used for BFR forwards the packet.
  • the path identifier includes: an adjacency identification ID allocated by the primary path and the standby path as a fast reroute FRR adjacency.
  • the primary path has a different speed than the different backup paths.
  • the standby path includes a path composed of two or more segments, or the standby path includes a tree path.
  • the path identifier carried in the bit string corresponding to the BIER-TE forwarding table BIFT includes information of the primary path and information of the standby path, where the information of the primary path includes the primary path.
  • adding a bit mask AddBitmask, clear bit mask ResetBitMask wherein AddBitmask is used to identify other path segments after the first path segment on the standby path, and ResetBitMask is a path to be cleared including path identifier Logo.
  • each of the above modules may be implemented by software or hardware.
  • the foregoing may be implemented by, but not limited to, the foregoing modules are all located in the same processor; or, the modules are located in multiple In the processor.
  • Embodiments of the present invention also provide a storage medium.
  • the foregoing storage medium may be configured to store program code for performing the following steps:
  • Embodiments of the present invention also provide a storage medium.
  • the foregoing storage medium may be configured to store program code for performing the following steps:
  • the path identifier is forwarded according to the path in the bit string filled in the packet, where the path identifier in the bit string is used to indicate that the packet is sent to the primary path and the backup of the next hop forwarding router BFR. path.
  • Embodiments of the present invention also provide a storage medium.
  • the foregoing storage medium may be configured to store program code for performing the following steps:
  • the determined path identifier is sent to the BFR based on the traffic engineering extension to display the BFR in the replication BIER-TE, where the path identifier is used for the BFR forwarding packet.
  • the foregoing storage medium may include, but is not limited to, a USB flash drive, a Read-Only Memory (ROM), and a Random Access Memory (RAM).
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • the processor performs the above steps in accordance with the program code stored in the storage medium.
  • the specified path forwarding of the specific traffic can be completed in the BIER network, which makes up for the shortcoming that the BIER network cannot perform resource planning for the specific traffic and then forwards according to the specified path.
  • the application scenario and deployment environment of the BIER technology are greatly expanded.
  • the specified path forwarding function in the BIER network can be completed, which has good adaptability and development prospects.
  • each module/unit in the above embodiment may be implemented in the form of hardware, for example, by an integrated circuit to implement its corresponding function, It can be implemented in the form of a software function module, for example, by executing a program instruction stored in a memory by a processor to implement its corresponding function. This application is not limited to any specific combination of hardware and software.
  • the technical solution provided by the embodiment of the present invention receives a packet to be sent to the bit forwarding forwarding router BFER in the BIER-TE based on the bit index of the traffic engineering extension, and a path identifier, where the path identifier is used to indicate that Transmitting, by the first forwarding router BFR, a primary path and a backup path of the next hop BFR of the first BFR; determining, according to the path identifier, a bit for forwarding the packet to the BFER a string; the bit string is filled in the message, and the message is forwarded according to the bit string.

Landscapes

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

Abstract

本文公开了一种报文转发方法，该方法包括：接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文，以及路径标识，其中，该路径标识用于指示将上述报文由第一位转发路由器BFR发送到第一BFR的下一跳位BFR的主路径和备路径；根据上述路径标识确定用于将报文转发到BFER的位串；将上述位串填充在报文中，并根据上述位串转发报文。

Description

报文转发方法及装置 技术领域
本文涉及但不限于通信技术领域，尤其涉及的是一种报文转发方法及装置。
背景技术
随着软件定义网络(Software Defined Network，简称为SDN)技术和网络功能虚拟化(Network Function Virtualization，简称为NFV)在这些年的迅速发展，网络的部署可控性越来越强，控制复杂度也随之越来越高。尤其是像核心网络以及汇聚网络这样的中间网络，为了适配不同的业务，满足不同的部署需求，控制手段越来越繁杂。尤其是组播应用如多播虚拟专用网(Multicast Virtual Private Network，简称为MVPN)和交互式网络电视(Internet Protocol Television，简称为IPTV)等，需要的中间网络节点状态数量指数级增长。
为此，业界提出了一种新的用于构建组播转发路径的技术，称为具有位索引的显式复制技术(Bit Indexed Explicit Replication，简称为BIER)。BIER技术，通过对转发层面的彻底改造，能极大的减轻中间网络的协议复杂度和中间状态。将网络的转发简化成只根据比特bit位进行，颠覆了传统的互联网协议(Internet Protocol，简称为IP)转发，能够非常容易的实现组播流量在中间网络的传输，无需中间网络记录任何的组播流量状态，极大的方便了网络的运维。
BIER是基于bit位的组播复制技术，在BIER域中，给每台位转发出口路由器(Bit-Forwarding Egress Routers，简称为BFER)分配一个在整个BIER子域sub-domain中全局唯一的比特位置bit position，每台BFER将自己的bit position使用内部网关协议(Interior Gateway Protocol，简称为IGP)在BIER domain域中泛洪，所有的bit position组成一个位串(bitstring)，数据报文在BIER域中的传递和路由依赖于bitstring。当其他位转发路由器(Bit Forwarding Router，简称为BFR)收到了包含有BIER的报文头时，根据BIER报文头中 携带的bitstring基于位转发表Bit Forwarding Table进行转发。这种基于BIER bit位进行转发的原理大大减少网络的转发成本。
基于流量工程扩展的位索引显式复制(Bit Index Explicit Replication-Traffic Enginering，简称为BIER-TE)与BIER类似，根据报文头中的BitString转发和复制报文，但是BIER-TE与BIER的关键区别如下：
1)使用BIER-TE控制器计算的显式路径替代网络内的自动路径计算。
2)BitString中的每个bit position表示一个或多个邻接体adjacency，而不是表示一个BFER。
3)BFR上只需要有BIER-TE转发表Forwarding Table(BIFT)，不需要有路由表。
目前，相关技术中对BIER-TE中的路径进行保护的方式主要是针对为某个路径显式创建唯一的备份路径。而采用这种方案会导致该路径只能存在于一个FRR(Fast Re-Route，快速重路由)表项中。但是对于一个链路属于多个FRR表项时，会导致无法实现正确合理的配置路径保护，造成资源浪费的问题。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
本发明实施例提供了一种报文转发方法及装置，以至少解决相关技术中存在的不能正确合理的配置路径保护，从而造成资源浪费的问题。
一方面，提供了一种报文转发方法，包括：接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文，以及路径标识，其中，所述路径标识用于指示将所述报文由第一位转发路由器BFR发送到所述第一BFR的下一跳BFR的主路径和备路径；根据所述路径标识确定用于将所述报文转发到所述BFER的位串；将所述位串填充在所述报文中，并根据所述位串转发所述报文。
可选地，所述路径标识包括：以所述主路径和所述备路径整体作为一个 快速重路由FRR邻接体分配的邻接体标识ID。
可选地，所述主路径具备和不同的备路径形成不同的快速重路由FRR邻接体的能力。
可选地，所述备路径包括由两个以上的段组成的路径，或者，所述备路径包括树状路径。
可选地，根据所述位串转发所述报文包括：根据所述位串将所述报文转发给所述第一BFR，其中，在确定所述主路径正常的情况下，所述第一BFR通过所述主路径将所述报文转发给所述第一BFR的下一跳BFR；和/或，在确定所述主路径故障的情况下，所述第一BFR通过所述备路径将所述报文转发给所述第一BFR的下一跳BFR。
可选地，所述第一BFR通过所述备路径将所述报文转发给所述第一BFR的下一跳BFR包括：所述第一BFR将所述报文中填充的位串中的所述路径标识替换为所述备路径的标识；所述第一BFR根据所述备路径的标识通过所述备路径将所述报文转发给所述第一BFR的下一跳BFR。
可选地，所述路径标识对应的BIER-TE转发表BIFT中，包括所述主路径的信息和所述备路径的信息，其中，所述主路径的信息包括所述主路径上的出接口信息和/或所述下一跳BFR信息；和/或，所述备路径的信息包括所述备路径上的第一个路径段上的出接口信息和/或所述下一跳BFR信息，以及新增位掩码AddBitmask、清除位掩码ResetBitMask，其中，所述AddBitmask用于标识所述备路径上的所述第一个路径段之后的其他路径段，所述ResetBitMask为包括所述路径标识在内的需要清除的路径标识。
可选地，所述BIFT是由控制器下发的。
可选地，所述路径标识是由控制器下发的。
另一方面，提供了一种报文转发方法，包括：接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文；根据所述报文中填充的位串中的路径标识转发所述报文，其中，所述位串中的所述路径标识用于指示将所述报文发送到下一跳位转发路由器BFR的主路径和备路径。
可选地，所述路径标识包括：以所述主路径和所述备路径整体作为一个快速重路由FRR邻接体分配的邻接体标识ID。
可选地，所述主路径具备和不同的备路径形成不同的快速重路由FRR邻接体的能力。
可选地，所述备路径包括由两个以上的段组成的路径，或者，所述备路径包括树状路径。
可选地，根据所述报文中填充的位串中的路径标识转发所述报文包括：在确定所述主路径正常的情况下，通过所述主路径将所述报文转发给所述下一跳BFR；和/或，在确定所述主路径故障的情况下，通过所述备路径将所述报文转发给所述下一跳BFR。
可选地，通过所述备路径将所述报文转发给所述下一跳BFR包括：将所述报文中填充的位串中的所述路径标识替换为所述备路径的标识；根据所述备路径的标识通过所述备路径将所述报文转发给所述下一跳BFR。
可选地，所述路径标识对应的BIER-TE转发表BIFT中，包括所述主路径的信息和所述备路径的信息，其中，所述主路径的信息包括所述主路径上的出接口信息和/或所述下一跳BFR信息；和/或，所述备路径的信息包括所述备路径上的第一个路径段上的出接口信息和/或所述下一跳BFR信息，以及新增位掩码AddBitmask、清除位掩码ResetBitMask，其中，所述AddBitmask用于标识所述备路径上的所述第一个路径段之后的其他路径段，所述ResetBitMask为包括所述路径标识在内的需要清除的路径标识。
可选地，所述BIFT是由控制器下发的。
另一方面，提供了一种报文转发方法，包括：确定用于进行报文转发的路径标识，其中，所述路径标识用于指示将所述报文由第一转发路由器BFR发送到所述第一BFR的下一跳BFR的主路径和备路径；将确定的所述路径标识下发给基于流量工程扩展的位索引显示复制BIER-TE中的BFR，其中，所述路径标识用于所述BFR转发所述报文。
可选地，所述路径标识包括：以所述主路径和所述备路径整体作为一个快速重路由FRR邻接体分配的邻接体标识ID。
可选地，所述主路径具备和不同的备路径形成不同的快速重路由FRR邻接体的能力。
可选地，所述备路径包括由两个以上的段组成的路径或者，所述备路径包括树状路径。
可选地，所述路径标识对应的BIER-TE转发表BIFT中，包括所述主路径的信息和所述备路径的信息，其中，所述主路径的信息包括所述主路径上的出接口信息和/或下一跳位转发路由器BFR信息；和/或，所述备路径的信息包括所述备路径上的第一个路径段上的出接口信息和/或下一跳位转发路由器BFR信息，以及新增位掩码AddBitmask、清除位掩码ResetBitMask，其中，所述AddBitmask用于标识所述备路径上的所述第一个路径段之后的其他路径段，所述ResetBitMask为包括所述路径标识在内的需要清除的路径标识。
另一方面，提供了一种报文转发装置，包括：第一接收模块，设置为接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文，以及路径标识，其中，所述路径标识用于指示将所述报文由第一位转发路由器BFR发送到所述第一BFR的下一跳BFR的主路径和备路径；第一确定模块，设置为根据所述路径标识确定用于将所述报文转发到所述BFER的位串；第一转发模块，设置为将所述位串填充在所述报文中，并根据所述位串转发所述报文。
另一方面，提供了一种报文转发装置，包括：第二接收模块，设置为接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文；第二转发模块，设置为根据所述报文中填充的位串中的路径标识转发所述报文，其中，所述位串中的所述路径标识用于指示将所述报文发送到下一跳位转发路由器BFR的主路径和备路径。
另一方面，提供了一种报文转发装置，包括：第二确定模块，设置为确定用于进行报文转发的路径标识，其中，所述路径标识用于指示将所述报文由第一转发路由器BFR发送到所述第一BFR的下一跳BFR的主路径和备路径；下发模块，设置为将确定的所述路径标识下发给基于流量工程扩展的位索引显示复制BIER-TE中的BFR，其中，所述路径标识用于所述BFR转发所述报文。
本发明实施例还提供一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令被处理器执行时实现上述方法。
通过本发明实施例，采用接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文，以及路径标识，其中，所述路径标识用于指示将所述报文由第一位转发路由器BFR发送到所述第一BFR的下一跳BFR的主路径和备路径；根据所述路径标识确定用于将所述报文转发到所述BFER的位串；将所述位串填充在所述报文中，并根据所述位串转发所述报文。解决了相关技术中存在的不能正确合理的配置路径保护，从而造成资源浪费的问题，进而达到了合理有效的配置路径保护，避免资源浪费的效果。
在阅读并理解了附图和详细描述后，可以明白其他方面。
附图概述
图1是根据本发明实施例的第一种报文转发方法的流程图；
图2是根据本发明实施例的第二种报文转发方法的流程图；
图3是根据本发明实施例的第三种报文转发方法的流程图；
图4是根据本发明具体实施例一提出的BIER FRR报文的转发图；
图5是根据本发明具体实施例一提出的FRR转发表；
图6是根据本发明具体实施例二提出的BIER FRR报文的转发图；
图7是相关技术中的BIER-TE FRR组网示意图；
图8是相关技术中的Adjacency FRR表项；
图9是根据本发明具体实施例三提出的BIER FRR报文的转发图；
图10是根据本发明具体实施例三提出的FRR转发表；
图11是根据本发明具体实施例四提出的BIER FRR报文的转发图；
图12是根据本发明实施例的第一种报文转发装置的结构框图；
图13是根据本发明实施例的第二种报文转发装置的结构框图；
图14是根据本发明实施例的第三种报文转发装置的结构框图。
本发明的实施方式
下文中将结合附图对本发明的实施例进行详细说明。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互任意组合。
在本实施例中提供了一种报文转发方法，图1是根据本发明实施例的第一种报文转发方法的流程图，如图1所示，该流程包括如下步骤：
步骤S102，接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文，以及路径标识，其中，该路径标识用于指示将上述报文由第一位转发路由器BFR发送到第一BFR的下一跳位BFR的主路径和备路径；
步骤S104，根据上述路径标识确定用于将报文转发到BFER的位串；
步骤S106，将上述位串填充在报文中，并根据上述位串转发报文。
其中，执行上述操作的可以是BIER-TE中的位转发入口路由器(Bit-Forwarding Ingress Router，简称为BFIR)，上述的第一BFR可以是除BFIR和位转发出口路由器(Bit-Forwarding Egress Routers，简称为BFER)之外的位转发路由器(Bit Forwarding Router，简称为BFR)，上述的位串可以是由一个或多个路径标识组成。
通过上述步骤，路径标识可以同时标识用于转发报文的主路径和备路径，在实际配置时，可以根据路径的具体情况进行路径标识所指示的内容的配置，即，进行主路径和备路径的配置，从而可以有效解决相关技术中存在的不能正确合理的配置路径保护，从而造成资源浪费的问题，进而达到了合理有效的配置路径保护，避免资源浪费的效果。
在一个可选的实施例中，上述路径标识包括：以主路径和备路径整体作为一个快速重路由(Fast Re-Route，简称为FRR)邻接体分配的邻接体标识 (Identification，简称为ID)。即，可以用一个标识同时表示主路径和备路径，从而无需对位串的构造进行变动，沿用原有的位串配置方式即可。
在一个可选的实施例中，上述主路径可以和不同的备路径形成不同的快速重路由FRR邻接体。在本实施例中，一条主路径可以对应两条以上的备路径，当通过该主路径到达不同的下一跳BFR时，可以为该主路径配置不同的备路径，从而避免仅使用一种备路径，闲置其他备路径的问题。
在一个可选的实施例中，上述备路径包括由两个以上的段组成的路径，或者，上述备路径包括树状路径。需要说明的是，本实施例中的备路径类型仅是两种示例，还可以采用其他的合理的类型的备路径，在此不一一列举。
在一个可选的实施例中，根据上述位串转发报文包括：根据位串将报文转发给第一BFR，其中，在确定上述主路径正常的情况下，第一BFR通过主路径将报文转发给第一BFR的下一跳BFR；和/或，在确定主路径故障的情况下，第一BFR通过备路径将报文转发给第一BFR的下一跳BFR。当然，上述的主备路径的各自使用条件仅是一种示例，还可以在其他的条件下合理使用主备路径，例如，当主路径未发生故障，但是主路径上的负载超过一定的阈值时，也可以使用备路径，或者，也可以预先配置使用主路径或备路径的时间段，当处于使用主路径的时间段中时，使用主路径进行报文转发，当处于使用备路径的时间段中时，使用备路径进行报文转发。
在一个可选的实施例中，第一BFR通过上述备路径将报文转发给第一BFR的下一跳BFR包括：第一BFR将报文中填充的位串中的上述路径标识替换为备路径的标识；第一BFR根据上述备路径的标识通过备路径将报文转发给第一BFR的下一跳BFR。将上述的路径标识替换为备路径的标识可以使得下一跳BFR明确用于转发报文的路径，从而实现报文的正确转发。
在一个可选的实施例中，上述路径标识对应的BIER-TE转发表(BIER-TE Forwarding Table，简称为BIFT)中，包括有上述主路径的信息和备路径的信息，其中，该主路径的信息包括主路径上的出接口信息和/或下一跳位转发路由器BFR信息；和/或，上述备路径的信息包括备路径上的第一个路径段上的出接口信息和/或下一跳位转发路由器BFR信息，以及新增位掩码AddBitmask、清除位掩码ResetBitMask，其中，该AddBitmask用于标识备路 径上的第一个路径段之后的其他路径段，ResetBitMask为包括路径标识在内的需要清除的路径标识。
在一个可选的实施例中，上述BIFT可以是由控制器下发的。
在一个可选的实施例中，上述路径标识可以是由控制器下发的。
在本实施例中还提供了一种报文转发方法，图2是根据本发明实施例的第二种报文转发方法的流程图，如图2所示，该流程包括如下步骤：
步骤S202，接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文；
步骤S204，根据上述报文中填充的位串中的路径标识转发报文，其中，该位串中的路径标识用于指示将报文发送到下一跳位转发路由器BFR的主路径和备路径。
其中，执行上述操作的可以是BIER-TE中的除BFIR和BFER之外的BFR(例如，上述的第一BFR)，上述的位串可以是由一个或多个路径标识组成。
通过上述步骤，路径标识可以同时标识用于转发报文的主路径和备路径，在实际配置时，可以根据路径的具体情况进行路径标识所指示的内容的配置，即，进行主路径和备路径的配置，从而可以有效解决相关技术中存在的不能正确合理的配置路径保护，从而造成资源浪费的问题，进而达到了合理有效的配置路径保护，避免资源浪费的效果。
在一个可选的实施例中，上述路径标识包括：以主路径和备路径整体作为一个FRR邻接体分配的邻接体标识ID。即，可以用一个标识同时表示主路径和备路径，从而无需对位串的构造进行变动，沿用原有的位串配置方式即可。
在一个可选的实施例中，上述主路径可以和不同的备路径形成不同的快速重路由FRR邻接体。在本实施例中，一条主路径可以对应两条以上的备路径，当通过该主路径到达不同的下一跳BFR时，可以为该主路径配置不同的备路径，从而避免仅使用一种备路径，闲置其他备路径的问题。
在一个可选的实施例中，上述备路径包括由两个以上的段组成的路径， 或者，上述备路径包括树状路径。需要说明的是，本实施例中的备路径类型仅是两种示例，还可以采用其他的合理的类型的备路径，在此不一一列举。
在一个可选的实施例中，根据上述报文中填充的位串中的路径标识转发上述报文包括：在确定所述主路径正常的情况下，通过主路径将报文转发给下一跳BFR；和/或，在确定主路径故障的情况下，通过备路径将报文转发给下一跳BFR。当然，上述的主备路径的各自使用条件仅是一种示例，还可以在其他的条件下合理使用主备路径，例如，当主路径未发生故障，但是主路径上的负载超过一定的阈值时，也可以使用备路径，或者，也可以预先配置使用主路径或备路径的时间段，当处于使用主路径的时间段中时，使用主路径进行报文转发，当处于使用备路径的时间段中时，使用备路径进行报文转发。
在一个可选的实施例中，通过备路径将报文转发给下一跳BFR包括：将报文中填充的位串中的路径标识替换为备路径的标识；根据上述备路径的标识通过备路径将报文转发给下一跳BFR。
在一个可选的实施例中，上述路径标识对应的BIER-TE转发表(BIER-TE Forwarding Table，简称为BIFT)中，包括有上述主路径的信息和备路径的信息，其中，该主路径的信息包括主路径上的出接口信息和/或下一跳位转发路由器BFR信息；和/或，上述备路径的信息包括备路径上的第一个路径段上的出接口信息和/或下一跳位转发路由器BFR信息，以及新增位掩码AddBitmask、清除位掩码ResetBitMask，其中，该AddBitmask用于标识备路径上的第一个路径段之后的其他路径段，ResetBitMask为包括路径标识在内的需要清除的路径标识。
在一个可选的实施例中，上述BIFT是由控制器下发的。
在本实施例中还提供了一种报文转发方法，图3是根据本发明实施例的第三种报文转发方法的流程图，如图3所示，该流程包括如下步骤：
步骤S302，确定用于进行报文转发的路径标识，其中，该路径标识用于指示将报文由第一转发路由器BFR发送到该第一BFR的下一跳位转发路由 器BFR的主路径和备路径；
步骤S304，将确定的上述路径标识下发给基于流量工程扩展的位索引显示复制BIER-TE中的BFR，其中，该路径标识用于BFR转发报文。
其中，执行上述操作的可以是控制器。
通过上述步骤，路径标识可以同时标识用于转发报文的主路径和备路径，在实际配置时，可以根据路径的具体情况进行路径标识所指示的内容的配置，即，进行主路径和备路径的配置，从而可以有效解决相关技术中存在的不能正确合理的配置路径保护，从而造成资源浪费的问题，进而达到了合理有效的配置路径保护，避免资源浪费的效果。
在一个可选的实施例中，上述路径标识包括：以主路径和备路径整体作为一个快速重路由(Fast Re-Route，简称为FRR)邻接体分配的邻接体标识(Identification，简称为ID)。即，可以用一个标识同时表示主路径和备路径，从而无需对位串的构造进行变动，沿用原有的位串配置方式即可。
在一个可选的实施例中，上述主路径可以和不同的备路径形成不同的快速重路由FRR邻接体。在本实施例中，一条主路径可以对应两条以上的备路径，当通过该主路径到达不同的下一跳BFR时，可以为该主路径配置不同的备路径，从而避免仅使用一种备路径，闲置其他备路径的问题。
在一个可选的实施例中，上述备路径包括由两个以上的段组成的路径，或者，上述备路径包括树状路径。需要说明的是，本实施例中的备路径类型仅是两种示例，还可以采用其他的合理的类型的备路径，在此不一一列举。
可选地，上述位串中携带的路径标识对应的BIER-TE转发表BIFT中，包括上述主路径的信息和上述备路径的信息，其中，上述主路径的信息包括主路径上的出接口信息和/或下一跳位转发路由器BFR信息；和/或，上述备路径的信息包括备路径上的第一个路径段上的出接口信息和/或下一跳位转发路由器BFR信息，以及新增位掩码AddBitmask、清除位掩码ResetBitMask，其中，该AddBitmask用于标识备路径上的第一个路径段之后的其他路径段，ResetBitMask为包括路径标识在内的需要清除的路径标识。
由上述的实施例可知，在本发明实施例中是以主备路径整体作为一个 FRR adjacency，分配相应adjacency id。则一条主路径(一般仅仅是直连链路)可以和不同的备路径(备份路径可以由多个段组成的path或tree)形成不同的FRR。可选地，在相应的FRR adjacency对应的BIFT表项中，包括主备转发信息(主转发信息就是出接口/下一跳，备转发信息除了包含第一个段的出接口/下一跳以外，还包含AddBitmask表示后续其它段，以及包含ResetBitMask避免报文重复复制)。
下面结合具体实施例对本发明进行说明：
具体实施例一
图4是根据本发明具体实施例一提出的BIER FRR报文的转发图，图5是根据本发明具体实施例一提出的FRR转发表，如图4所示，Pxx代表控制器分配给链路的比特位，例如，图4中的P1代表控制器为BFIR至BFR2的链路分配P1，P2代表控制器为BFIR至BFR1的链路分配P2，P12代表控制器为BFIR至BFR2的FRR(主路径为BFIR-BFR2，备路径为BFIR-BFR1-BFR2)分配P12。下面结合图4和图5对本实施例中的流程进行说明，包括如下步骤：
步骤S401，组播数据包到达BFIR节点时，生成原始BitString为P2，P4，P9，P12，P5，P6，P7，P8，如图4所示。
步骤S402，BFIR根据上述BitString对报文进行转发，BFIR上的BIFT表包括两个表项：P2，P12。所以报文分别匹配P2，P12。
BFIR上的BIFT表如图5所示，P2表项指定的adjacency为通过链路BFIR-BFR1向BFR1转发，P12表项指定的adjacency为通过链路BFIR-BFR2向BFR2转发。则BFIR最终复制两份报文，一份通过链路BFIR-BFR1向BFR1转发，一份通过链路BFIR-BFR2向BFR2转发。这两份报文在发送前都清除BitString中的P2，P12位。
步骤S403，其他的BIER节点接收到组播报文后，同样通过报文匹配BIER节点本地的转发表项，匹配后，按照转发表项转发组播报文。
具体实施例二
图6根据本发明具体实施例二提出的BIER FRR报文的转发图，如图6所示，Pxx代表控制器分配给链路的比特位，如图6中的P1代表控制器为BFIR至BFR2的链路分配P1，P2代表控制器为BFIR至BFR1的链路分配P2，P12代表控制器为BFIR至BFR2的FRR(主路径为BFIR-BFR2，备路径为BFIR-BFR1-BFR2)分配P12。当通过BFIR到达BFR2的路径出现故障后，组播数据包可以通过备用路径BFIR-BFR1到达BFER1及BFER2。本实施例中的FRR转发表也可以参考图5，下面结合图5和图6对本实施例中的流程进行说明，该流程包括如下步骤：
步骤S501，组播数据包到达BFIR节点时，生成原始BitString为P2，P4，P9，P12，P5，P6，P7，P8。如图6所示。
步骤S502，BFIR根据上述BitString对报文进行转发，BFIR上的BIFT表包括两个表项：P2，P12。所以报文分别匹配P2，P12表项。
BFIR上的BIFT表如图5所示，P2表项指定的adjacency为通过链路BFIR-BFR1向BFR1转发，P12表项指定的adjacency为通过链路BFIR-BFR2向BFR2转发。
步骤S503，检查P12的主用路径是否出现故障，如果没有故障，则转向S504。如果出现故障，则转向S505。
步骤S504，BFIR最终复制两份报文，一份通过链路BFIR-BFR1向BFR1转发，一份通过链路BFIR-BFR2向BFR2转发。这两份报文在发送前都清除BitString中的P2，P12位。其他的BIER节点接收到组播报文后，同样通过报文匹配BIER节点本地的转发表项，匹配后，按照转发表项转发组播报文。
步骤S505，将报文向备adjacency发送。
P12表项指定的adjacency为通过备用链路BFIR-BFR1-BFR2向BFR2转发，在将报文向备路径发送出去之前，清除ResetBitmask中给出的位P12，添加AddBitmask中给出的位P3。
BFIR最终复制两份报文，一份通过链路BFIR-BFR1向BFR1转发，一份通过链路BFIR-BFR1向BFR2转发。这两份报文在发送前都清除BitString中 的P2，P12位，并设置了BitString中的P4，P3位。
步骤S506，其他的BIER节点接收到组播报文后，同样通过报文匹配BIER节点本地的转发表项，匹配后，按照转发表项转发组播报文。
在相关技术中，主要是针对为某个链路显式创建唯一的备份路径，从而导致该链路只能存在于一个FRR表项中。但是对于一个链路属于多个FRR表现时，却不能实现正确的保护。如图7所示，存在两条备用路径，正确的FRR保护方法是：当主用链路BFIR到BFR3出现故障后，通过备用路径BFIR-BFR1到达BFER1，通过备用路径BFIR-BFR2到达出口节点BFER2。
但是目前BIER-TE架构草案中的FRR保护方法如：假设BFIR到BFR3的BitPosition为5。当检测主链路BFIR-BFR3出现故障时，Adjacency FRR表项被通知到，表明其主路径出现了故障，则记下出故障的主路径相应的BitPosition。Adjacency FRR如图8所示。表中的BitPosition是整个FRR的主路径的BitPosition。该BitPosition出现于报文的BitString中，报文在转发时需要检查某个BitPosition是否出现了上述记录的故障，是的话，则将报文向备成员发送出去，发送之前，清除ResetBitmask(失效adjacency的BitPosition)中给出的位，添加AddBitmask(本端BFR至对端BFR的备份路径)中给出的位。但是采用这种方法会出现的问题就是对于BFIR-BFR3只有一条备用路径。也就是到达BFER1及到达BFER2都走备用路径BFIR-BFR2-BFR3路径。这样就废弃了BFIR-BFR1-BFR3这条路径。这样是不合理的。在本发明实施例中，针对上述问题也提出了解决方案，下面结合具体实施例三-五进行说明：
具体实施例三
图9根据本发明具体实施例三提出的BIER FRR报文的转发图，图10是根据本发明具体实施例三提出的FRR转发表，如图9所示，Pxx代表控制器分配给链路的比特位，如图9中的P1代表控制器为BFIR至BFR1的链路分配P1，P4代表控制器为BFR1至BFR3的链路分配P4,P12代表控制器为BFIR至BFR3的FRR(主路径为BFIR-BFR3，备路径为BFIR-BFR2-BFR3) 分配P12，P13代表控制器为BFIR至BFR3的另一FRR(主路径为BFIR-BFR3，备路径为BFIR-BFR1-BFR3)分配P13。下面对本实施例中的流程进行说明，包括如下步骤：
步骤S601，组播数据包到达BFIR节点时，生成原始BitString为P3，P6，P11，P12，P8，P10，P13，P7，P9，如图9所示。
步骤S602，BFIR根据上述BitString对报文进行转发，BFIR上的BIFT表包括三个表项：P3，P12，P13。所以报文分别匹配P3，P12及P13表项。
BFIR上的BIFT表如图10所示，P3表项指定的adjacency为通过链路BFIR-BFR2向BFR2转发，P12表项指定的adjacency为通过链路BFIR-BFR3向BFR3转发，P13表项指定的adjacency为通过链路BFIR-BFR3向BFR3转发。则BFIR最终复制两份报文，一份通过链路BFIR-BFR2向BFR2转发(该份可以转发到BFER3)，一份通过链路BFIR-BFR3向BFR3转发(该份可以再由BFR3进行复制，复制成两份，一份转发到BFER1，一份转发到BFER2)。这两份报文在发送前都清除BitString中的P3,P12,P13位。或者，则BFIR最终复制三份报文，一份通过链路BFIR-BFR2向BFR2转发(该份可以转发到BFER3)，一份通过链路BFIR-BFR3向BFR3转发(该份可以转发到BFER1)，一份通过链路BFIR-BFR3向BFR3转发(该份可以转发到BFER2)。这三份报文在发送前都清除BitString中的P3,P12,P13位。
步骤S603，其他的BIER节点接收到组播报文后，同样通过报文匹配BIER节点本地的转发表项，匹配后，按照转发表项转发组播报文。
具体实施例四
图11是根据本发明具体实施例四提出的BIER FRR报文的转发图，本实施例的FRR转发表可以参考图10，Pxx代表控制器分配给链路的比特位，如图11中的P1代表控制器为BFIR至BFR1的链路分配P1，P4代表控制器为BFR1至BFR3的链路分配P4,P12代表控制器为BFIR至BFR3的一对FRR分配P12，P13代表控制器为BFIR至BFR3的另一对FRR分配P13。当通过BFIR到达BFR3的路径出现故障后，组播数据包可以通过备用路径 BFIR-BFR1到达BFER1，备用路径BFIR-BFR2到达BFER2。下面对本实施例中的流程进行说明，该流程包括如下步骤：
步骤S701，组播数据包到达BFIR节点时，生成原始BitString为P3，P6，P11，P12，P8，P10，P13，P7，P9。如图11所示。
步骤S702，BFIR根据上述BitString对报文进行转发，BFIR上的BIFT表包括三个表项：P3，P12，P13。所以报文分别匹配P3，P12及P13表项。
BFIR上的BIFT表如图10所示，P3表项指定的adjacency为通过链路BFIR-BFR2向BFR2转发，P12表项指定的adjacency为通过链路BFIR-BFR3向BFR3转发，P13表项指定的adjacency为通过链路BFIR-BFR3向BFR3转发。
BFIR通过匹配P3表项，通过链路BFIR-BFR2向BFR2转发。
步骤S704，检查P12与P13的主用路径是否出现故障，如果没有故障，则转向S705，如果出现故障，则转向S706。
步骤S705，BFIR最终复制三份报文，一份通过链路BFIR-BFR2向BFR2转发(该份可转发到BFER3)，一份通过链路BFIR-BFR3向BFR3转发(该份可转发到BFER1)，一份通过链路BFIR-BFR3向BFR3转发(该份可转发到BFER2)，这三份报文在发送前都清除BitString中的P3,P12,P13位。或者，BFIR最终复制两份报文，一份通过链路BFIR-BFR2向BFR2转发(该份可转发到BFER3)，一份通过链路BFIR-BFR3向BFR3转发(该份可以再由BFR3进行复制，复制成两份，一份转发到BFER1，一份转发到BFER2)，这两份报文在发送前都清除BitString中的P3,P12,P13位。其他的BIER节点接收到组播报文后，同样通过报文匹配BIER节点本地的转发表项，匹配后，按照转发表项转发组播报文。
步骤S706，将报文向备adjacency发送。
P12表项指定的adjacency为通过备用链路BFIR-BFR2-BFR3向BFR3转发，在将报文向备路径发送出去之前，清除ResetBitmask中给出的位P12，添加AddBitmask中给出的位P5。
同样，P13表项指定的adjacency为通过备用链路BFIR-BFR1-BFR3向 BFR3转发，在将报文向备成员发送出去之前，清除ResetBitmask中给出的位P12，添加AddBitmask中给出的位P4。
BFIR最终复制三份报文，一份通过链路BFIR-BFR2向BFR2转发(该份可转发到BFER3)，一份通过链路BFIR-BFR1-BFR3向BFR3转发(该份可转发到BFER1)，一份通过链路BFIR-BFR2-BFR3向BFR3转发(该份可转发到BFER2)，这三份报文在发送前都清除BitString中的P3,P12,P13位，并设置了BitString中的P4,P5位。或者，BFIR最终复制两份报文，一份通过链路BFIR-BFR2向BFR2转发(该份可以再由BFR2进行复制，复制成两份，一份转发到BFER3，一份通过BFR3转发到BFER2)，一份通过链路BFIR-BFR1-BFR3向BFR3转发(该份可转发到BFER1)，这两份报文在发送前都清除BitString中的P3,P12,P13位，并设置了BitString中的P4,P5位。
步骤S707，其他的BIER节点接收到组播报文后，同样通过报文匹配BIER节点本地的转发表项，匹配后，按照转发表项转发组播报文。
具体实施例五
具体实施例四中生成的FRR表项针对的是链路BFIR-BFR3失效的场景，实际上，针对节点BFR3失效的场景，同样可创建类似的FRR表项，只不过FRR相应的备成员里给出的AddBitMask将绕过BFR3节点。其它处理与具体实施例四完全相同，不再赘述。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本发明的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本发明各个实施例所述的方法。
在本实施例中还提供了一种报文转发装置，该装置用于实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图12是根据本发明实施例的第一种报文转发装置的结构框图，如图12所示，该装置包括第一接收模块122、第一确定模块124和第一转发模块126，下面对该装置进行说明。
第一接收模块122，设置为接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文，以及路径标识，其中，该路径标识用于指示将报文由第一BFR发送到第一BFR的下一跳BFR的主路径和备路径；第一确定模块124，连接至上述第一接收模块122，设置为根据上述路径标识确定用于将报文转发到BFER的位串；第一转发模块126，连接至上述第一确定模块124，设置为将上述位串填充在报文中，并根据位串转发报文。
在一个可选的实施例中，上述路径标识包括：以主路径和备路径整体作为一个快速重路由FRR邻接体分配的邻接体标识ID。
在一个可选的实施例中，上述主路径具备和不同的备路径形成不同的快速重路由FRR邻接体的能力。
在一个可选的实施例中，上述备路径包括由两个以上的段组成的路径，或者，备路径包括树状路径。
在一个可选的实施例中，上述第一转发模块126可以通过如下方式根据上述位串转发报文：根据位串将报文转发给第一BFR，其中，在确定上述主路径正常的情况下，第一BFR通过主路径将报文转发给第一BFR的下一跳BFR；和/或，在确定主路径故障的情况下，第一BFR通过备路径将报文转发给第一BFR的下一跳BFR。
在一个可选的实施例中，上述第一BFR通过上述备路径将报文转发给第一BFR的下一跳BFR包括：第一BFR将报文中填充的位串中的上述路径标 识替换为备路径的标识；第一BFR根据上述备路径的标识通过备路径将报文转发给第一BFR的下一跳BFR。
在一个可选的实施例中，上述路径标识对应的BIER-TE转发表BIFT中，包括主路径的信息和备路径的信息，其中，该主路径的信息包括主路径上的出接口信息和/或下一跳位转发路由器BFR信息；和/或，该备路径的信息包括备路径上的第一个路径段上的出接口信息和/或下一跳位转发路由器BFR信息，以及新增位掩码AddBitmask、清除位掩码ResetBitMask，其中，AddBitmask用于标识所述备路径上的所述第一个路径段之后的其他路径段，ResetBitMask为包括所述路径标识在内的需要清除的路径标识。
在一个可选的实施例中，上述BIFT可以是由控制器下发的。
在一个可选的实施例中，上述路径标识可以是由控制器下发的。
图13是根据本发明实施例的第二种报文转发装置的结构框图，如图13所示，该装置包括第二接收模块132和第二转发模块134，下面对该装置进行说明。
第二接收模块132，设置为接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文；第二转发模块134，连接至上述第二接收模块132，设置为根据上述报文中填充的位串中的路径标识转发报文，其中，该位串中的路径标识用于指示将报文发送到下一跳位转发路由器BFR的主路径和备路径。
在一个可选的实施例中，上述路径标识包括：以主路径和备路径整体作为一个FRR邻接体分配的邻接体标识ID。
在一个可选的实施例中，上述主路径可以和不同的备路径形成不同的快速重路由FRR邻接体。在本实施例中，一条主路径可以对应两条以上的备路径，当通过该主路径到达不同的下一跳BFR时，可以为该主路径配置不同的备路径，从而避免仅使用一种备路径，闲置其他备路径的问题。
在一个可选的实施例中，上述备路径包括由两个以上的段组成的路径，或者，上述备路径包括树状路径。
在一个可选的实施例中，上述第二转发模块134可以通过如下方式根据上述报文中填充的位串中的路径标识转发上述报文：在确定主路径正常的情况下，通过主路径将报文转发给下一跳BFR；和/或，在确定主路径故障的情况下，通过备路径将报文转发给下一跳BFR。
在一个可选的实施例中，上述第二转发模块134可以通过如下方式通过备路径将报文转发给下一跳BFR：将报文中填充的位串中的路径标识替换为备路径的标识；根据上述备路径的标识通过备路径将报文转发给下一跳BFR。
在一个可选的实施例中，上述路径标识对应的BIER-TE转发表(BIER-TE Forwarding Table，简称为BIFT)中，包括有上述主路径的信息和备路径的信息，其中，该主路径的信息包括主路径上的出接口信息和/或下一跳位转发路由器BFR信息；和/或，上述备路径的信息包括备路径上的第一个路径段上的出接口信息和/或下一跳位转发路由器BFR信息，以及新增位掩码AddBitmask、清除位掩码ResetBitMask，其中，该AddBitmask用于标识备路径上的第一个路径段之后的其他路径段，ResetBitMask为包括路径标识在内的需要清除的路径标识。
在一个可选的实施例中，上述BIFT是由控制器下发的。
图14是根据本发明实施例的第三种报文转发装置的结构框图，如图14所示，该装置包括第二确定模块142和下发模块144，下面对该装置进行说明。
第二确定模块142，设置为确定用于进行报文转发的路径标识，其中，该路径标识用于指示将报文由第一转发路由器BFR发送到第一BFR的下一跳BFR的主路径和备路径；下发模块144，连接至上述第二确定模块142，设置为将确定的路径标识下发给基于流量工程扩展的位索引显示复制BIER-TE中的BFR，其中，该路径标识用于BFR转发报文。
在一个可选的实施例中，上述路径标识包括：以主路径和备路径整体作为一个快速重路由FRR邻接体分配的邻接体标识ID。
在一个可选的实施例中，上述主路径具备和不同的备路径形成不同的快 速重路由FRR邻接体的能力。
在一个可选的实施例中，上述备路径包括由两个以上的段组成的路径，或者，上述备路径包括树状路径。
在一个可选的实施例中，上述位串中携带的路径标识对应的BIER-TE转发表BIFT中，包括主路径的信息和备路径的信息，其中，该主路径的信息包括主路径上的出接口信息和/或下一跳位转发路由器BFR信息；和/或，上述备路径的信息包括备路径上的第一个路径段上的出接口信息和/或下一跳位转发路由器BFR信息，以及新增位掩码AddBitmask、清除位掩码ResetBitMask，其中，AddBitmask用于标识备路径上的所述第一个路径段之后的其他路径段，ResetBitMask为包括路径标识在内的需要清除的路径标识。
需要说明的是，上述各个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述模块分别位于多个处理器中。
本发明的实施例还提供了一种存储介质。可选地，在本实施例中，上述存储介质可以被设置为存储用于执行以下步骤的程序代码：
S1，接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文，以及路径标识，其中，该路径标识用于指示将上述报文由第一位转发路由器BFR发送到第一BFR的下一跳位BFR的主路径和备路径；
S2，根据上述路径标识确定用于将报文转发到BFER的位串；
S3，将上述位串填充在报文中，并根据上述位串转发报文。
本发明的实施例还提供了一种存储介质。可选地，在本实施例中，上述存储介质可以被设置为存储用于执行以下步骤的程序代码：
S1，接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文；
S2，根据上述报文中填充的位串中的路径标识转发报文，其中，该位串中的路径标识用于指示将报文发送到下一跳位转发路由器BFR的主路径和备 路径。
本发明的实施例还提供了一种存储介质。可选地，在本实施例中，上述存储介质可以被设置为存储用于执行以下步骤的程序代码：
S1，确定用于进行报文转发的路径标识，其中，该路径标识用于指示将报文由第一转发路由器BFR发送到该第一BFR的下一跳位转发路由器BFR的主路径和备路径；
S2，将确定的上述路径标识下发给基于流量工程扩展的位索引显示复制BIER-TE中的BFR，其中，该路径标识用于BFR转发报文。
可选地，在本实施例中，上述存储介质可以包括但不限于：U盘、只读存储器(Read-Only Memory，简称为ROM)、随机存取存储器(Random Access Memory，简称为RAM)、移动硬盘、磁碟或者光盘等各种可以存储程序代码的介质。
可选地，在上述涉及存储介质的实施例中，处理器根据存储介质中已存储的程序代码执行上述各步骤。
可选地，上述涉及存储介质的实施例中的具体示例可以参考上述实施例及可选实施方式中所描述的示例，不再赘述。
通过上述各个实施例可知，通过本发明，可以在BIER网络内，完成特定流量的指定路径转发，弥补了BIER网络内无法对特定流量进行资源规划后，依照指定路径进行转发的缺点。极大的扩展了BIER技术的适用场景和部署环境，对组播流量和单播流量，都能完成在BIER网络的指定路径转发功能，具有良好的适应性和发展前景。
本领域普通技术人员可以理解上述方法中的全部或部分步骤可通过程序来指令相关硬件(例如处理器)完成，所述程序可以存储于计算机可读存储介质中，如只读存储器、磁盘或光盘等。可选地，上述实施例的全部或部分步骤也可以使用一个或多个集成电路来实现。相应地，上述实施例中的各模块/单元可以采用硬件的形式实现，例如通过集成电路来实现其相应功能，也 可以采用软件功能模块的形式实现，例如通过处理器执行存储于存储器中的程序指令来实现其相应功能。本申请不限制于任何特定形式的硬件和软件的结合。
需要说明的是，本申请还可有其他多种实施例，在不背离本申请精神及其实质的情况下，熟悉本领域的技术人员可根据本申请作出各种相应的改变和变形，但这些相应的改变和变形都应属于本申请所附的权利要求的保护范围。
工业实用性
本发明实施例提供的技术方案，接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文，以及路径标识，其中，所述路径标识用于指示将所述报文由第一位转发路由器BFR发送到所述第一BFR的下一跳BFR的主路径和备路径；根据所述路径标识确定用于将所述报文转发到所述BFER的位串；将所述位串填充在所述报文中，并根据所述位串转发所述报文。解决了相关技术中存在的不能正确合理的配置路径保护，从而造成资源浪费的问题，进而达到了合理有效的配置路径保护，避免资源浪费的效果。

Claims (25)

  1. 一种报文转发方法，包括：
    接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文，以及路径标识，其中，所述路径标识用于指示将所述报文由第一位转发路由器BFR发送到所述第一BFR的下一跳BFR的主路径和备路径；
    根据所述路径标识确定用于将所述报文转发到所述BFER的位串；
    将所述位串填充在所述报文中，并根据所述位串转发所述报文。
  2. 根据权利要求1所述的方法，其中：
    所述路径标识包括：
    以所述主路径和所述备路径整体作为一个快速重路由FRR邻接体分配的邻接体标识ID。
  3. 根据权利要求1或2所述的方法，其中：
    所述主路径具备和不同的备路径形成不同的快速重路由FRR邻接体的能力。
  4. 根据权利要求1或2所述的方法，其中：
    所述备路径包括由两个以上的段组成的路径，或者，所述备路径包括树状路径。
  5. 根据权利要求1所述的方法，其中：
    根据所述位串转发所述报文包括：
    根据所述位串将所述报文转发给所述第一BFR，其中，在确定所述主路径正常的情况下，所述第一BFR通过所述主路径将所述报文转发给所述第一BFR的下一跳BFR；和/或，在确定所述主路径故障的情况下，所述第一BFR通过所述备路径将所述报文转发给所述第一BFR的下一跳BFR。
  6. 根据权利要求5所述的方法，其中：
    所述第一BFR通过所述备路径将所述报文转发给所述第一BFR的下一 跳BFR包括：
    所述第一BFR将所述报文中填充的位串中的所述路径标识替换为所述备路径的标识；
    所述第一BFR根据所述备路径的标识通过所述备路径将所述报文转发给所述第一BFR的下一跳BFR。
  7. 根据权利要求1至6中任一项所述的方法，其中：
    所述路径标识对应的BIER-TE转发表BIFT中，包括所述主路径的信息和所述备路径的信息，其中，
    所述主路径的信息包括所述主路径上的出接口信息和/或所述下一跳BFR信息；和/或，
    所述备路径的信息包括所述备路径上的第一个路径段上的出接口信息和/或所述下一跳BFR信息，以及新增位掩码AddBitmask、清除位掩码ResetBitMask，其中，所述AddBitmask用于标识所述备路径上的所述第一个路径段之后的其他路径段，所述ResetBitMask为包括所述路径标识在内的需要清除的路径标识。
  8. 根据权利要求7所述的方法，其中：
    所述BIFT是由控制器下发的。
  9. 根据权利要求1至8中任一项所述的方法，其中：
    所述路径标识是由控制器下发的。
  10. 一种报文转发方法，包括：
    接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文；
    根据所述报文中填充的位串中的路径标识转发所述报文，其中，所述位串中的所述路径标识用于指示将所述报文发送到下一跳位转发路由器BFR的主路径和备路径。
  11. 根据权利要求10所述的方法，其中：
    所述路径标识包括：
    以所述主路径和所述备路径整体作为一个快速重路由FRR邻接体分配的邻接体标识ID。
  12. 根据权利要求10或11所述的方法，其中：
    所述主路径具备和不同的备路径形成不同的快速重路由FRR邻接体的能力。
  13. 根据权利要求10或11所述的方法，其中：
    所述备路径包括由两个以上的段组成的路径，或者，所述备路径包括树状路径。
  14. 根据权利要求10所述的方法，其中：
    根据所述报文中填充的位串中的路径标识转发所述报文包括：
    在确定所述主路径正常的情况下，通过所述主路径将所述报文转发给所述下一跳BFR；和/或，
    在确定所述主路径故障的情况下，通过所述备路径将所述报文转发给所述下一跳BFR。
  15. 根据权利要求14所述的方法，其中：
    通过所述备路径将所述报文转发给所述下一跳BFR包括：
    将所述报文中填充的位串中的所述路径标识替换为所述备路径的标识；
    根据所述备路径的标识通过所述备路径将所述报文转发给所述下一跳BFR。
  16. 根据权利要求10至15中任一项所述的方法，其中：
    所述路径标识对应的BIER-TE转发表BIFT中，包括所述主路径的信息和所述备路径的信息，其中，
    所述主路径的信息包括所述主路径上的出接口信息和/或所述下一跳BFR信息；和/或，
    所述备路径的信息包括所述备路径上的第一个路径段上的出接口信息和/或所述下一跳BFR信息，以及新增位掩码AddBitmask、清除位掩码ResetBitMask，其中，所述AddBitmask用于标识所述备路径上的所述第一个 路径段之后的其他路径段，所述ResetBitMask为包括所述路径标识在内的需要清除的路径标识。
  17. 根据权利要求16所述的方法，其中：
    所述BIFT是由控制器下发的。
  18. 一种报文转发方法，包括：
    确定用于进行报文转发的路径标识，其中，所述路径标识用于指示将所述报文由第一转发路由器BFR发送到所述第一BFR的下一跳BFR的主路径和备路径；
    将确定的所述路径标识下发给基于流量工程扩展的位索引显示复制BIER-TE中的BFR，其中，所述路径标识用于所述BFR转发所述报文。
  19. 根据权利要求18所述的方法，其中：
    所述路径标识包括：
    以所述主路径和所述备路径整体作为一个快速重路由FRR邻接体分配的邻接体标识ID。
  20. 根据权利要求18或19所述的方法，其中：
    所述主路径具备和不同的备路径形成不同的快速重路由FRR邻接体的能力。
  21. 根据权利要求18或19所述的方法，其中：
    所述备路径包括由两个以上的段组成的路径或者，所述备路径包括树状路径。
  22. 根据权利要求18至21中任一项所述的方法，其中：
    所述路径标识对应的BIER-TE转发表BIFT中，包括所述主路径的信息和所述备路径的信息，其中，
    所述主路径的信息包括所述主路径上的出接口信息和/或下一跳位转发路由器BFR信息；和/或，
    所述备路径的信息包括所述备路径上的第一个路径段上的出接口信息和/或下一跳位转发路由器BFR信息，以及新增位掩码AddBitmask、清除位掩 码ResetBitMask，其中，所述AddBitmask用于标识所述备路径上的所述第一个路径段之后的其他路径段，所述ResetBitMask为包括所述路径标识在内的需要清除的路径标识。
  23. 一种报文转发装置，包括：
    第一接收模块，设置为接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文，以及路径标识，其中，所述路径标识用于指示将所述报文由第一位转发路由器BFR发送到所述第一BFR的下一跳BFR的主路径和备路径；
    第一确定模块，设置为根据所述路径标识确定用于将所述报文转发到所述BFER的位串；
    第一转发模块，设置为将所述位串填充在所述报文中，并根据所述位串转发所述报文。
  24. 一种报文转发装置，包括：
    第二接收模块，设置为接收待发送到基于流量工程扩展的位索引显示复制BIER-TE中的位转发出口路由器BFER的报文；
    第二转发模块，设置为根据所述报文中填充的位串中的路径标识转发所述报文，其中，所述位串中的所述路径标识用于指示将所述报文发送到下一跳位转发路由器BFR的主路径和备路径。
  25. 一种报文转发装置，包括：
    第二确定模块，设置为确定用于进行报文转发的路径标识，其中，所述路径标识用于指示将所述报文由第一转发路由器BFR发送到所述第一BFR的下一跳BFR的主路径和备路径；
    下发模块，设置为将确定的所述路径标识下发给基于流量工程扩展的位索引显示复制BIER-TE中的BFR，其中，所述路径标识用于所述BFR转发所述报文。
PCT/CN2016/094210 2016-03-08 2016-08-09 报文转发方法及装置 WO2017152576A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US16/083,242 US10547538B2 (en) 2016-03-08 2016-08-09 Packet forwarding method and apparatus
EP16893221.8A EP3429143B1 (en) 2016-03-08 2016-08-09 Packet forwarding method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610130354.7A CN107171977B (zh) 2016-03-08 2016-03-08 报文转发方法及装置
CN201610130354.7 2016-03-08

Publications (1)

Publication Number Publication Date
WO2017152576A1 true WO2017152576A1 (zh) 2017-09-14

Family

ID=59789931

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/094210 WO2017152576A1 (zh) 2016-03-08 2016-08-09 报文转发方法及装置

Country Status (4)

Country Link
US (1) US10547538B2 (zh)
EP (1) EP3429143B1 (zh)
CN (1) CN107171977B (zh)
WO (1) WO2017152576A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11502896B2 (en) * 2018-04-18 2022-11-15 Zte Corporation Network failure protection method, system, and storage medium

Families Citing this family (36)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9806897B2 (en) 2013-09-17 2017-10-31 Cisco Technology, Inc. Bit indexed explicit replication forwarding optimization
US10218524B2 (en) 2013-09-17 2019-02-26 Cisco Technology, Inc. Bit indexed explicit replication for layer 2 networking
WO2015042152A1 (en) * 2013-09-17 2015-03-26 Cisco Technology, Inc. Bit indexed explicit replication using multiprotocol label switching
US10003494B2 (en) 2013-09-17 2018-06-19 Cisco Technology, Inc. Per-prefix LFA FRR with bit indexed explicit replication
US11451474B2 (en) 2013-09-17 2022-09-20 Cisco Technology, Inc. Equal cost multi-path with bit indexed explicit replication
US9906378B2 (en) 2015-01-27 2018-02-27 Cisco Technology, Inc. Capability aware routing
US10341221B2 (en) 2015-02-26 2019-07-02 Cisco Technology, Inc. Traffic engineering for bit indexed explicit replication
US10630743B2 (en) 2016-09-23 2020-04-21 Cisco Technology, Inc. Unicast media replication fabric using bit indexed explicit replication
US10637675B2 (en) 2016-11-09 2020-04-28 Cisco Technology, Inc. Area-specific broadcasting using bit indexed explicit replication
US10447496B2 (en) 2017-03-30 2019-10-15 Cisco Technology, Inc. Multicast traffic steering using tree identity in bit indexed explicit replication (BIER)
US10164794B2 (en) 2017-04-28 2018-12-25 Cisco Technology, Inc. Bridging of non-capable subnetworks in bit indexed explicit replication
CN109660460B (zh) * 2017-10-10 2021-10-19 中兴通讯股份有限公司 Bier-te信息的处理方法、服务器及存储介质
CN108337176B (zh) * 2017-12-27 2021-04-20 华为技术有限公司 一种报文处理方法和装置
EP3750284A1 (en) 2018-02-23 2020-12-16 Huawei Technologies Co., Ltd. Advertising and programming preferred path routes using interior gateway protocols
US10587495B2 (en) * 2018-03-21 2020-03-10 Nokia Solutions And Networks Oy Hierarchical bit indexed replication of multicast packets
US10581624B2 (en) * 2018-03-21 2020-03-03 Nokia Solutions And Networks Oy Hierarchical bit indexed replication of multicast packets
WO2019190699A1 (en) 2018-03-28 2019-10-03 Futurewei Technologies, Inc. Method and apparatus for preferred path route information distribution and maintenance
CN110324263B (zh) * 2018-03-30 2021-06-29 华为技术有限公司 传输组播报文的方法、设备和系统
CN110401599B (zh) * 2018-04-25 2022-08-02 中兴通讯股份有限公司 数据包的处理方法及装置、存储介质、电子装置
EP3785405A1 (en) 2018-04-26 2021-03-03 Huawei Technologies Co., Ltd. Resource reservation and maintenance for preferred path routes in a network
WO2019212678A1 (en) * 2018-05-04 2019-11-07 Futurewei Technologies, Inc. Explicit backups and fast re-route mechanisms for preferred path routes in a network
CN110535675B (zh) * 2018-05-25 2022-03-01 中兴通讯股份有限公司 一种组播快速切换的方法及装置
WO2019236221A1 (en) 2018-06-04 2019-12-12 Futurewei Technologies, Inc. Preferred path route graphs in a network
CN113726666B (zh) * 2018-06-27 2022-11-18 华为技术有限公司 一种发送报文的方法和装置
CN111131053B (zh) * 2018-10-30 2021-09-14 中国电信股份有限公司 路径选择方法和装置及路由器
CN111147372B (zh) 2018-11-05 2021-05-18 华为技术有限公司 下行报文发送、转发方法和装置
CN112311668B (zh) * 2019-07-26 2022-03-29 华为技术有限公司 一种处理bier报文的方法、网络设备及系统
CN110266587B (zh) * 2019-08-14 2019-12-13 华为技术有限公司 一种链路状态信息的处理方法及装置
CN113162855B (zh) * 2020-01-22 2022-12-27 华为技术有限公司 组播报文检测方法、网络设备和系统
CN113472672A (zh) * 2020-03-30 2021-10-01 华为技术有限公司 一种报文转发方法及装置
CN112491729A (zh) * 2020-09-22 2021-03-12 中兴通讯股份有限公司 一种数据处理方法、装置、存储介质及电子装置
CN114520762B (zh) * 2020-10-30 2023-09-12 华为技术有限公司 BIERv6报文的发送方法以及第一网络设备
EP4248630A1 (en) * 2020-12-18 2023-09-27 Huawei Technologies Co., Ltd. Bit index explicit replication traffic engineering egress protection
EP4252400A1 (en) * 2020-12-21 2023-10-04 Huawei Technologies Co., Ltd. Bit index explicit replication traffic engineering fast reroute
WO2022147162A1 (en) * 2020-12-30 2022-07-07 Futurewei Technologies, Inc. Bit index explicit replication traffic engineering for broadcast link
CN113992564B (zh) * 2021-09-17 2023-03-31 新华三信息安全技术有限公司 报文处理方法及装置

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104811387A (zh) * 2014-01-24 2015-07-29 思科技术公司 具有位索引显式复制的等价多路径

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9571897B2 (en) 2013-09-17 2017-02-14 Cisco Technology, Inc. Bit indexed explicit replication for professional media networks
WO2015042152A1 (en) 2013-09-17 2015-03-26 Cisco Technology, Inc. Bit indexed explicit replication using multiprotocol label switching
US9806897B2 (en) 2013-09-17 2017-10-31 Cisco Technology, Inc. Bit indexed explicit replication forwarding optimization
US11451474B2 (en) 2013-09-17 2022-09-20 Cisco Technology, Inc. Equal cost multi-path with bit indexed explicit replication
US10461946B2 (en) 2013-09-17 2019-10-29 Cisco Technology, Inc. Overlay signaling for bit indexed explicit replication
US9544230B2 (en) 2013-09-17 2017-01-10 Cisco Technology, Inc. Migration support for bit indexed explicit replication
US10003494B2 (en) 2013-09-17 2018-06-19 Cisco Technology, Inc. Per-prefix LFA FRR with bit indexed explicit replication
US9438432B2 (en) 2013-09-17 2016-09-06 Cisco Technology, Inc. Bit indexed explicit replication packet encapsulation
US10218524B2 (en) * 2013-09-17 2019-02-26 Cisco Technology, Inc. Bit indexed explicit replication for layer 2 networking
US10341221B2 (en) * 2015-02-26 2019-07-02 Cisco Technology, Inc. Traffic engineering for bit indexed explicit replication

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104811387A (zh) * 2014-01-24 2015-07-29 思科技术公司 具有位索引显式复制的等价多路径

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"Multicast using Bit Index Explicit Replication", INTERNET ENGINEERING TASK FORCE INTERNET -DRAFT INTENDED STATUS, 7 September 2015 (2015-09-07), XP015124074 *
"Traffic Enginering for Bit Index Explicit Replication BIER-TE", NETWORK WORKING GROUP INTERNET -DRAFT INTENDED STATUS, 6 September 2015 (2015-09-06), XP015107276 *
See also references of EP3429143A4 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11502896B2 (en) * 2018-04-18 2022-11-15 Zte Corporation Network failure protection method, system, and storage medium

Also Published As

Publication number Publication date
US10547538B2 (en) 2020-01-28
CN107171977B (zh) 2021-08-17
EP3429143A4 (en) 2019-01-30
EP3429143B1 (en) 2020-02-19
US20190116114A1 (en) 2019-04-18
EP3429143A1 (en) 2019-01-16
CN107171977A (zh) 2017-09-15

Similar Documents

Publication Publication Date Title
WO2017152576A1 (zh) 报文转发方法及装置
US10693765B2 (en) Failure protection for traffic-engineered bit indexed explicit replication
CN112422307B (zh) Evpn和vpls共存双活的方法、设备及系统
JP2022186731A (ja) 伝送経路故障を処理するための方法と装置、及びシステム
US11349749B2 (en) Node protection for bum traffic for multi-homed node failure
JP5549949B2 (ja) マルチキャストパケット送信方法、関連デバイスおよびシステム
WO2019205806A1 (zh) 数据包的处理方法及装置、存储介质、电子装置
WO2017143738A1 (zh) 报文发送方法及装置
US11962491B2 (en) Source routing tunnel ingress protection
KR100636273B1 (ko) 이더넷을 통한 ｍｐｌｓ 멀티캐스트 패킷 전송 장치 및 방법
EP3806404A1 (en) Communication method, device and system for avoiding loop
CN112134776B (zh) 生成组播转发表项的方法和接入网关
CN107968753B (zh) 修改媒体接入控制地址转发表的方法和装置
US10666558B2 (en) Automatic alignment of roles of routers in networks
WO2021022945A1 (zh) 一种内部网关协议泛洪优化方法及装置、存储介质
WO2021000619A1 (zh) 报文转发方法及装置
EP1964330A1 (en) Method for reducing fault detection time in a telecommunication network
WO2022088931A1 (zh) 信息处理方法及其装置、宽带接入服务器、存储介质
CN110417666B (zh) 一种基于Head modify技术的分组封装和传输方法
WO2017054471A1 (zh) 一种指定路由器的选举方法及装置
CN108540343B (zh) 路径的检测方法及装置
CN112511443A (zh) 消息处理方法、装置、设备、存储介质及系统
WO2022257798A1 (zh) 转发方法、转发系统、电子设备和计算机可读存储介质
WO2024067367A1 (zh) 用于确定节点的方法及装置
CN115765939A (zh) 基于IPSec传输的冗余保护方法及存储介质

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2016893221

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2016893221

Country of ref document: EP

Effective date: 20181008

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

Ref document number: 16893221

Country of ref document: EP

Kind code of ref document: A1