[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

WO2022257798A1 - 转发方法、转发系统、电子设备和计算机可读存储介质 - Google Patents

转发方法、转发系统、电子设备和计算机可读存储介质 Download PDF

Info

Publication number
WO2022257798A1
WO2022257798A1 PCT/CN2022/095891 CN2022095891W WO2022257798A1 WO 2022257798 A1 WO2022257798 A1 WO 2022257798A1 CN 2022095891 W CN2022095891 W CN 2022095891W WO 2022257798 A1 WO2022257798 A1 WO 2022257798A1
Authority
WO
WIPO (PCT)
Prior art keywords
forwarding
message
forwarded
header
information
Prior art date
Application number
PCT/CN2022/095891
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 EP22819396.7A priority Critical patent/EP4340319A4/en
Priority to BR112023025756A priority patent/BR112023025756A2/pt
Priority to US18/568,934 priority patent/US20240291748A1/en
Publication of WO2022257798A1 publication Critical patent/WO2022257798A1/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/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering
    • 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
    • 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/17—Shortcut routing, e.g. using next hop resolution protocol [NHRP]
    • 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/34—Source 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H04L45/507—Label distribution
    • 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/74—Address processing for routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/22—Parsing or analysis of headers
    • 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/325—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the network layer [OSI layer 3], e.g. X.25

Definitions

  • the embodiments of the present application relate to the technical field of communications, and in particular, to a forwarding method, a forwarding system, electronic equipment, and a computer-readable storage medium.
  • BIER Bit Index explicit replication technology
  • BIER technology lacks the ability to specify path forwarding. Even if the traffic engineering-based bit index explicit replication technology (Tree Engineering for Bit Index Explicit Replication, referred to as: BIER-TE) is used, it can only specify some nodes to a certain extent. Certain bits cannot be erased, so there may be situations in the network where certain bits are carried in multiple packets, which fundamentally destroys the mechanism of BIER technology to prevent duplicate packets in the network.
  • BIER-TE Traffic engineering-based bit index explicit replication technology
  • An embodiment of the present application provides a forwarding method, which is applied to an intermediate node forwarding router, and the method includes: obtaining a message to be forwarded, and detecting whether the message to be forwarded contains a preset flag; wherein, the preset The mark is used to indicate that the message to be forwarded has a specified forwarding path; if the message to be forwarded contains a preset mark, obtain the bit index of the message to be forwarded and explicitly copy the information of the protocol header after the BIER header; where , the information of the protocol header is at least used to indicate the specified forwarding path; according to the information of the protocol header, determine the next hop; according to the next hop, search the BIER forwarding table, and forward the message to be forwarded.
  • the embodiment of the present application also provides a forwarding method, which is applied to an ingress node bit forwarding router (Bit Forwarding Ingress Router, referred to as: BFIR), and the method includes: obtaining a multicast message from a multicast source; Policy table, determine the specified forwarding path of the message of the multicast source multicast; encapsulate the specified forwarding path in the protocol header after the bit index of the message explicitly copies the BIER header; encapsulate the BIER header , and adding a preset flag to the multicast message of the multicast source to obtain the message to be forwarded.
  • Bit Forwarding Ingress Router referred to as: BFIR
  • Embodiments of the present application also provide a forwarding method, which is applied to an egress node bit forwarding router (Bit Forwarding Egress Router, referred to as: BFER), and the method includes: obtaining a message to be forwarded; analyzing the message to be forwarded, Obtaining the bit index of the message to be forwarded and explicitly copying the information of the protocol header after the BIER header; wherein, the information of the protocol header is at least used to indicate the specified forwarding path of the message to be forwarded; according to the protocol header information, and send the message to be forwarded to the receiver.
  • BFER egress node bit forwarding router
  • the embodiment of the present application also provides a forwarding system, including: an entry node bit forwarding router, an intermediate node bit forwarding router, and an egress node bit forwarding router.
  • An embodiment of the present application also provides an electronic device, including: at least one processor; and a memory connected in communication with the at least one processor; wherein, the memory stores information that can be executed by the at least one processor. instructions, the instructions are executed by the at least one processor, so that the at least one processor can execute the above-mentioned forwarding method applied to the intermediate node bit-forwarding router, or execute the above-mentioned forwarding method applied to the ingress node bit-forwarding router , or execute the above-mentioned forwarding method applied to the egress node bit-forwarding router.
  • the embodiment of the present application also provides a computer-readable storage medium, which stores a computer program.
  • the computer program is executed by a processor, the above-mentioned forwarding method applied to the intermediate node bit forwarding router is implemented, or the above-mentioned application to the ingress node is implemented.
  • FIG. 1 is a flowchart 1 of a forwarding method according to an embodiment of the present application
  • FIG. 2 is a schematic diagram of a multicast network structure provided in an embodiment of the present application.
  • FIG. 3 is a second flowchart of a forwarding method according to another embodiment of the present application.
  • FIG. 4 is a third flowchart of a forwarding method according to another embodiment of the present application.
  • FIG. 5 is a flowchart 4 of a forwarding method according to another embodiment of the present application.
  • FIG. 6 is a schematic structural diagram of a segment routing header provided in another embodiment of the present application.
  • FIG. 7 is a schematic structural diagram of a BIER head provided in another embodiment of the present application.
  • FIG. 8 is a schematic structural diagram of a message to be forwarded according to another embodiment of the present application.
  • FIG. 9 is a flowchart five of a forwarding method according to another embodiment of the present application.
  • FIG. 10 is a schematic diagram of a forwarding system according to another embodiment of the present application.
  • Fig. 11 is a schematic structural diagram of an electronic device according to another embodiment of the present application.
  • the main purpose of the embodiments of the present application is to propose a forwarding method, forwarding system, electronic device and computer-readable storage medium, aiming to provide BIER technology with the ability to forward packets on a specified path, while preventing the mechanism of BIER technology from being destroyed.
  • An embodiment of the present application relates to a forwarding method, which is applied to an intermediate node bit forwarding router.
  • the implementation details of the forwarding method in this embodiment are described in detail below, and the following content is only implementation details provided for easy understanding, and is not necessary for implementing this solution.
  • Step 101 obtain the message to be forwarded, check whether the message to be forwarded contains a preset flag, if yes, perform step 102, otherwise, perform step 104.
  • the intermediate node and the forwarding router can obtain the message to be forwarded in real time, and after obtaining the message to be forwarded, analyze the obtained message to be forwarded, and detect whether the message to be forwarded contains a preset flag.
  • the preset flag is used to indicate that the packet to be forwarded has a designated forwarding path, and the preset flag can be set by those skilled in the art according to actual needs.
  • the preset flag can be encapsulated in the BIER header of the message to be forwarded.
  • the intermediate node forwarding router After the intermediate node forwarding router obtains the message to be forwarded, it can parse the obtained message to be forwarded and detect the identity of the message to be forwarded. Whether to include default flags in the BIER header.
  • the preset flag can be encapsulated in the outer header of the BIER header of the message to be forwarded.
  • the intermediate node bit forwarding router After the intermediate node bit forwarding router obtains the message to be forwarded, it can parse the obtained message to be forwarded and detect Whether the outer packet header of the BIER header of the packet to be forwarded contains a preset flag.
  • the intermediate node bit-forwarding router may receive the message to be forwarded sent by the BFIR, or receive the message to be forwarded sent by the preceding intermediate node bit-forwarding router.
  • the forwarding router of the intermediate node detects that the message to be forwarded contains a preset mark, it determines that the message to be forwarded has a designated forwarding path; if the forwarding router of the intermediate node detects that the message to be forwarded does not have a preset mark, Then it is determined that the packet to be forwarded does not specify a forwarding path. It is very accurate, fast and convenient to judge whether the message to be forwarded has a designated forwarding path by detecting whether the message to be forwarded has a preset mark. Forwarding quality and efficiency, packets without a designated forwarding path are sent normally to prevent network congestion.
  • the default mark is H mark
  • the H mark is encapsulated in the BIER header of the message to be forwarded
  • the intermediate node and the forwarding router parse the BIER header of the message to be forwarded, and the BIER header of the message to be forwarded can be shown in Figure 2
  • the intermediate node bit forwarding router detects the H mark in the BIER header, and determines that the message to be forwarded has a designated forwarding path.
  • Step 102 acquire the information of the protocol header after the BIER header.
  • the intermediate node and the forwarding router determine that the message to be forwarded contains a preset flag, then the information of the protocol header after the BIER header of the message to be forwarded can be obtained.
  • the information of the protocol header is at least used to indicate the designated forwarding path.
  • the intermediate node bit forwarding router can find the protocol header after the BIER header in the message to be forwarded according to the bit string length (Bit String Length, referred to as: BSL) of the BIER header and the network data exchange rule (Protocol). And obtain the information of the protocol header after the BIER header.
  • BSL Bit String Length
  • Step 103 determine the next hop according to the information in the protocol header.
  • the intermediate node forwarding router can determine the next hop according to the information of the protocol header.
  • the next hop of the message to be forwarded is determined, and the specified path forwarding of the message is realized, which provides BIER technology with the capability of forwarding the specified path of the message , while avoiding the destruction of the mechanism of BIER technology.
  • the intermediate node bit forwarding router after the intermediate node bit forwarding router obtains at least the information of the protocol header used to indicate the designated forwarding path, it can search the Bit Index Forwarding Table (Bit Index Forwarding Table, BIFT for short) according to the information of the protocol header, Determine the next hop.
  • Bit Index Forwarding Table Bit Index Forwarding Table
  • the current intermediate node bit forwarding router is R3, and after R3 obtains the information of the protocol header after the BIER header of the message to be forwarded, it determines that the designated forwarding path of the message to be forwarded is: R1 ⁇ R3 ⁇ R5, R3 determines that the next hop is R5.
  • the intermediate node forwarding router after the intermediate node forwarding router determines the next hop, it can also obtain the information corresponding to the next hop.
  • the information corresponding to the next hop includes but is not limited to: the BIER encapsulation type of the next hop, the BIFT-id, BSL and mask (forwarding bit mask, referred to as: F-BM).
  • Step 104 search the BIER forwarding table, and forward the message to be forwarded.
  • the intermediate node forwarding router can search the BIER forwarding table to obtain the IP address and physical address of the next hop, and forward the message to be forwarded to the entity corresponding to the next hop.
  • the intermediate node bit forwarding router may forward the packet to be forwarded to the intermediate node bit forwarding router corresponding to the next hop. For example: as shown in FIG. 2 , the intermediate node forwarding router is R3, and R3 determines that the next hop is R5, and R3 can send the packet to be forwarded to R5.
  • the intermediate node bit forwarding router may forward the packet to be forwarded to the BFER corresponding to the next hop.
  • the intermediate node bit forwarding router is R5, R7 is a BFER, R5 determines that the next hop is R7, and R5 can send the message to be forwarded to R7.
  • the message to be forwarded is acquired, and it is detected whether the message to be forwarded contains a preset mark; wherein, the preset mark is used to indicate that the message to be forwarded has a specified forwarding path, and by detecting the message to be forwarded Whether there is a preset mark method to judge whether the message to be forwarded has a specified forwarding path, which is very accurate, fast, and convenient, and ensures that the message that needs to be forwarded by the specified path is forwarded to the receiver according to the specified path, improving the quality and efficiency of message forwarding. Packets without a designated forwarding path are sent normally to prevent network congestion.
  • bit index of the message to be forwarded explicitly copies the BIER header to include a preset flag, and obtains the information of the protocol header after the BIER header; wherein, the information of the protocol header is at least used to indicate the specified forwarding path; Determine the next hop according to the information in the protocol header; search the BIER forwarding table according to the next hop, and forward the message to be forwarded.
  • BIER technology lacks the ability to specify path forwarding, such as BIER-TE technology, it can only specify some nodes, and cannot arbitrarily specify the forwarding path of packets according to the requirements. At the same time, some bits in the packets cannot be erased and damaged. The mechanism of BIER technology to prevent duplicate messages in the network.
  • the next hop of the message to be forwarded is determined, and the specified path forwarding of the message is realized, which provides BIER technology with the capability of forwarding the specified path of the message , while maintaining the advantages of the forwarding mechanism of the BIER technology.
  • FIG. 1 Another embodiment of the present application relates to a forwarding method, which is applied to an intermediate node bit forwarding router.
  • the forwarding method in this embodiment uses the protocol header after the BIER header as Multi-Protocol Label Switching (Multi-Protocol Label Switching, referred to as: MPLS) ) label stack as an example to illustrate the specific description, the following content is only the implementation details provided for the convenience of understanding, and is not necessary to implement this solution.
  • FIG. 3 is a flow chart of the forwarding method described in this embodiment, including:
  • Step 201 obtain the message to be forwarded, check whether the message to be forwarded contains a preset flag, if yes, perform step 202, otherwise, perform step 204.
  • step 201 is substantially the same as step 101, and will not be repeated here.
  • Step 202 obtaining each outer label of the MPLS label stack.
  • the intermediate node and the forwarding router after the intermediate node and the forwarding router detect that the message to be forwarded has a preset label, that is, the message to be forwarded has a designated forwarding path, it can obtain each outer label of the MPLS label stack. Wherein, the combination of each outer label is used to indicate a designated forwarding path.
  • the protocol header set after the BIER header can be an MPLS label stack, and the combination of the outer labels in the label stack is used to indicate the specified forwarding path, which is clearer and more intuitive, and is convenient for the intermediate node bit forwarding router to read and analyze.
  • the intermediate node is the forwarding router R3, and R3 obtains the outer labels of the MPLS label stack as "1000" and "2000" after detecting that the packet to be forwarded has a preset label .
  • the intermediate node bit forwarding router can determine whether there is an outer label corresponding to itself in each outer label. If the outer label corresponding to the forwarding router itself is forwarded, the specified forwarding path of the message to be forwarded is correct and continues to be forwarded according to the specified path; If there is an error or a forwarding error occurs, the intermediate node bit forwarding router will forward the message to be forwarded according to the preset default forwarding path.
  • an intermediate node forwarding router finds that there is no label corresponding to itself in each outer label, it will forward the message to be forwarded according to the default forwarding path until delivered to the recipient.
  • the MPLS label stack also includes an inner layer label (also known as a stack bottom label) indicating the VPN instance of the receiver.
  • an inner layer label also known as a stack bottom label
  • Step 203 according to the outer layer label corresponding to the intermediate node bit forwarding router, search the MPLS label table to determine the next hop.
  • the intermediate node bit forwarding router can first determine the outer label corresponding to the intermediate node bit forwarding router itself, and then search the MPLS label table to determine the next hop.
  • the specified path is R1R3R5
  • the MPLS label stack includes an outer label "1000” indicating R3 and an outer label "2000” indicating R5.
  • R3 receives the message to be forwarded, it obtains "1000” and "2000”, determines that "1000” is the outer label corresponding to R3 itself, and searches the MPLS label table according to the outer label "2000" of the next layer , confirm that "2000" indicates R5, then R3 determines that the outbound interface is R5, and determines that R5 is the next hop.
  • the intermediate node bit-forwarding router can delete the outer label corresponding to the intermediate node bit-forwarding router itself in the MPLS label stack, so that subsequent bit-forwarding routers can directly read the outer labels they need.
  • Layer tags further save reading time.
  • deleting the pre-sequence outer tags can also avoid forwarding errors and reverse forwarding to a certain extent.
  • the specified path is R1 ⁇ R3 ⁇ R5
  • the MPLS label stack includes an outer label "1000” indicating R3 and an outer label "2000” indicating R5.
  • R3 determines that the next hop is R5, it can delete the outer label "1000” indicating R3 in the MPLS label stack of the message to be forwarded. Only the outer label "2000” indicating R5 is reserved in the MPLS label stack of the message to be forwarded sent to R5.
  • the intermediate node bit forwarding router can judge whether there are non-zero bits in the MPLS bit string, if there are non-zero bits in the bit string, the specified forwarding path has not been completed, and continue to forward to the next hop; if If there is no non-zero bit in the bit string, the specified forwarding path has been completed, and the forwarding is terminated.
  • Step 204 Search the BIER forwarding table according to the next hop, and forward the message to be forwarded.
  • step 204 is substantially the same as step 104 and will not be repeated here.
  • the protocol header after the BIER header includes a multi-protocol label switching MPLS label stack;
  • the acquiring information of the protocol header after the BIER header includes: acquiring each outer label of the MPLS label stack; wherein , the combination of the outer labels is used to indicate the specified forwarding path;
  • the determining the next hop according to the information of the protocol header includes: according to the outer label corresponding to the intermediate node bit forwarding router, Search the MPLS label table to determine the next hop.
  • the protocol header set after the BIER header is an MPLS label stack, and the combination of each outer label in the label stack is used to indicate the specified forwarding path, which is more clear and intuitive, and is convenient for the forwarding router to read and analyze.
  • the next hop of the bit forwarding router is determined by searching the MPLS label table, which realizes the visualization of the specified forwarding path and is convenient for users to track.
  • the protocol header after the BIER header is a segment routing (Segment Routing, referred to as: SRH) header or Internet Protocol Version 6 (Internet Protocol Version 6, referred to as: IPv6) header, the following is a specific description of the protocol header after the BIER header as the SRH header.
  • SRH Segment Routing
  • IPv6 Internet Protocol Version 6
  • Figure 4 is a flow chart of the forwarding method described in this embodiment, including:
  • Step 301 obtain the message to be forwarded, check whether the message to be forwarded contains a preset flag, if yes, perform step 302, otherwise, perform step 304.
  • step 301 is substantially the same as step 101, and will not be repeated here.
  • Step 302 obtain the segment list of the SRH header.
  • the intermediate node and the forwarding router after the intermediate node and the forwarding router detect that the message to be forwarded has a preset mark, that is, the message to be forwarded has a specified forwarding path, it can obtain the segment list of the SRH header after the BIER header.
  • the segment list of the SRH header is used to indicate the specified forwarding path.
  • the protocol header set after the BIER header can be an SRH header, and the segment list of the SRH header is used to indicate the specified forwarding path, which is clearer and more intuitive, and is convenient for the intermediate node bit forwarding router to read and analyze.
  • the intermediate node bit forwarding router can determine whether its own IPv6 address is recorded in the segment list, if the IPv6 address of the intermediate node bit forwarding router itself is recorded in the segment list of the SRH header , the specified forwarding path of the message to be forwarded is correct, and continues to be forwarded according to the specified path; if the IPv6 address of the forwarding router itself is not recorded in the segment list of the SRH header, the specified forwarding path is wrong or the forwarding error occurs, and the intermediate node bit The forwarding router will forward the packets to be forwarded according to the preset default forwarding path.
  • the intermediate node bit forwarding router after the intermediate node bit forwarding router obtains the SRH segment list, it is determined that the SRH segment list has only the last Sengment List, and the intermediate node bit forwarding router can delete the SRH header and delete the preset mark in the BIER header.
  • Step 303 search the unicast routing table to determine the next hop.
  • the intermediate node forwarding router After the intermediate node forwarding router obtains the segment list of the SRH header, it can search the unicast routing table according to the segment list, determine the outgoing interface of the intermediate node forwarding router, and use the outgoing interface as the next hop.
  • the specified path is R1 ⁇ R3 ⁇ R5
  • Segment list[1] in the segment list of the SRH header records the IPv6 address of R3
  • Segment list[2] records the IPv6 address of R5 .
  • R3 receives the message to be forwarded, it obtains Segment list[1] and Segment list[2], searches the unicast routing table, determines that the outbound interface of R3 is the forwarding router, and uses R5 as the next hop.
  • Step 304 Search the BIER forwarding table according to the next hop, and forward the message to be forwarded.
  • step 304 is substantially the same as step 204 and will not be repeated here.
  • the protocol header after the BIER header includes a segment routing SRH header or the sixth version of the Internet Protocol IPv6 header; the obtaining the information of the protocol header after the BIER header of the message to be forwarded includes: obtaining the The segment list of the SRH header or the IPv6 header; wherein, the segment list is used to indicate the designated forwarding path; the determining the next hop according to the information of the protocol header includes: according to the segment list, Look up the unicast routing table to determine the next hop.
  • the protocol header set after the BIER header can be an SRH header or an IPv6 header. Use the segment list Segment list in the SRH header or the IPv6 header to indicate the specified forwarding path, which is clearer and more intuitive, and is convenient for bit forwarding routers to read and analyze.
  • FIG. 5 is a flow chart of the forwarding method described in this embodiment, including:
  • Step 401 obtain the multicast message of the multicast source.
  • BFIR as the entrance of the multicast network, directly communicates with the multicast source, and the BFIR can receive the packets sent by the multicast source in real time.
  • R1 directly communicates with the multicast source, and R1 is the entrance of the multicast network, that is, R1 is a BFIR.
  • Step 402 Determine the designated forwarding path of the multicast message from the multicast source according to the preset policy table.
  • the BFIR can determine the designated forwarding path of the multicast message from the multicast source according to the preset policy table.
  • the preset policy table may be set by those skilled in the art before the multicast, which is not specifically limited in this embodiment of the present application.
  • a schematic diagram of a multicast network structure is shown in Figure 2, including a multicast source, 3 receivers, and 7 bit-forwarding routers, where R1 is BFIR, and R2, R3, and R4 are intermediate node bit-forwarding routers , R6 and R7 are BFER, and R5 is the intermediate node bit forwarding router, which is also BFER.
  • the default forwarding path is to forward according to the Bit Forwarding Router Identity document (abbreviation: BFR-id) in ascending order, that is, the message to be forwarded is sent to the receiver via R1, R2, R4, and R6 A; send to receiver B via R1, R2, R4, and R7; send to receiver C via R1, R2, and R5.
  • BFR-id Bit Forwarding Router Identity document
  • BFIR After receiving the multicast message from the multicast source, BFIR determines the specified forwarding path of the message according to the preset policy table: R1 ⁇ R3 ⁇ R5 (including R1 ⁇ R3 ⁇ R5, R1 ⁇ R3 ⁇ R5 ⁇ R6 and R1 ⁇ R3 ⁇ R5 ⁇ R7).
  • Step 403 encapsulating the specified forwarding path in the protocol header after the BIER header of the message.
  • the designated forwarding path may be encapsulated in the protocol header following the BIER header of the message.
  • the protocol header following the BIER header of the packet may be an MPLS header, that is, an MPLS label stack.
  • BFIR can determine the designated forwarding path of the message according to the preset policy table, and encapsulate the designated forwarding path in the form of an outer layer label in the MPLS label stack.
  • the specified forwarding path is R1 ⁇ R3 ⁇ R5. Since R1 is BFIR, the packet to be forwarded must pass through R1, and there is no need to encapsulate the outer label for R1.
  • BFIR obtains the multicast message from the multicast source, it encapsulates the outer label as "1000" in the MPLS label stack for R3, and encapsulates the outer label as "2000" in the MPLS label stack for R5.
  • the protocol header following the BIER header of the packet may be an SRH header.
  • a schematic structural diagram of the SRH head may be shown in FIG. 6 .
  • BFIR receives the multicast message from the multicast source, it can determine the specified forwarding path of the message according to the preset policy table, add the specified forwarding path to the segment list of the SRH header, and encapsulate the SRH header.
  • the specified forwarding path is R1 ⁇ R3 ⁇ R5. Since R1 is BFIR, the packet to be forwarded must pass through R1, and there is no need to add the IPv6 address of R1 to the segment list of the SRH header.
  • BFIR After BFIR obtains the multicast message from the multicast source, it adds the IPv6 address of R3 to the segment list Segment list[1] of the SRH header; adds the IPv6 address of R5 to the segment list Segment list[2] of the SRH header.
  • the protocol header following the BIER header of the packet may be an IPv6 header.
  • Step 404 encapsulating the BIER header, and adding a preset mark to the multicast message of the multicast source, to obtain the message to be forwarded.
  • BFIR after BFIR encapsulates the specified forwarding path in the protocol header after the BIER header of the message, it can encapsulate the BIER header and add a preset mark in the BIER header to obtain the message to be forwarded. Encapsulate the specified forwarding path in the protocol header after the BIER header, and add a preset mark when encapsulating the BIER header to indicate that the packet to be forwarded has a specified forwarding path, which can ensure that the bit forwarding router can quickly and accurately identify the specified forwarding path Path, forward packets according to the specified forwarding path.
  • the default mark is an H mark.
  • the H mark can be added to the BIER header.
  • the BIER header after adding the H mark can be shown in FIG. 7 .
  • the BFIR can add the preset mark to any position of the BIER header, which is not specifically limited in this embodiment of the present application.
  • the BIER header of the message can be encapsulated in the inner layer of other protocol headers, such as MPLS encapsulation and IPv6 encapsulation, and the BIER header can also be encapsulated separately, such as Ethernet encapsulation.
  • BFIR encapsulates the BIER header and adds a preset mark in the BIER header
  • the message to be forwarded can be obtained.
  • Figure 8 is a structural diagram of several messages to be forwarded.
  • the multicast message of the multicast source is obtained; according to the preset policy table, the designated forwarding path of the multicast message of the multicast source is determined; the designated forwarding path is encapsulated in the message
  • the bit index is explicitly copied into the protocol header after the BIER header; the BIER header is encapsulated, and a preset mark is added to the multicast message of the multicast source to obtain the message to be forwarded.
  • BFIR encapsulates the specified forwarding path in the protocol header after the BIER header, and adds a preset mark when encapsulating the BIER header to indicate that the message to be forwarded has a specified forwarding path, ensuring that each forwarding router can quickly and accurately identify the specified forwarding path, Forward packets according to the specified forwarding path.
  • FIG. 9 is a flow chart of the forwarding method described in this embodiment, including:
  • Step 501 obtain the message to be forwarded.
  • the BFER can obtain in real time the packets to be forwarded sent by the preorder intermediate node bit forwarding router.
  • the bit forwarding router can work as an intermediate node for the forwarding router and also as a BFER in the multicast network.
  • R5 is both an intermediate node and a forwarding router, and can also serve as a BFER to directly communicate with receiver C.
  • Step 502 analyze the message to be forwarded, and obtain the information of the protocol header after the BIER header of the message to be forwarded.
  • the BFER can analyze the packet to be forwarded, and obtain the information of the protocol header after the BIER header of the packet to be forwarded.
  • the information of the protocol header is at least used to indicate the designated forwarding path.
  • BFER can find the protocol header after the BIER header in the message to be forwarded according to the BSL of the BIER header and the network data exchange rules, and obtain the information of the protocol header after the BIER header.
  • the protocol header after the BIER header is the MPLS label stack.
  • BFER obtains and parses the packet to be forwarded, it can determine whether there is an outer label in the MPLS label stack. A combination is used to indicate a specified forwarding path. If there is an outer label in the MPLS label stack, the outer label is skipped and the bottom label of the stack is obtained directly. Among them, the label at the bottom of the stack is used to indicate the receiver. In the embodiment of the present application, BFER will not read the outer label that is not useful to itself, fundamentally eliminating the situation of repeated reading and invalid reading.
  • the specified forwarding path is: R1 ⁇ R3 ⁇ R5 ⁇ R7
  • the labels in the MPLS label stack include "1000" representing R3, "2000” representing R5 and "3000” representing R7, R5 It is not only an intermediate node bit forwarding router, but also a BFER, and R5 serves as the receiving party C of the BFER connection.
  • R5 When the message to be forwarded arrives at R5, it has already passed through R3, and the outer label "1000" has been deleted by R3, and there are still two labels "2000” and "3000” in the MPLS label stack of the message to be forwarded received by R5.
  • R5 When R5 is used as a BFER, it can skip the outer labels "2000” and "3000” and directly obtain the bottom label of the stack.
  • Step 503 Send the message to be forwarded to the receiver according to the information in the protocol header.
  • the BFER after BFER obtains the information of the protocol header behind the BIER header, it can obtain the virtual private network (Virtual Private Network, referred to as: VPN) instance information according to the information of the protocol header, wherein, the VPN instance information includes but is not limited to The recipient's IP address and the recipient's physical address.
  • VPN Virtual Private Network
  • the protocol header following the BIER header is the MPLS label stack
  • the BFER can search the BIFT according to the bottom label of the stack to obtain VPN instance information.
  • the BFER is R5, and R5 searches BIFT according to the bottom label of the stack to obtain the IP address and physical address of receiver C, and according to the IP address and physical address of receiver C in the VPN instance information, transfer The message to be forwarded is sent to receiver C.
  • step division of the above various methods is only for the sake of clarity of description. During implementation, it can be combined into one step or some steps can be split and decomposed into multiple steps. As long as they include the same logical relationship, they are all within the scope of protection of this patent. ; Adding insignificant modifications or introducing insignificant designs to the algorithm or process, but not changing the core design of the algorithm and process are all within the scope of protection of this patent.
  • FIG. 10 is the implementation details of this implementation.
  • the entry node is a forwarding router 601 , an intermediate node bit forwarding router 602 and an exit node bit forwarding router 603 .
  • the entry node is a forwarding router 601 connected to an intermediate node bit forwarding router 602
  • the intermediate node bit forwarding router 602 is connected to an egress node bit forwarding router 603 .
  • the entry node is the forwarding router 601, which is used to obtain the multicast message of the multicast source, obtains the message to be forwarded according to the message of the multicast source multicast, and sends the message to be forwarded to the intermediate node bit forwarding router according to the specified forwarding path 602 or egress node bit forwarding router 603.
  • the intermediate node is a router 602 for obtaining the message to be forwarded, and sending the message to be forwarded to other intermediate node forwarding routers or the egress node forwarding router 603 according to the specified forwarding path;
  • the egress node bit forwarding router 603 is configured to obtain the message to be forwarded, and send the message to be forwarded to the receiver.
  • this embodiment is a system embodiment corresponding to the above-mentioned embodiments, and this embodiment can be implemented in cooperation with the above-mentioned embodiments.
  • the relevant technical details and technical effects mentioned in the above embodiments are still valid in this embodiment, and will not be repeated here to reduce repetition.
  • the relevant technical details mentioned in this embodiment can also be applied in the above embodiments.
  • FIG. 11 Another embodiment of the present application relates to an electronic device, as shown in FIG. 11 , including: at least one processor 701; and a memory 702 communicatively connected to the at least one processor 701; wherein, the memory 702 stores Instructions that can be executed by the at least one processor 701, the instructions are executed by the at least one processor 701, so that the at least one processor 701 can execute the instructions applied to the intermediate node bit forwarding router in the above embodiments The forwarding method, or the forwarding method applied to BFIR, or the forwarding method applied to BFER.
  • the memory and the processor are connected by a bus
  • the bus may include any number of interconnected buses and bridges, and the bus connects one or more processors and various circuits of the memory together.
  • the bus may also connect together various other circuits such as peripherals, voltage regulators, and power management circuits, all of which are well known in the art and therefore will not be further described herein.
  • the bus interface provides an interface between the bus and the transceivers.
  • a transceiver may be a single element or multiple elements, such as multiple receivers and transmitters, providing means for communicating with various other devices over a transmission medium.
  • the data processed by the processor is transmitted on the wireless medium through the antenna, and further, the antenna receives the data and transmits the data to the processor.
  • the processor is responsible for managing the bus and general processing, and can also provide various functions, including timing, peripheral interface, voltage regulation, power management, and other control functions. Instead, memory can be used to store data that the processor uses when performing operations.
  • Another embodiment of the present application relates to a computer-readable storage medium storing a computer program.
  • the above method embodiments are implemented when the computer program is executed by the processor.
  • a storage medium includes several instructions to make a device ( It may be a single-chip microcomputer, a chip, etc.) or a processor (processor) to execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disc, etc., which can store program codes. .

Landscapes

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

Abstract

本申请实施例涉及通信技术领域，特别涉及一种转发方法、转发系统、电子设备和计算机可读存储介质，该转发方法包括：获取待转发报文，检测所述待转发报文是否包含预设标记；其中，所述预设标记用于指示所述待转发报文有指定转发路径；若所述待转发报文包含预设标记，获取所述待转发报文的位索引显式复制BIER头后的协议头的信息；其中，所述协议头的信息至少用于指示所述指定转发路径；根据所述协议头的信息，确定下一跳；根据所述下一跳，转发所述待转发报文。

Description

转发方法、转发系统、电子设备和计算机可读存储介质
相关申请的交叉引用
本申请基于申请号为“202110647845.X”、申请日为2021年06月10日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此以引入方式并入本申请。
技术领域
本申请实施例涉及通信技术领域，特别涉及一种转发方法、转发系统、电子设备和计算机可读存储介质。
背景技术
随着通信技术的飞速发展，传统的网际互连协议(Internet Protocol，简称：IP)组播转发技术已不是组播转发技术的最优解，位索引显式复制技术(Bit Index Explicit Replication，简称：BIER)慢慢开始发展。BIER是一种新的组播技术，与传统的组播树技术不同，BIER技术将组播报文的目的节点的集合以比特串的方式封装在报文头部，再进行发送，从而使网络中的中间转发节点无需为每一个组播流建立组播树，也无需保存组播流状态，仅需根据报文头部的目的节点的集合进行复制转发。
然而，BIER技术缺乏指定路径转发的能力，即便采用基于流量工程的位索引显式复制技术(Tree Engineering for Bit Index Explicit Replication，简称：BIER-TE)，也只能在一定程度上指定部分节点，某些比特位不能抹掉，这样网络中就可能存在多分报文中都携带某些比特位的情况，从根本上破坏了BIER技术防止网络中存在重复报文的机制。
发明内容
本申请的实施例提供了一种转发方法，应用于中间节点位转发路由器，所述方法包括：获取待转发报文，检测所述待转发报文是否包含预设标记；其中，所述预设标记用于指示所述待转发报文有指定转发路径；若所述待转发报文包含预设标记，获取所述待转发报文的位索引显式复制BIER头后的协议头的信息；其中，所述协议头的信息至少用于指示所述指定转发路径；根据所述协议头的信息，确定下一跳；根据所述下一跳，查找BIER转发表，转发所述待转发报文。
本申请的实施例还提供了一种转发方法，应用于入口节点位转发路由器(Bit Forwarding Ingress Router，简称：BFIR)，所述方法包括：获取组播源组播的报文；根据预设的策略表，确定所述组播源组播的报文的指定转发路径；将所述指定转发路径封装在所述报文的位索引显式复制BIER头后的协议头中；封装所述BIER头，并在所述组播源组播的报文中添加预设标记，得到待转发报文。
本申请的实施例还提供了一种转发方法，应用于出口节点位转发路由器(Bit Forwarding Egress Router，简称：BFER)，所述方法包括：获取待转发报文；解析所述待转发报文，得到所述待转发报文的位索引显式复制BIER头后的协议头的信息；其中，所述协议头的信息至 少用于指示所述待转发报文的指定转发路径；根据所述协议头的信息，将所述待转发报文发送至接收方。
本申请的实施例还提供了一种转发系统，包括：入口节点位转发路由器、中间节点位转发路由器和出口节点位转发路由器。
本申请的实施例还提供了一种电子设备，包括：至少一个处理器；以及，与所述至少一个处理器通信连接的存储器；其中，所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器能够执行上述应用于中间节点位转发路由器的转发方法，或者执行上述应用于入口节点位转发路由器的转发方法，或者执行上述应用于出口节点位转发路由器的转发方法。
本申请的实施例还提供了一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时实现上述应用于中间节点位转发路由器的转发方法，或者实现上述应用于入口节点位转发路由器的转发方法，或者实现上述应用于出口节点位转发路由器的转发方法。
附图说明
图1是根据本申请一个实施例的转发方法的流程图一；
图2是根据本申请一个实施例中提供的一种组播网络结构的示意图；
图3是根据本申请另一个实施例的转发方法的的流程图二；
图4是根据本申请另一个实施例中转发方法的的流程图三；
图5是根据本申请另一个实施例中转发方法的的流程图四；
图6是根据本申请另一个实施例中提供的一种分段路由头的结构示意图；
图7是根据本申请另一个实施例中提供的一种BIER头的结构示意图；
图8是根据本申请另一个实施例中提供的待转发报文的结构示意图；
图9是根据本申请另一个实施例中转发方法的的流程图五；
图10是根据本申请另一个实施例中转发系统的示意图；
图11是根据本申请另一个实施例的电子设备的结构示意图。
具体实施方式
本申请实施例的主要目的在于提出一种转发方法、转发系统、电子设备和计算机可读存储介质，旨在为BIER技术提供报文指定路径转发的能力，同时避免BIER技术的机制被破坏。
为使本申请实施例的目的、技术方案和优点更加清楚，下面将结合附图对本申请的各实施例进行详细的阐述。然而，本领域的普通技术人员可以理解，在本申请各实施例中，为了使读者更好地理解本申请而提出了许多技术细节。但是，即使没有这些技术细节和基于以下各实施例的种种变化和修改，也可以实现本申请所要求保护的技术方案。以下各个实施例的划分是为了描述方便，不应对本申请的具体实现方式构成任何限定，各个实施例在不矛盾的前提下可以相互结合相互引用。
本申请的一个实施例涉及一种转发方法，应用于中间节点位转发路由器。下面对本实施例的转发方法的实现细节进行具体的说明，以下内容仅为方便理解提供的实现细节，并非实施本方案的必须。
本实施例的转发方法的具体流程可以如图1所示，包括：
步骤101，获取待转发报文，检测待转发报文是否包含预设标记，如果是，执行步骤102，否则，执行步骤104。
具体而言，中间节点位转发路由器可以实时获取待转发报文，并在获取到待转发报文后，解析获取到的待转发报文，检测该待转发报文是否包含预设标记。其中，预设标记用于指示待转发报文有指定转发路径，预设标记可以由本领域的技术人员根据实际需要进行设置。
在一个例子中，预设标记可以封装在待转发报文的BIER头中，中间节点位转发路由器获取到待转发报文后，可以解析获取到的待转发报文，检测该待转发报文的BIER头中是否包含预设标记。
在一个例子中，预设标记可以封装在待转发报文的BIER头的外层报文头中，中间节点位转发路由器获取到待转发报文后，可以解析获取到的待转发报文，检测该待转发报文的BIER头的外层报文头中是否包含预设标记。
在一个例子中，中间节点位转发路由器，可以接收BFIR发送的来的待转发报文，或者接收前序中间节点位转发路由器发送来的待转发报文。
在具体实现中，中间节点位转发路由器若检测到待转发报文包含预设标记，则确定待转发报文有指定转发路径；若中间节点位转发路由器检测到待转发报文没有预设标记，则确定待转发报文没有指定转发路径。通过检测待转发报文是否有预设标记的方法判断待转发报文是否有指定转发路径，非常准确、快速、便捷，保证需要指定路径转发的报文按照指定路径转发给接收方，提升报文转发的质量和效率，无指定转发路径的报文则正常发送，防止出现网络拥塞。
在一个例子中，预设标记为H标记，H标记封装在待转发报文的BIER头中，中间节点位转发路由器解析待转发报文的BIER头，待转发报文的BIER头可以如图2所示，中间节点位转发路由器在BIER头中检测到了H标记，确定该待转发报文有指定转发路径。
步骤102，获取BIER头后的协议头的信息。
具体而言，若中间节点位转发路由器确定待转发报文包含预设标记，则可以获取待转发报文的BIER头后的协议头的信息。其中，协议头的信息至少用于指示指定转发路径。
在具体实现中，中间节点位转发路由器可以根据BIER头的位串长度(Bit String Length，简称：BSL)和网络数据交换规则(Protocol)，在待转发报文中找到BIER头后的协议头，并获取BIER头后的协议头的信息。
步骤103，根据协议头的信息，确定下一跳。
具体而言，中间节点位转发路由器在获取到至少用指示指定转发路径的协议头的信息后，可以根据协议头的信息，确定下一跳。本申请的实施例，通过获取BIER头后设置的协议头的信息的方式，确定待转发报文的下一跳，实现报文的指定路径转发，为BIER技术提供了报文指定路径转发的能力，同时避免BIER技术的机制被破坏。
在一个例子中，中间节点位转发路由器在获取到至少用于指示指定转发路径的协议头的信息后，可以根据协议头的信息，查找位索引转发表(Bit Index Forwarding Table，简称：BIFT)，确定下一跳。
在一个例子中，如图2所示，当前中间节点位转发路由器为R3，R3获取到待转发报文的BIER头后的协议头的信息后，确定待转发报文的指定转发路径为：R1→R3→R5，R3确定下一跳为R5。
在一个例子中，中间节点位转发路由器确定下一跳后，还可以获取下一跳对应的信息，下一跳对应的信息包括但不限于：下一跳的BIER封装类型、下一跳对应的BIFT-id、BSL和掩码(forwarding bit mask，简称：F-BM)。
步骤104，根据下一跳，查找BIER转发表，转发待转发报文。
在具体实现中，中间节点位转发路由器确定下一跳后，可以查找BIER转发表，获取下一跳的IP地址和物理地址，将待转发报文转发给下一跳对应的实体。
在一个例子中，中间节点位转发路由器可以将待转发报文转发给下一跳对应的中间节点位转发路由器。比如：如图2所示，中间节点位转发路由器为R3，R3确定下一跳为R5，R3可以将待转发报文发送给R5。
在另一个例子中，中间节点位转发路由器可以将待转发报文转发给下一跳对应的BFER。比如：如图2所示，中间节点位转发路由器为R5，R7为BFER，R5确定下一跳为R7，R5可以将待转发报文发送给R7。
本实施例，获取待转发报文，检测所述待转发报文是否包含预设标记；其中，所述预设标记用于指示所述待转发报文有指定转发路径，通过检测待转发报文是否有预设标记的方法判断待转发报文是否有指定转发路径，非常准确、快速、便捷，保证需要指定路径转发的报文按照指定路径转发给接收方，提升报文转发的质量和效率，无指定转发路径的报文则正常发送，防止出现网络拥塞。若所述待转发报文的位索引显式复制BIER头包含预设标记，获取所述BIER头后的协议头的信息；其中，所述协议头的信息至少用于指示所述指定转发路径；根据所述协议头的信息，确定下一跳；根据所述下一跳，查找BIER转发表，转发所述待转发报文。考虑到BIER技术缺乏指定路径转发的能力，比如BIER-TE技术等，也只能指定部分节点，不能按照需求任意指定报文的转发路径，同时报文中的某些比特位不能抹掉，破坏了BIER技术防止网络中存在重复报文的机制。本申请的实施例，通过获取BIER头后设置的协议头的信息的方式，确定待转发报文的下一跳，实现报文的指定路径转发，为BIER技术提供了报文指定路径转发的能力，同时保持BIER技术的转发机制的优点。
本申请的另一个实施例涉及一种转发方法，应用于中间节点位转发路由器，本实施例中的转发方法以BIER头后的协议头为多协议标签交换(Multi-Protocol Label Switching，简称：MPLS)标签栈为例进行说明具体的说明，以下内容仅为方便理解提供的实现细节，并非实施本方案的必须，图3是本实施例所述的转发方法的流程图，包括：
步骤201，获取待转发报文，检测待转发报文是否包含预设标记，如果是，执行步骤202，否则，执行步骤204。
其中，步骤201与步骤101大致相同，此处不再赘述。
步骤202，获取MPLS标签栈的各外层标签。
具体而言，中间节点位转发路由器在检测到待转发报文有预设标记，即待转发报文有指定转发路径后，可以获取MPLS标签栈的各外层标签。其中，各外层标签的组合用于指示指定转发路径。BIER头后设置的协议头可以是MPLS标签栈，用标签栈中的各外层标签的组合来指示指定转发路径，更加清晰、直观，方便中间节点位转发路由器读取和解析。
在一个例子中，如图2所示，中间节点位转发路由器为R3，R3在检测到待转发报文有预设标记后，获取MPLS标签栈的各外层标签为“1000”和“2000”。
在一个例子中，中间节点位转发路由器在获取MPLS标签栈的各外层标签之后，可以判 断各外层标签中是否有与自身对应的外层标签，若各外层标签中有与中间节点位转发路由器自身对应的外层标签，则待转发报文指定转发路径正确，继续按照指定路径转发；若各外层标签中没有与中间节点位转发路由器自身对应的外层标签，则指定转发路径有误或转发出现错误，中间节点位转发路由器将根据预设的默认转发路径，转发待转发报文。
本申请的实施例，为保证待转发报文能够传送到接收方，当位中间节点转发路由器发现各外层标签中没有与自身对应的标签时，将按照默认转发路径转发待转发报文，直至送达接收方。
在具体实现中，MPLS标签栈中还包括指示接收方的VPN实例的内层标签(又称栈底标签)。
步骤203，根据与中间节点位转发路由器对应的外层标签，查找MPLS标签表，确定下一跳。
具体而言，中间节点位转发路由器获取到MPLS标签栈中的各外层标签后，可以先确定与中间节点位转发路由器自身对应的外层标签，再查找MPLS标签表，确定下一跳。
在一个例子中，如图2所示，指定路径为R1R3R5，MPLS标签栈中包括指示R3的外层标签“1000”和指示R5的外层标签“2000”。R3在收到待转发报文时，获取到“1000”和“2000”，确定“1000”为与R3自身对应的外层标签，并根据下一层的外层标签“2000”查找MPLS标签表，确定“2000”表示R5，则R3确定出接口为R5，确定R5作为下一跳。
在一个例子中，中间节点位转发路由器确定下一跳后，可以删除MPLS标签栈中与中间节点位转发路由器自身对应的外层标签，以便后续的位转发路由器可直接读取到自己需要的外层标签，进一步节约读取时间，另外，删除前序外层标签还可以在一定程度上避免转发错误、逆向转发的情况。
比如：如图2所示，指定路径为R1→R3→R5，MPLS标签栈中包括指示R3的外层标签“1000”和指示R5的外层标签“2000”。R3在确定下一跳为R5后，可以删除待转发报文的MPLS标签栈中指示R3的外层标签“1000”。发送至R5的待转发报文的MPLS标签栈中只保留指示R5的外层标签“2000”。
在一个例子中，中间节点位转发路由器可以判断MPLS位串中是否有非零比特位，若位串中还有非零比特位，则指定转发路径未走完，继续转发给下一跳；若位串中没有非零比特位，则指定转发路径已走完，终止转发。
步骤204，根据下一跳，查找BIER转发表，转发待转发报文。
其中，步骤204与步骤104大致相同，此处不再赘述。
本实施例，所述BIER头后的协议头包括多协议标签交换MPLS标签栈；所述获取所述BIER头后的协议头的信息，包括：获取所述MPLS标签栈的各外层标签；其中，所述各外层标签的组合用于指示所述指定转发路径；所述根据所述协议头的信息，确定下一跳，包括：根据与所述中间节点位转发路由器对应的外层标签，查找MPLS标签表，确定下一跳。
本申请的实施例，BIER头后设置的协议头为MPLS标签栈，用标签栈中的各外层标签的组合指示指定转发路径，更加清楚、直观，方便位转发路由器进行读取和解析。根据外层标签，通过查找MPLS标签表的形式确定位转发路由器的下一跳，实现了指定转发路径的可视化，方便用户进行跟踪。
本申请的另一个实施例涉及一种转发方法，应用于中间节点位转发路由器，本实施例中 的转发方法中，BIER头后的协议头为分段路由(Segment Routing，简称：SRH)头或互联网协议第六版(Internet Protocol Version 6，简称：IPv6)头，以下以BIER头后的协议头为SRH头为例进行具体的说明，以下内容仅为方便理解提供的实现细节，并非实施本方案的必须，图4是本实施例所述的转发方法的流程图，包括：
步骤301，获取待转发报文，检测待转发报文是否包含预设标记，如果是，执行步骤302，否则，执行步骤304。
其中，步骤301与步骤101大致相同，此处不再赘述。
步骤302，获取SRH头的段列表。
具体而言，中间节点位转发路由器在检测到待转发报文有预设标记，即待转发报文有指定转发路径后，可以获取BIER头后的SRH头的段列表。其中，SRH头的段列表用于指示指定转发路径。BIER头后设置的协议头可以是SRH头，用SRH头的段列表来指示指定转发路径，更加清晰、直观，方便中间节点位转发路由器读取和解析。
在一个例子中，中间节点位转发路由器在获取SRH头的段列表之后，可以判断段列表中是否记载了自身的IPv6地址，若SRH头的段列表中记载了中间节点位转发路由器自身的IPv6地址，则待转发报文指定转发路径正确，继续按照指定路径转发；若SRH头的段列表中没有记载中间节点位转发路由器自身的IPv6地址，则指定转发路径有误或转发出现错误，中间节点位转发路由器将根据预设的默认转发路径，转发待转发报文。
在一个例子中，中间节点位转发路由器获取SRH段列表后，确定SRH段列表只有最后一个Sengment List，中间节点位转发路由器可以删除SRH头，并删除掉BIER头中的预设标记。
步骤303，根据段列表，查找单播路由表，确定下一跳。
具体而言，中间节点位转发路由器获取到SRH头的段列表后，可以根据段列表，查找单播路由表，确定中间节点位转发路由器的出接口，将该出接口作为下一跳。
在一个例子中，如图4所示，指定路径为R1→R3→R5，SRH头的段列表中的Segment list[1]记载了R3的IPv6地址，Segment list[2]记载了R5的IPv6地址。R3在收到待转发报文时，获取到Segment list[1]和Segment list[2]，查找单播路由表，确定R3的出接口位转发路由器为R5，将R5作为下一跳。
步骤304，根据下一跳，查找BIER转发表，转发待转发报文。
其中，步骤304与步骤204大致相同，此处不再赘述。
值得说明的是，BIER头后的协议头为IPv6头时的转发方法与本实施例类似，此处不再赘述。
本实施例，所述BIER头后的协议头包括分段路由SRH头或互联网协议第六版IPv6头；所述获取所述待转发报文的BIER头后的协议头的信息，包括：获取所述SRH头或所述IPv6头的段列表；其中，所述段列表用于指示所述指定转发路径；所述根据所述协议头的信息，确定下一跳，包括：根据所述段列表，查找单播路由表，确定下一跳。BIER头后设置的协议头可以是SRH头或IPv6头，用SRH头或IPv6头中的段列表Segment list指示指定转发路径，更加清晰、直观，方便位转发路由器读取、解析。
本申请的另一个实施例涉及一种转发方法，应用于入口节点位转发路由器(Bit Forwarding Ingress Router，简称：BFIR)，下面对本实施例的转发方法的实现细节进行具体的说明，以下 内容仅为方便理解提供的实现细节，并非实施本方案的必须，图5是本实施例所述的转发方法的流程图，包括：
步骤401，获取组播源组播的报文。
具体而言，BFIR作为组播网络的入口，直接与组播源进行通信，BFIR可以实时接收组播源组播发送的报文。
在一个例子中，如图2所示，R1直接与组播源进行通信，R1即该组播网络的入口，即R1为BFIR。
步骤402，根据预设的策略表，确定组播源组播的报文的指定转发路径。
具体而言，BFIR在收到组播源组播的报文后，可以根据预设的策略表，确定组播源组播的报文的指定转发路径。其中，预设的策略表可以在组播之前由本领域的技术人员进行设置，本申请的实施例对此不做具体限定。
在一个例子中，组播网络结构的示意图如图2所示，包括组播源、3个接收方和7个位转发路由器，其中，R1为BFIR，R2、R3、R4为中间节点位转发路由器，R6、R7为BFER，R5即为中间节点位转发路由器，也为BFER。默认的转发路径为按照位转发路由器的身份标识码(Bit Forwarding Router Identity document，简称：BFR-id)从小到大的顺序转发，即待转发报文经R1、R2、R4、R6发送至接收方甲；经R1、R2、R4、R7发送至接收方乙；经R1、R2、R5发送至接收方丙。BFIR在收到组播源组播的报文后，根据预设的策略表，确定报文的指定转发路径为：R1→R3→R5(包括R1→R3→R5、R1→R3→R5→R6和R1→R3→R5→R7)。
步骤403，将指定转发路径封装在报文的BIER头后的协议头中。
具体而言，BFIR在确定组播源组播的报文的指定转发路径后，可以将该指定转发路径封装在报文的BIER头后的协议头中。
在一个例子中，报文的BIER头后的协议头可以为MPLS头，即MPLS标签栈。BFIR在接收到组播源组播的报文后，可以根据预设的策略表，确定报文的指定转发路径，将指定转发路径以外层标签的形式封装在MPLS标签栈中。比如：如图2所示，指定转发路径为R1→R3→R5，由于R1为BFIR，待转发报文一定经过R1，不需要为R1封装外层标签。BFIR获取组播源组播的报文后，为R3在MPLS标签栈中封装外层标签为“1000”，为R5在MPLS标签栈中封装外层标签为“2000”。
在一个例子中，报文的BIER头后的协议头可以为SRH头。SRH头的结构示意图可以如图6所示。BFIR在接收到组播源组播的报文后，可以根据预设的策略表，确定报文的指定转发路径，将指定转发路径添加到SRH头的段列表中，并封装SRH头。比如：如图2所示，指定转发路径为R1→R3→R5，由于R1为BFIR，待转发报文一定经过R1，不需要在SRH头的段列表中添加R1的IPv6地址。BFIR获取组播源组播的报文后，将R3的IPv6地址添加在SRH头的段列表Segment list[1]中；将R5的IPv6地址添加在SRH头的段列表Segment list[2]中。
在另一个例子中，报文的BIER头后的协议头可以为IPv6头。
步骤404，封装BIER头，并在组播源组播的报文中添加预设标记，得到待转发报文。
在具体实现中，BFIR在将指定转发路径封装在报文的BIER头后的协议头中后，可以封装BIER头，并在BIER头中添加预设标记，得到待转发报文。将指定转发路径封装在BIER 头后的协议头中，并在封装BIER头时添加预设标记，以表征指示待转发报文有指定转发路径，可以保证位转发路由器能够快速、准确地识别指定转发路径，按照指定转发路径转发报文。
在一个例子中，预设标记为H标记，BFIR在封装报文的BIER头时，可以在BIER头中添加H标记，添加H标记后的BIER头可以如图7所示。BFIR可以将预设标记添加在BIER头的任意位置，本申请的实施例对此不做具体限定。
在具体实现中，报文的BIER头可以封装在其他协议头的内层，如MPLS封装和IPv6封装等，BIER头也可以单独封装，如以太封装等。BFIR在封装BIER头，并在BIER头中添加预设标记后，可以得到待转发报文，图8为几种待转发报文的结构示意图。
本实施例，获取组播源组播的报文；根据预设的策略表，确定所述组播源组播的报文的指定转发路径；将所述指定转发路径封装在所述报文的位索引显式复制BIER头后的协议头中；封装所述BIER头，并在所述组播源组播的报文中添加预设标记，得到待转发报文。BFIR将指定转发路径封装在BIER头后的协议头中，并在封装BIER头时添加预设标记，以指示待转发报文有指定转发路径，保证各位转发路由器能够快速、准确识别指定转发路径，按照指定转发路径转发报文。
本申请的另一个实施例涉及一种转发方法，应用于出口节点位转发路由器(Bit Forwarding Egress Router，简称：BFER)，下面对本实施例的转发方法的实现细节进行具体的说明，以下内容仅为方便理解提供的实现细节，并非实施本方案的必须，图9是本实施例所述的转发方法的流程图，包括：
步骤501，获取待转发报文。
具体而言，BFER可以实时获取前序中间节点位转发路由器发送的待转发报文。
在一个例子中，位转发路由器在组播网络中既可以作为中间节点为转发路由器工作，同时也作为BFER工作。比如：如图2所示，R5既为中间节点为转发路由器，还可以作为BFER与接收方丙直接通信。
步骤502，解析待转发报文，得到待转发报文的BIER头后的协议头的信息。
具体而言，BFER可以解析待转发报文，得到待转发报文的BIER头后的协议头的信息。其中，协议头的信息至少用于指示指定转发路径。
在具体实现中，BFER可以根据BIER头的BSL和网络数据交换规则，在待转发报文中找到BIER头后的协议头，并获取BIER头后的协议头的信息。
在一个例子中，BIER头后的协议头为MPLS标签栈，BFER获取并解析待转发报文后，可以判断MPLS标签栈中是否有外层标签，其中，MPLS标签栈中的各外层标签的组合用于指示指定转发路径。若MPLS标签栈中有外层标签，则跳过外层标签，直接获取栈底标签。其中，栈底标签用于指示接收方。本申请的实施例，BFER不会读取对自己没有用的外层标签，从根本上杜绝了重复读取、无效读取的情况。
比如：如图2所示，指定转发路径为：R1→R3→R5→R7，MPLS标签栈中的标签包括表示R3的“1000”、表示R5的“2000”和表示R7的“3000”，R5既是中间节点位转发路由器，又是BFER，R5作为BFER连接接收方丙。待转发报文到达R5处时，已经经过R3，外层标签“1000”已被R3删除，R5收到的待转发报文的MPLS标签栈中仍有“2000”和“3000”两个标签。R5作为BFER时，可以跳过外层标签“2000”和“3000”，直接获取栈底标签。
步骤503，根据协议头的信息，将待转发报文发送至接收方。
在具体实现中，BFER得到BIER头后的协议头的信息后，可以根据协议头的信息，获取获取虚拟专用网络(Virtual Private Network，简称：VPN)实例信息，其中，VPN实例信息包括但不限于接收方的IP地址和接收方的物理地址。BFER在获取到VPN实例信息后，可以根据VPN实例信息，将待转发报文发送至接收方。
在一个例子中，BIER头后的协议头为MPLS标签栈，BFER可以根据栈底标签，查找BIFT，获取VPN实例信息。比如：如图2所示，BFER为R5，R5根据栈底标签，查找BIFT，获取接收方丙的IP地址和物理地址，并按照VPN实例信息中的接收方丙的IP地址和物理地址，将待转发报文发送给接收方丙。
上面各种方法的步骤划分，只是为了描述清楚，实现时可以合并为一个步骤或者对某些步骤进行拆分，分解为多个步骤，只要包括相同的逻辑关系，都在本专利的保护范围内；对算法中或者流程中添加无关紧要的修改或者引入无关紧要的设计，但不改变其算法和流程的核心设计都在该专利的保护范围内。
本申请另一个实施例涉及一种转发系统，下面对本实施例的转发系统的实现细节进行具体的说明，以下内容仅为方便理解提供的实现细节，并非实施本方案的必须，图10是本实施例所述的转发系统的示意图，包括：
入口节点为转发路由器601、中间节点位转发路由器602和出口节点位转发路由器603。其中，入口节点为转发路由器601与中间节点位转发路由器602连接，中间节点位转发路由器602与出口节点位转发路由器603连接。
入口节点为转发路由器601用于获取组播源组播的报文，根据组播源组播的报文获取待转发报文，并将待转发报文按照指定转发路径发送至中间节点位转发路由器602或出口节点位转发路由器603。
中间节点为路由器602用于获取待转发报文，并将待转发报文按照指定转发路径发送至其他中间节点位转发路由器或出口节点位转发路由器603；
出口节点位转发路由器603用于获取待转发报文，并将待转发报文发送至接收方。
不难发现，本实施例为与上述实施例相对应的系统实施例，本实施例可与上述实施例互相配合实施。上述实施例中提到的相关技术细节和技术效果在本实施例中依然有效，为了减少重复，这里不再赘述。相应地，本实施例中提到的相关技术细节也可应用在上述实施例中。
本申请另一个实施例涉及一种电子设备，如图11所示，包括：至少一个处理器701；以及，与所述至少一个处理器701通信连接的存储器702；其中，所述存储器702存储有可被所述至少一个处理器701执行的指令，所述指令被所述至少一个处理器701执行，以使所述至少一个处理器701能够执行上述各实施例中应用于中间节点位转发路由器的转发方法，或应用于BFIR的转发方法，或应用于BFER的转发方法。
其中，存储器和处理器采用总线方式连接，总线可以包括任意数量的互联的总线和桥，总线将一个或多个处理器和存储器的各种电路连接在一起。总线还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路连接在一起，这些都是本领域所公知的，因此，本文不再对其进行进一步描述。总线接口在总线和收发机之间提供接口。收发机可以是一个元件，也可以是多个元件，比如多个接收器和发送器，提供用于在传输介质上与各种其他装置通信的单元。经处理器处理的数据通过天线在无线介质上进行传输，进一步，天线还接收 数据并将数据传送给处理器。
处理器负责管理总线和通常的处理，还可以提供各种功能，包括定时，外围接口，电压调节、电源管理以及其他控制功能。而存储器可以被用于存储处理器在执行操作时所使用的数据。
本申请另一个实施例涉及一种计算机可读存储介质，存储有计算机程序。计算机程序被处理器执行时实现上述方法实施例。
即，本领域技术人员可以理解，实现上述实施例方法中的全部或部分步骤是可以通过程序来指令相关的硬件来完成，该程序存储在一个存储介质中，包括若干指令用以使得一个设备(可以是单片机，芯片等)或处理器(processor)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
本领域的普通技术人员可以理解，上述各实施例是实现本申请的具体实施例，而在实际应用中，可以在形式上和细节上对其作各种改变，而不偏离本申请的精神和范围。

Claims (13)

  1. 一种转发方法，应用于中间节点位转发路由器，包括：
    获取待转发报文，检测所述待转发报文是否包含预设标记；其中，所述预设标记用于指示所述待转发报文有指定转发路径；
    若所述待转发报文包含预设标记，获取所述待转发报文的位索引显式复制BIER头后的协议头的信息；其中，所述协议头的信息至少用于指示所述指定转发路径；
    根据所述协议头的信息，确定下一跳；
    根据所述下一跳，查找BIER转发表，转发所述待转发报文。
  2. 根据权利要求1所述的转发方法，其中，所述BIER头后的协议头包括多协议标签交换MPLS标签栈；
    所述获取所述BIER头后的协议头的信息，包括：
    获取所述MPLS标签栈的各外层标签；其中，所述各外层标签的组合用于指示所述指定转发路径。
  3. 根据权利要求2所述的转发方法，其中，所述根据所述协议头的信息，确定下一跳，包括：
    根据与所述中间节点位转发路由器对应的外层标签，查找MPLS标签表，确定下一跳。
  4. 根据权利要求3所述的转发方法，其中，在所述确定下一跳之后，还包括：
    删除所述MPLS标签栈中与所述中间节点位转发路由器对应的外层标签。
  5. 根据权利要求2至4中任一项所述的转发方法，其中，在所述获取所述MPLS标签栈的各外层标签之后，根据所述协议头的信息，确定下一跳之前，还包括：
    判断所述各外层标签中是否有与所述中间节点位转发路由器对应的外层标签；
    若所述各外层标签中有与所述位转发路由器对应的外层标签，则再执行所述根据所述协议头的信息，确定下一跳；
    若所述各外层标签中没有与所述中间节点位转发路由器对应的外层标签，则根据预设的默认转发路径，转发所述待转发报文。
  6. 根据权利要求1所述的转发方法，其中，所述BIER头后的协议头包括分段路由SRH头或互联网协议第六版IPv6头；
    所述获取所述待转发报文的BIER头后的协议头的信息，包括：
    获取所述SRH头或所述IPv6头的段列表；其中，所述段列表用于指示所述指定转发路径。
  7. 根据权利要求6所述的转发方法，其中，所述根据所述协议头的信息，确定下一跳，包括：
    根据所述段列表，查找单播路由表，确定下一跳。
  8. 一种转发方法，应用于入口节点位转发路由器BFIR，包括：
    获取组播源组播的报文；
    根据预设的策略表，确定所述组播源组播的报文的指定转发路径；
    将所述指定转发路径封装在所述报文的位索引显式复制BIER头后的协议头中；
    封装所述BIER头，并在所述组播源组播的报文中添加预设标记，得到待转发报文。
  9. 一种转发方法，应用于出口节点位转发路由器BFER，包括：
    获取待转发报文；
    解析所述待转发报文，得到所述待转发报文的位索引显式复制BIER头后的协议头的信息；其中，所述协议头的信息至少用于指示所述待转发报文的指定转发路径；
    根据所述协议头的信息，将所述待转发报文发送至接收方。
  10. 根据权利要求9所述的转发方法，其中，所述BIER头后的协议头包括多协议标签交换MPLS标签栈；所述解析待转发报文，得到所述BIER头后的协议头的信息，包括：
    判断所述MPLS标签栈中是否有外层标签；
    若所述MPLS标签栈中有外层标签，则跳过所述外层标签，直接获取栈底标签；
    所述根据所述协议头的信息，将所述待转发报文发送至接收方，包括：
    根据所述栈底标签，查找MPLS标签表，将所述待转发报文发送至接收方。
  11. 一种转发系统，包括：入口节点位转发路由器BFIR、中间节点位转发路由器和出口节点位转发路由器BFER。
  12. 一种电子设备，包括：
    至少一个处理器；以及，
    与所述至少一个处理器通信连接的存储器；
    其中，
    所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器能够执行如权利要求1至7中任一项所述的转发方法，或者执行如权利要求8所述的转发方法，或者执行如权利要求9至10中任一项所述的转发方法。
  13. 一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时实现权利要求1至7中任一项所述的转发方法，或者实现权利要求8所述的转发方法，或者实现权利要求9至10中任一项所述的转发方法。
PCT/CN2022/095891 2021-06-10 2022-05-30 转发方法、转发系统、电子设备和计算机可读存储介质 WO2022257798A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP22819396.7A EP4340319A4 (en) 2021-06-10 2022-05-30 FORWARDING METHOD, FORWARDING SYSTEM, ELECTRONIC DEVICE AND COMPUTER-READABLE STORAGE MEDIUM
BR112023025756A BR112023025756A2 (pt) 2021-06-10 2022-05-30 Método de encaminhamento, sistema de encaminhamento, dispositivo eletrônico e meio de armazenamento legível por computador
US18/568,934 US20240291748A1 (en) 2021-06-10 2022-05-30 Forwarding method, forwarding system, electronic device and computer readable storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110647845.X 2021-06-10
CN202110647845.XA CN115473847A (zh) 2021-06-10 2021-06-10 转发方法、转发系统、电子设备和计算机可读存储介质

Publications (1)

Publication Number Publication Date
WO2022257798A1 true WO2022257798A1 (zh) 2022-12-15

Family

ID=84363440

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/095891 WO2022257798A1 (zh) 2021-06-10 2022-05-30 转发方法、转发系统、电子设备和计算机可读存储介质

Country Status (5)

Country Link
US (1) US20240291748A1 (zh)
EP (1) EP4340319A4 (zh)
CN (1) CN115473847A (zh)
BR (1) BR112023025756A2 (zh)
WO (1) WO2022257798A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106656794A (zh) * 2015-10-30 2017-05-10 中兴通讯股份有限公司 一种报文传输方法及装置
WO2018184487A1 (zh) * 2017-04-05 2018-10-11 中兴通讯股份有限公司 Bier报文的转发方法及装置
CN109246017A (zh) * 2018-11-28 2019-01-18 新华三技术有限公司 一种查询组播转发路径的方法及装置
CN112187648A (zh) * 2020-08-24 2021-01-05 中盈优创资讯科技有限公司 组播报文转发方法及装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110417657B (zh) * 2018-04-27 2022-05-17 华为技术有限公司 一种处理组播数据报文的方法及装置
WO2021073357A1 (zh) * 2019-10-14 2021-04-22 华为技术有限公司 报文处理方法、装置、系统、设备及存储介质

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106656794A (zh) * 2015-10-30 2017-05-10 中兴通讯股份有限公司 一种报文传输方法及装置
WO2018184487A1 (zh) * 2017-04-05 2018-10-11 中兴通讯股份有限公司 Bier报文的转发方法及装置
CN109246017A (zh) * 2018-11-28 2019-01-18 新华三技术有限公司 一种查询组播转发路径的方法及装置
CN112187648A (zh) * 2020-08-24 2021-01-05 中盈优创资讯科技有限公司 组播报文转发方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4340319A4 *

Also Published As

Publication number Publication date
US20240291748A1 (en) 2024-08-29
CN115473847A (zh) 2022-12-13
EP4340319A4 (en) 2024-10-30
EP4340319A1 (en) 2024-03-20
BR112023025756A2 (pt) 2024-02-27

Similar Documents

Publication Publication Date Title
WO2021063232A1 (zh) 建立bier转发表项的方法、装置和系统
US7899048B1 (en) Method and apparatus for remotely monitoring network traffic through a generic network
WO2017152576A1 (zh) 报文转发方法及装置
US6556574B1 (en) Duplicate ignore delay timer for ARP like protocol messages using are protocol
US11652735B2 (en) Multicast data packet processing method, and apparatus
US8811171B2 (en) Flow control for multi-hop networks
US8743691B2 (en) Priority aware MAC flow control
WO2019205806A1 (zh) 数据包的处理方法及装置、存储介质、电子装置
WO2020073685A1 (zh) 转发路径确定方法、装置、系统、计算机设备及存储介质
US20200153728A1 (en) Multicast Forwarding Method and Related Device
US11962491B2 (en) Source routing tunnel ingress protection
WO2021088433A1 (zh) 一种报文的处理方法，装置和系统
WO2018184487A1 (zh) Bier报文的转发方法及装置
US11888727B2 (en) Extending BGP protection for SR path ingress protection
WO2020182085A1 (zh) 报文的传输方法和设备
WO2023005018A1 (zh) 一种报文转发的方法及网络设备
KR100636273B1 (ko) 이더넷을 통한 ｍｐｌｓ 멀티캐스트 패킷 전송 장치 및 방법
WO2014205660A1 (zh) 一种转发数据包的方法、装置和路由设备
JP4040045B2 (ja) データ転送装置
WO2022257798A1 (zh) 转发方法、转发系统、电子设备和计算机可读存储介质
WO2024140374A1 (zh) 信息处理方法、设备和存储介质
US20230327983A1 (en) Performance measurement in a segment routing network
CN112311668B (zh) 一种处理bier报文的方法、网络设备及系统
US20240283740A1 (en) Recursive bitstring structure addressing
WO2024094082A1 (zh) 一种信息传输方法、装置、节点及存储介质

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

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 18568934

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 2022819396

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2022819396

Country of ref document: EP

Effective date: 20231212

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112023025756

Country of ref document: BR

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 112023025756

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20231207