WO2019205806A1 - 数据包的处理方法及装置、存储介质、电子装置 - Google Patents

数据包的处理方法及装置、存储介质、电子装置 Download PDF

Info

Publication number
WO2019205806A1
WO2019205806A1 PCT/CN2019/076756 CN2019076756W WO2019205806A1 WO 2019205806 A1 WO2019205806 A1 WO 2019205806A1 CN 2019076756 W CN2019076756 W CN 2019076756W WO 2019205806 A1 WO2019205806 A1 WO 2019205806A1
Authority
WO
WIPO (PCT)
Prior art keywords
bier
data packet
multicast
node
identification information
Prior art date
Application number
PCT/CN2019/076756
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 US17/043,052 priority Critical patent/US11627070B2/en
Priority to EP19793365.8A priority patent/EP3787243B1/en
Publication of WO2019205806A1 publication Critical patent/WO2019205806A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1881—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with schedule organisation, e.g. priority, sequence management
    • 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/74—Address processing for routing
    • H04L45/742—Route cache; Operation thereof
    • 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/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering
    • H04L45/7452—Multiple parallel or consecutive lookup operations

Definitions

  • the present disclosure relates to the field of communications, and in particular to a method and device for processing a data packet, a storage medium, and an electronic device.
  • BIER Bit Index Explicit Replication
  • a control layer (such as an SDN controller) is introduced in the BIER-TE.
  • the multicast service path is calculated and the forwarding table and multicast routing information are sent to the forwarding device, so that the multicast traffic is more flexible and controllable.
  • FIG. 1 is a schematic diagram of a BIER packet header encapsulation structure in an MPLS network in the related art of the present disclosure.
  • the bitstring field in the BIER header indicates the specific forwarding path of the multicast stream.
  • Each BFR searches the forwarding table according to the bit in the bitstring (BitPosition, BP) and performs the copy and forward operations.
  • BIER Bit-Forwarding Egress Router, BFER
  • the bitstring matches the forwarding entry of the local-decap type in the forwarding table.
  • the BIER packet is decapsulated and the Payload is delivered to Proto. ) in the network specified by the field.
  • HM Header Modification
  • BIER-in-BIER Encapsulation BBE
  • the control layer is used to calculate the backup path.
  • the BBE performs BIER encapsulation on the BIER packet again, and the next hop (Next Hop, NH) and NH Next Next Hops (NNHs).
  • a BIER protection tunnel is established between the nodes.
  • the HM technology changes the packet header bitstring to change the faulty packet to the backup path.
  • FRR FRR
  • HM and BBE have many advantages in reducing the routing layer overhead of the forwarding device and the signaling overhead of establishing a tunnel.
  • FIG. 2A and FIG. 2B are schematic diagrams of a node receiving a repetitive packet in a BIER-in-BIER FRR according to the related art of the present disclosure.
  • a multicast service ingress node is A
  • an egress node is C
  • D the multicast service transmission path is indicated by a solid line with an arrow.
  • the node A when the link (A, C) fails, the node A performs BIER-in-BIER encapsulation on the BIER packet sent to the faulty link, and the destination node is C(NH) and D (NNHs), the encapsulated BIER-in-BIER protection path is shown by the dotted line in Fig. 2B, and the BIER packet transmission path obtained by decapsulating the BIER-in-BIER packet is as indicated by the dotted line in Fig. 2B. As shown, the dashed line in the node indicates that the BIER-in-BIER packet will be decapsulated at the node to obtain the BIER packet and further processed.
  • the node D Since the BIER packet indicated by the solid line with the arrow and the FRR BIER packet indicated by the dotted line of the arrow will perform the pop-up operation at the node D, the node D will receive the duplicate packet, and there is no clear solution to solve the problem.
  • Embodiments of the present disclosure provide a method and an apparatus for processing a data packet, a storage medium, and an electronic device.
  • a data packet processing method including: setting a bit index of a data packet to explicitly copy BIER multicast identification information, where the BIER multicast identification information is used to indicate the data.
  • the multicast channel to which the packet belongs; the BIER multicast identification information is sent to the BIER ingress node.
  • a method for processing another data packet including: creating a multicast node mapping table CNMT on a local node, where the CNMT is used to describe a multicast service flow, and the local The local-decap BP information of the next hop NNH node of the node to the neighboring node does not need to perform the pop-up next hop; when the neighboring node is faulty, the data packet sent to the neighboring node is performed according to the CNMT Fast reroute FRR protection, wherein the data packet carries a bit index to explicitly copy BIER multicast identification information.
  • a processing apparatus for a data packet comprising: a setting module configured to explicitly copy a BIER multicast identification information of a bit index of a set data packet, wherein the BIER multicast identification information
  • the sending module is configured to send the BIER multicast identification information to the BIER ingress node.
  • a processing apparatus for a data packet comprising: a creating module, configured to create a multicast node mapping table CNMT on a local node, wherein the CNMT is used to describe a multicast service flow And the local-decap BP information of the next hop NNH node of the neighboring node that does not need to perform the pop-up next hop of the neighboring node; the processing module is configured to, when the neighboring node fails, according to the CNMT pair The data packet sent to the neighboring node performs fast rerouting FRR protection, wherein the data packet carries a bit index to explicitly copy BIER multicast identification information.
  • a storage medium having stored therein a computer program, wherein the computer program is configured to perform the steps of any one of the method embodiments described above at runtime.
  • the identification capability of the packet forwarding device can be enhanced, and the data packet duplication can be eliminated.
  • the technical problem that the node receives the duplicate data packet in the related art is solved, the duplicate data packet can be prevented, and the data transmission efficiency is improved.
  • FIG. 1 is a schematic diagram of a BIER packet header encapsulation structure in an MPLS network in the related art of the present disclosure
  • FIGS. 2A and 2B are schematic diagrams showing a repeated packet received by a node in a BIER-in-BIER FRR in the related art of the present disclosure
  • FIG. 3 is a flowchart of a method of processing a data packet according to an embodiment of the present disclosure
  • FIG. 4 is a flowchart of another method of processing a data packet according to an embodiment of the present disclosure.
  • FIG. 5 is a structural block diagram of a processing apparatus of a data packet according to an embodiment of the present disclosure
  • FIG. 6 is a structural block diagram of another apparatus for processing a data packet according to an embodiment of the present disclosure.
  • FIG. 7 is a schematic structural diagram of a multicast address mark mapping table in this embodiment.
  • FIG. 8 is a schematic structural diagram of a CNMT table of the embodiment.
  • FIGS. 10A-10C are schematic diagrams showing BMID information in the present embodiment.
  • 11A and 11B are schematic diagrams of calculating a backup path in the embodiment.
  • FIGS. 13A and 13B are schematic flowcharts of a BBE FRR of Embodiment 4.
  • FIGS 14A-14C are schematic diagrams showing the flow of the BBE FRR of the fifth embodiment.
  • FIG. 3 is a flowchart of a method for processing a data packet according to an embodiment of the present disclosure. As shown in FIG. 3, the process includes the following steps:
  • Step S302 setting a bit index of the data packet to explicitly copy BIER multicast identification information (BMID), where the BIER multicast identification information is used to indicate a multicast channel to which the data packet belongs;
  • BMID BIER multicast identification information
  • Step S304 the BIER multicast identification information is sent to the BIER ingress node.
  • the identification capability of the packet forwarding device can be enhanced, and the data packet duplication can be eliminated.
  • the technical problem that the node receives the duplicate data packet in the related art is solved, the duplicate data packet can be prevented, and the data transmission efficiency is improved.
  • the execution body of the foregoing step may be a network controller, such as a software defined network (SDN) controller, and the like, and may be applied to a BIER-TE FRR network, such as BBE FRR, HM FRR, etc., but is not limited thereto.
  • SDN software defined network
  • the encapsulated bit index explicitly copies the BIER multicast identification information in the following two ways:
  • the first field may be any field
  • the BIER multicast identification information is set by using a preset mapping table, where the preset mapping table is used to describe the correspondence between the multicast routing information and the BIER multicast identification information.
  • sending the BIER multicast identification information to the BIER ingress node includes: sending the BIER multicast identification information to the BIER ingress node when transmitting the multicast forwarding information of the data packet.
  • FIG. 4 is a flowchart of another method for processing a data packet according to an embodiment of the present disclosure. As shown in FIG. 4, the process includes the following steps:
  • Step S402 creating a multicast node mapping table CNMT on the local node, where the CNMT is used to describe the multicast service flow, and the local node does not need to perform the next hop of the next hop of the neighboring node.
  • -decap BP information
  • Step S404 Perform fast reroute FRR protection on the data packet sent to the neighboring node according to the CNMT when the neighboring node is faulty, where the data packet carries the bit index to explicitly copy the BIER multicast identification information.
  • performing FRR protection on the data packet sent to the neighboring node according to the CNMT includes: querying the CNMT, determining that the data packet performs a pop-up operation on the NNH of the neighboring node specified by the bit string or the bit string in the outer BIER header.
  • the LDBitMask (LD bit mask) and the outer BIER header bitstring can be operated together. If the BP bit of a certain NNH is 0, the popup operation is not required at the node, otherwise the popup operation needs to be performed on the node.
  • Querying the CNMT includes: acquiring BIER multicast identification information in a data packet of the neighboring node; and querying the CNMT according to the BIER multicast identification information.
  • the entry of the multicast node mapping table includes: adjacency, BIER multicast identification information, and an LDBitMask formed by the local-decap BP information of the NNH node that the data packet does not need to pop up.
  • performing fast reroute FRR protection on the neighboring node according to the CNMT includes:
  • the data packet includes: an inner BIER packet, an outer BIER packet, corresponding to two BIER headers, respectively an inner BIER header and an outer BIER header;
  • bit string of the outer BIER header encapsulates the BIER-in-BIER packet and forwards the BIER-in-BIER packet.
  • 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.
  • portions of the technical solution of the present disclosure that contribute substantially or to the prior art may be embodied in the form of a software product stored in a storage medium such as a ROM/RAM or a disk.
  • the optical disc includes a number of instructions for causing a terminal device (eg, a cell phone, a computer, a server, or a network device, etc.) to perform the methods of various embodiments of the present disclosure.
  • a terminal device eg, a cell phone, a computer, a server, or a network device, etc.
  • a processing device for a data packet is provided, which is used to implement the foregoing embodiments and preferred embodiments, and details are not described herein.
  • 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. 5 is a structural block diagram of a processing apparatus of a data packet according to an embodiment of the present disclosure. As shown in FIG. 5, the apparatus includes:
  • the setting module 50 is configured to explicitly copy the BIER multicast identification information by setting a bit index of the data packet, where the BIER multicast identification information is used to indicate the multicast channel to which the data packet belongs, and the sending module 52 is configured to set the BIER multicast identifier. The information is sent to the BIER ingress node.
  • FIG. 6 is a structural block diagram of another apparatus for processing a data packet according to an embodiment of the present disclosure. As shown in FIG. 6, the apparatus includes:
  • This embodiment provides a method and system for preventing duplicate packets in BIER-TE FRR.
  • BBE FRR technology as an example to explain the content of the invention, it should be emphasized that the solution to prevent duplicate packets proposed in the invention can also be set to other BIER-TE FRR schemes such as HM FRR.
  • this embodiment proposes that the BIER Multicast Identifier (BMID) is maintained by the control layer for the BIER multicast channel in the BIER-TE network. If multiple multicast services in the same subdomain are in the BIER- The TE network has the same multicast tree and shares the same BIER multicast channel. The BMID is allocated within a given interval and sent to the BFIR along with the multicast forwarding information. When the BIER multicast channel is deleted, the control layer also reclaims its bound BMID resources.
  • BMID BIER Multicast Identifier
  • the BFR needs to be able to identify the BMID information to which the multicast packet entering the BIER-TE network belongs.
  • the table can be designed to include three fields, respectively representing local-decap BP information of the NNHs that the Adjacency, BMID, and BIER-in-BIER packets do not need to pop up, called LDBitMask, and FIG. 8 is the embodiment.
  • LDBitMask three fields, respectively representing local-decap BP information of the NNHs that the Adjacency, BMID, and BIER-in-BIER packets do not need to pop up, called LDBitMask
  • FIG. 8 is the embodiment. Schematic diagram of the CNMT table structure, as shown in Figure 8.
  • the controller needs to calculate the LDBitMask for each PLR node along the multicast path.
  • BTAFT BIER-TE Adjacency FRR Table
  • control layer can send information such as BMID and LDBitMask to the forwarding device through a southbound protocol such as NetConf, BGP-LS, or PCE.
  • FIG. 9 is a general flow chart of performing BIER-in-BIER FRR in this embodiment, as shown in FIG.
  • the outer layer bitstring encapsulates the BIER-in-BIER data packet
  • the controller can pre-calculate the FRR backup path information corresponding to a certain contiguous BMID (the calculation scale is higher than the BBE scheme), and can use the LDBitMask field in the CNMT table structure in FIG. 8 to represent the FRR backup.
  • the bitstring information of the path can be pre-calculate the FRR backup path information corresponding to a certain contiguous BMID (the calculation scale is higher than the BBE scheme), and can use the LDBitMask field in the CNMT table structure in FIG. 8 to represent the FRR backup.
  • the bitstring information of the path can be applied to other BIER-TE FRR schemes.
  • the calculation process of LDBitMask in the Adjacency and HM FRR of the PLR node N in the multicast tree of a multicast service BMID can be as follows:
  • the PLR node When the fault occurs, the PLR node first obtains the BMID to which the BIER packet belongs, and then obtains the bitstring of the backup path according to the Adjacency and BMID to find the CNMT table, and then only needs to modify the bitstring field information of the BIER header to be forwarded according to the normal BIER forwarding process. HM FRR packet.
  • Embodiment 1 is a diagrammatic representation of Embodiment 1:
  • the present disclosure proposes four schemes for encapsulating BMID information in a BIER header and a scheme for maintaining BMID related information in a forwarding device:
  • FIG. 10A is schematic diagrams showing BMID information in the present embodiment. As shown in FIG. 10A, the number of representable BMIDs is 220, and the BMID is allocated within [1, 220];
  • the Entropy field is used to represent the BMID information as shown in Figure 10B.
  • the control layer is responsible for the calculation and delivery of multicast service routes, and load balancing is moved up to the control layer. Therefore, the Entropy field can be borrowed in BIER-TE to represent BMID information.
  • the first bit bit can be taken from the Resv field as the BMID flag bit. If the position is 0, the meaning of Entropy is unchanged. Otherwise, Entropy represents the BMID.
  • the length of the Entropy field is 20 bits, so the number of BMIDs that can be represented is 220, and the BMID is allocated within [1, 220];
  • the BMID information is represented using the DSCP field as shown in FIG. 10C.
  • the DSCP field is not used in the MPLS network, and the user can customize its actual meaning.
  • the length of the DSCP field is 6 bits, and the number of BMIDs that can be represented is 26. Since the BFIR-id information is encapsulated in the BIER header, the disclosure proposes that the BFIR-id and DSCP fields can be combined to represent one BMID. For two multicast services, if the corresponding BFIR is different, the BMID can be the same. For each BFIR, the number of BMIDs that can be represented is 26;
  • the information of the multicast BMID is maintained by the forwarding device, as shown in FIG.
  • the Payload can be decapsulated to obtain the multicast source IP address and the destination IP address information, so that the BMID corresponding to the data packet is obtained by looking up the table.
  • Embodiment 2 is a diagrammatic representation of Embodiment 1:
  • FIG. 11A and 11B are schematic diagrams of calculating a backup path in the present embodiment.
  • the fault protection path is calculated for the adjacency (B, D)
  • the BCDEF with fewer hops is not used, because the protection path BACGHIF is adopted. If the NH node D fails, the FRR traffic can still reach the NNH node F normally, but the protection path BACDF cannot be used.
  • Embodiment 3 is a diagrammatic representation of Embodiment 3
  • the NNH nodes are E, H, and G, and their local-decap BPs are 13, 15, and 16, respectively;
  • G is not a subtree node with C as the parent in the multicast tree indicated by the solid arrow in Fig. 12A, and LDBitMask contains 15;
  • LDBitMask contains 13.
  • the LDBitMask for the adjacent (C, F) multicast service is ..0101000000000000;
  • the BIER tunnel is the backup multicast path indicated by the dashed and dotted line in Figure 12B, and the corresponding bitstring is 3, 5, 4, 7, 10, 12, 13, 14, 15, 16 and therefore adjacent (C, F), AddBitMask is ..01111101001011100;
  • ResetBitMask contains 6, 8, 11, and 12.
  • the ResetBitMask is ..0110010100000.
  • Embodiment 4 is a diagrammatic representation of Embodiment 4:
  • FIG. 13A and 13B are schematic flowcharts of the BBE FRR of the fourth embodiment.
  • the inbound node of a multicast service is A
  • the egress node is G, H, I, and J.
  • the adjacency (C, F) of the PLR node C fails, the BBE FRR process is as follows:
  • AddBitMask as the outer bitstring to encapsulate the BIER-in-BIER data packet and forward it according to the standard forwarding process
  • the BIER-in-BIER data packet is decapsulated at nodes E, F, G, and I. If the node F is faulty, the node E, G, and I perform the decapsulation operation. Layer BIER packets are forwarded according to the standard forwarding process.
  • Embodiment 5 is a diagrammatic representation of Embodiment 5:
  • FIG. 14A-14C are schematic diagrams showing the flow of the BBE FRR of the fifth embodiment.
  • the inbound node of a multicast service is A
  • the egress node is G, H, I, and J.
  • the adjacency (C, F) of the PLR node C fails, the BBE FRR process is as follows:
  • the bitstring of the outer BIER packet is AddBitMask& ⁇ LDBitMask, ie ..010010100101110011000;
  • the outer layer bitstring encapsulates the BIER-in-BIER data packet and forwards it according to the standard forwarding process
  • the BIER-in-BIER packet performs the decapsulation operation at nodes F and I. If the node F fails, the decapsulation operation is performed only at node I to obtain the inner BIER packet and according to the standard. Forwarding process forwarding.
  • Embodiment 6 is a diagrammatic representation of Embodiment 6
  • the ingress node of a certain multicast service is A
  • the egress node is G, H, I, and J
  • the corresponding multicast identifier is assumed to be BMID.
  • the adjacency (C, F) according to the HM FRR backup path calculation process proposed in the present disclosure, first obtain the backup path BIER out node set as ⁇ I ⁇ , and then calculate the backup path of the adjacent corresponding BMID as shown in FIG. 14C.
  • the dotted line indicates that its corresponding bitstring is ..010000100100000101000.
  • the PLRC only needs to find the backup bitstring by Adjacency and BMID, and replace the header bitstring of the faulty BIER packet to forward the FRR BIER packet according to the standard procedure.
  • Embodiments of the present disclosure also provide a storage medium having stored therein a computer program, wherein the computer program is configured to execute the steps of any one of the method embodiments described above.
  • S2 Send the BIER multicast identification information to the BIER ingress node.
  • 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
  • Embodiments of the present disclosure also provide an electronic device including a memory and a processor having a computer program stored therein, the processor being configured to execute a computer program to perform the steps of any one of the method embodiments described above.
  • the electronic device may further include a transmission device and an input and output device, wherein the transmission device is connected to the processor, and the input and output device is connected to the processor.
  • modules or steps of the present disclosure described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module. As such, the disclosure is not limited to any specific combination of hardware and software.

Landscapes

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

Abstract

本公开实施例提供一种数据包的处理方法及装置、存储介质、电子装置，其中，该方法包括：设置数据包的位索引显式复制BIER组播标识信息，其中，BIER组播标识信息用于指示数据包所属的组播信道；将BIER组播标识信息发送给BIER入节点。通过本公开，解决了相关技术中节点收到重复数据包的技术问题，可以防止重复数据包，提高了数据的传输效率。

Description

数据包的处理方法及装置、存储介质、电子装置 技术领域
本公开涉及通信领域，具体而言，涉及一种数据包的处理方法及装置、存储介质、电子装置。
背景技术
在相关技术的draft-ietf-bier-architecture-草案中提出了一种称为位索引显式复制(Bit Index Explicit Replication，BIER)的组播转发技术，在此基础上，draft-eckert-bier-te-arch-提出了一种基于流量工程的BIER转发架构，称为BIER-TE。在BIER-TE中引入了控制层(如SDN控制器)，负责计算组播业务路径以及向转发设备下发转发表和组播路由等信息，从而使组播流量更加灵活可控。
[根据细则91更正 11.07.2019]　
组播流量在BIER-TE网络中传输，由BIER入节点(Bit-Forwarding Ingress Router，BFIR)对组播数据包进行BIER封装，draft-ieft-bier-mpls-encapsulation-给出了MPLS网络中具体的封装格式，如附图1所示，图1是本公开相关技术中MPLS网络中BIER包头封装结构示意图。BIER包头中bitstring字段表示组播流的具体转发路径，各BFR根据bitstring中比特位(BitPosition，BP)查找转发表并执行复制、转发操作。在BIER出节点(Bit-Forwarding Egress Router，BFER)，bitstring匹配到转发表中类型为local-decap（局部开封）的转发表项，则对BIER包进行解封装，并将Payload交付至Proto（原型）字段指定的网络中。
为在BIER-TE网络中提供link或node的故障保护，draft-eckert-bier-te-frr-总结了几种故障保护措施，如包头修改(Header Modification,HM)和BIER-in-BIER封装(BIER-in-BIER Encapsulation,BBE)。在BIER-TE网络中使用控制层计算备份路径，BBE通过对BIER数据包再次进行BIER封装，在故障点到下一跳(Next Hop，NH)和NH的下一跳(Next Next Hops，NNHs)节点间建立BIER保护隧道，HM技术通过修改包头bitstring，使故障数据包改走备份路径。相比于其它FRR技术，如RSVP-TE/P2MP FRR，HM和BBE减少了转发设备路由层面的开销和建立隧道的信令开销，具有诸多优点。
然而，在一些情形下，这些技术会导致某些节点重复收到数据包。以BBE为例，图2A和2B是本公开相关技术中BIER-in-BIER FRR中节点收到重复包示意图，如附图2A所示，某组播业务入节点为A，出节点为C、D，正常情况下组播业务传输路径用带箭头实线表示。根据草案中对BBE技术的介绍，链路(A,C)发生故障时由节点A对发往故障链路上的BIER数据包进行BIER-in-BIER封装，且目的节点为C(NH)和D(NNHs)，封装的BIER-in-BIER保护路径如附图2B中带箭头点划线所示，解封BIER-in-BIER包得到的BIER数据包传输路径如附图2B中带箭头虚线所示，节点中的虚线表示BIER-in-BIER数据包将在该节点解封得到BIER数据包并进一步处理。由于带箭头实线表示的BIER数据包和带箭头虚线表示的FRR BIER数据包都会在节点D执行弹出操作，因此节点D会收到重复数据包,目前还没有明确的 方案解决此问题。
针对相关技术中存在的上述问题，目前尚未发现有效的解决方案。
发明内容
本公开实施例提供了一种数据包的处理方法及装置、存储介质、电子装置。
根据本公开的一个实施例，提供了一种数据包的处理方法，包括：设置数据包的位索引显式复制BIER组播标识信息，其中，所述BIER组播标识信息用于指示所述数据包所属的组播信道；将所述BIER组播标识信息发送给BIER入节点。
根据本公开的一个实施例，提供了另一种数据包的处理方法，包括：在本地节点上创建组播节点映射表CNMT，其中，所述CNMT用于描述组播业务流，以及所述本地节点对邻节点的各个不需要执行弹出的下一跳的下一跳NNH节点的local-decap BP信息；在所述邻节点故障时，根据所述CNMT对发往所述邻节点的数据包进行快速重路由FRR保护，其中，所述数据包携带位索引显式复制BIER组播标识信息。
根据本公开的另一个实施例，提供了一种数据包的处理装置，包括：设置模块，设置为设置数据包的位索引显式复制BIER组播标识信息，其中，所述BIER组播标识信息用于指示所述数据包所属的组播信道；发送模块，设置为将所述BIER组播标识信息发送给BIER入节点。
根据本公开的另一个实施例，提供了一种数据包的处理装置，包括：创建模块，设置为在本地节点上创建组播节点映射表CNMT，其中，所述CNMT用于描述组播业务流，以及所述本地节点对邻节点的各个不需要执行弹出的下一跳的下一跳NNH节点的local-decap BP信息；处理模块，设置为在所述邻节点故障时，根据所述CNMT对发往所述邻节点的数据包进行快速重路由FRR保护，其中，所述数据包携带位索引显式复制BIER组播标识信息。
根据本公开的又一个实施例，还提供了一种存储介质，所述存储介质中存储有计算机程序，其中，所述计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
根据本公开的又一个实施例，还提供了一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行上述任一项方法实施例中的步骤。
通过本公开，通过封装用于表征数据包的组播业务的BIER组播标识信息，并发送给网络的BIER入节点，可以增强数据包转发设备的识别能力，消除数据包重复。解决了相关技术中节点收到重复数据包的技术问题，可以防止重复数据包，提高了数据的传输效率。
附图说明
此处所说明的附图用来提供对本公开的进一步理解，构成本申请的一部分，本公开的示意性实施例及其说明用于解释本公开，并不构成对本公开的不当限定。在附图中：
图1是本公开相关技术中MPLS网络中BIER包头封装结构示意图；
图2A和2B是本公开相关技术中BIER-in-BIER FRR中节点收到重复包示意图；
图3是根据本公开实施例的一种数据包的处理方法的流程图；
图4是根据本公开实施例的另一种数据包的处理方法的流程图；
图5是根据本公开实施例的一种数据包的处理装置的结构框图；
图6是根据本公开实施例的另一种数据包的处理装置的结构框图；
图7是本实施例组播地址标记映射表结构示意图；
图8是本实施例的CNMT表结构示意图；
图9是本实施例执行BIER-in-BIER FRR总流程图；
图10A-10C是本实施方式中表示BMID信息的示意图；
图11A和11B是本实施方式中计算备份路径的示意图；
图12A和12B是本实施方式的计算示意图；
图13A和13B是实施方式四的BBE FRR的流程示意图；
图14A-14C是实施方式五的BBE FRR的流程示意图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本公开。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
需要说明的是，本公开的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
实施例1
在本实施例中提供了一种数据包的处理方法，图3是根据本公开实施例的一种数据包的处理方法的流程图，如图3所示，该流程包括如下步骤：
步骤S302，设置数据包的位索引显式复制BIER组播标识信息(BMID)，其中，BIER组播标识信息用于指示数据包所属的组播信道；
步骤S304，将BIER组播标识信息发送给BIER入节点。
通过上述步骤，通过设置用于指示数据包所属的组播信道的BIER组播标识信息，并发送给网络的BIER入节点，可以增强数据包转发设备的识别能力，消除数据包重复。解决了相关技术中节点收到重复数据包的技术问题，可以防止重复数据包，提高了数据的传输效率。
可选地，上述步骤的执行主体可以为网络控制器，如软件定义网络(SDN)控制器等，可以应用在BIER-TE FRR网络中，如BBE FRR，HM FRR等，但不限于此。
可选地，封装位索引显式复制BIER组播标识信息包括以下两种方式：
确定待进入BIER流量工程BIER-TE网络的数据包，在数据包的BIER包头的第一字段中封装BIER组播标识信息；第一字段可以是任一字段；
通过预设映射表设置BIER组播标识信息，其中，预设映射表用于描述组播路由信息与BIER组播标识信息的对应关系。
可选地，将BIER组播标识信息发送给BIER入节点包括：在发送数据包的组播转发信息时，将BIER组播标识信息发送给BIER入节点。
在本实施例中提供了另一种数据包的处理方法，图4是根据本公开实施例的另一种数据包的处理方法的流程图，如图4所示，该流程包括如下步骤：
步骤S402，在本地节点上创建组播节点映射表CNMT，其中，CNMT用于描述组播业务流，以及本地节点对邻节点的各个不需要执行弹出的下一跳的下一跳NNH节点的local-decap BP信息；
步骤S404，在邻节点故障时，根据CNMT对发往邻节点的数据包进行快速重路由FRR保护，其中，数据包携带位索引显式复制BIER组播标识信息。
[根据细则91更正 11.07.2019]　
可选的，根据CNMT对发往邻节点的数据包进行FRR保护包括：查询CNMT，确定数据包在外层BIER头中比特串或位串(bitstring)指定的邻节点的NNH执行弹出操作。可以将LDBitMask（LD位掩码）和外层BIER包头bitstring做与操作，若某NNH的BP对应bit位为0，则不需要在该节点执行弹出操作，否则需要在该节点执行弹出操作。查询CNMT包括：获取邻节点的数据包中的BIER组播标识信息；根据BIER组播标识信息查询CNMT。
在本实施例中，组播节点映射表的表项包括：邻接，BIER组播标识信息，数据包不需要弹出的NNH节点的local-decap BP信息构成的LDBitMask。
可选的，根据CNMT对邻节点的数据包进行快速重路由FRR保护包括：
[根据细则91更正 11.07.2019]　
S11，以邻接(Adjacency)作为索引查找BIER-TE邻接快速重路由BTAFT表，得到ResetBitMask（重置位掩码）和AddBitMask（添加位掩码）；
S12，使用ResetBitMask修改内层BIER包头的bitstring；其中，数据包包括：内层BIER包，外层BIER包，对应两个BIER包头，分别是内层BIER包头和外层BIER包头；
S13，解析外层BIER包头得到数据包所属的组播业务的BIER组播标识信息；
S14，以Adjacency和BIER组播标识信息作为索引查找CNMT，得到LDBitMask；
S15，使用AddBitMask和LDBitMask，计算外层BIER包头的bitstring；
S16，以外层BIER包头的bitstring封装BIER-in-BIER数据包，并转发BIER-in-BIER数据包。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本公开的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质,如，ROM/RAM、磁碟、光盘中，包括若干指令用以使得一台终端设备(例如，手机，计算机，服务器，或者网络设备等)执行本公开各个实施例的方法。
实施例2
在本实施例中还提供了一种数据包的处理装置，该装置用于实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图5是根据本公开实施例的一种数据包的处理装置的结构框图，如图5所示，该装置包 括：
设置模块50，设置为设置数据包的位索引显式复制BIER组播标识信息，其中，BIER组播标识信息用于指示数据包所属的组播信道；发送模块52，设置为将BIER组播标识信息发送给BIER入节点。
图6是根据本公开实施例的另一种数据包的处理装置的结构框图，如图6所示，该装置包括：
创建模块60，设置为在本地节点上创建组播节点映射表CNMT，其中，CNMT用于描述组播业务流，以及本地节点对邻节点的各个不需要执行弹出的下一跳的下一跳NNH节点的local-decap BP信息；处理模块62，设置为在邻节点故障时，根据CNMT对发往邻节点的数据包进行快速重路由FRR保护，其中，数据包携带位索引显式复制BIER组播标识信息。
需要说明的是，上述各个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述各个模块以任意组合的形式分别位于不同的处理器中。
实施例3
本实施例提供了一种BIER-TE FRR中防止重复包的方法和系统。以BBE FRR技术为例讲解发明内容，需要强调的是，发明中提出的防止重复包的解决思路也可以应设置为HM FRR等其它BIER-TE FRR方案中。
根据本公开相关技术中的draft-eckert-bier-te-frr-草案，BBE和HM等FRR方案是基于拓扑的，与具体的组播业务无关，这导致在特定的业务情形下，其采用的通用保护路径，缺少业务相关的组播路由详细信息，从而导致某些节点收到重复数据包。本公开以BBE FRR为例，在草案中提出的BBE方案基础上，增加组播业务相关信息，以增强转发设备的识别能力，消除数据包重复。
示例性而言，本实施例提出由控制层为BIER-TE网络中的BIER组播信道维护一个BIER组播标识(BIER Multicast Identifier，BMID)，若同一个subdomain下多个组播业务在BIER-TE网络中有相同的组播树，则共用同一个BIER组播信道。BMID在给定的区间范围内分配，并将其和组播转发信息一同下发到BFIR。当BIER组播信道删除时，控制层同时回收其绑定的BMID资源。
在一实施例中，BFR需要能够识别进入BIER-TE网络的组播数据包所属的BMID信息。在实施中，有两种解决方案：
1)BFIR在对进入BIER-TE网络的组播数据包进行BIER封装时，需要封装此数据包所属组播业务的BMID信息，可以借用BIER包头中的某些字段或额外增加字段表示BMID信息；
2)在交换机中增加一张映射表，维护组播(源IP地址，目的组播地址)对应的BMID信息，图7是本实施例组播地址标记映射表结构示意图，如附图7所示。BFR可以通过解析数据包得到组播源、目的IP地址并查找该表得到BMID。
在一实施例中，本实施例提出为网络中本地修复节点N(Point of Local-Repair N,PLRN) 的每个邻接(Adjacency)增加一张表，称为组播节点映射表(Channel Node Mapping Table,CNMT)，维护对每个组播业务流，PLRN对Adjacency的各个NNH的local-decap BP信息。当PLRN对某Adjacency实施FRR保护时，则通过查找该表确定BIER-in-BIER数据包是否需要在外层BIER头中bitstring指定的某个NNH执行弹出操作。
示例性而言，该表可以设计为包括三个字段，分别表示Adjacency、BMID和BIER-in-BIER数据包不需要弹出的NNHs的local-decap BP信息，称为LDBitMask，图8是本实施例的CNMT表结构示意图，如附图8所示。当组播业务部署或组播路径变化时，控制器需要沿组播路径为每个PLR节点计算LDBitMask。
示例性而言，对某组播业务BMID的组播树中PLR节点N的某Adjacency，LDBitMask的计算流程如下：
1)统计PLRN对该Adjacency的所有NNHs；
2)对每个NNH节点，检查链路(PLRN,NH)在组播树中是否位于BFIR节点到该NNH的路径上，若否，则LDBitMask包含该节点的local-decap BP；
3)对每个NNH节点，检查在组播树中是否为以某NNH节点为树的子节点，若是，则LDBitMask包含该节点的Local-decap BP；
4)若LDBitMask不为0，则将表项(Adjacency，BMID，LDBitMask)加入节点N的CNMT。
在draft-eckert-bier-te-frr-草案中为提供BIER-in-BIER的保护，增加了BIER-TE邻接快速重路由表(BIER-TE Adjacency FRR Table，BTAFT)，其中ResetBitMask和AddBitMask是基于拓扑的，当系统启动或拓扑发生变化时，由控制器计算并下发。
在实现时，本公开提出控制层可以通过NetConf、BGP-LS或PCE等南向协议将BMID、LDBitMask等信息下发至转发设备。
本公开提出当PLR节点N的某Adjacency发生故障时，BBE FRR总的流程修改如下，图9是本实施例执行BIER-in-BIER FRR总流程图，如附图9所示：
[根据细则91更正 11.07.2019]　
1)以Adjacency作为index（索引）查找BTAFT表，得到ResetBitMask和AddBitMask；
2)修改内层BIER包的bitstring，内层bitstring&＝～ResetBitMask；
3)解析BIER包，得到此数据包所属组播业务的BMID；
4)以Adjacency和BMID作为index查找CNMT表，若该表项存在，则得到LDBitMask，否则转至6)；
5)计算外层BIER包的bitstring，外层bitstring＝AddBitMask&～LDBitMask；
6)以外层bitstring封BIER-in-BIER数据包；
7)按标准BIER-TE转发流程转发BIER-in-BIER数据包。
本实施例提出的防止重复包的解决思路可以应用于其它BIER-TE FRR方案。以HM FRR为例，控制器可以预先计算出对某个邻接，某BMID对应的FRR备份路径信息(计算规模较BBE方案高)，可以借用附图8中CNMT表结构中LDBitMask字段来表示FRR备份路径的bitstring信息。
示例性而言，对某组播业务BMID的组播树中PLR节点N的某Adjacency，HM FRR中LDBitMask的计算流程可以如下：
1)统计该组播业务的所有BFER节点的集合；
2)对每个BFER，判断其在组播树中是否位于以NH节点为父的子树上，若否，则从集合中移除；
3)将拓扑中失败链路移除，计算以PLR为头、BFER集合为尾的备份组播路径(失败节点在算路时同样尽量仅作为中间节点)，得到该FRR组播树对应的bitstring，即LDBitMask。
当故障发生时，PLR节点首先得到BIER包所属的BMID，然后根据Adjacency、BMID查找CNMT表即可得到备份路径的bitstring，接着只需修改BIER包头的bitstring字段信息，即可按正常BIER转发流程转发HM FRR数据包。
本实施例还包括以下实施方式：
实施方式一：
本公开提出四种方案在BIER包头中封装BMID信息和一种方案在转发设备中维护BMID相关信息：
1)在BIER包头中BFIR-id字段后面增加一个长度为20bit的字段表示BMID信息，该信息可表示成三种形式，分别如图10A、10B和10C所示。图10A-10C是本实施方式中表示BMID信息的示意图。如附图10A所示，可表示的BMID数量为220个，BMID在[1,220]内分配；
[根据细则91更正 11.07.2019]　
2)使用Entropy（熵）字段表示BMID信息，如附图10B所示。在BIER-TE中，控制层负责组播业务路由的计算和下发，负载均衡被上移至控制层实现，因此在BIER-TE中可借用Entropy字段可用于表示BMID信息。为不影响原有的Entropy作用，可从Resv字段中取第一个bit位作为BMID标志位，若该位置0，则Entropy的含义不变，反之，则Entropy表示BMID。Entropy字段长度为20bit，因此可表示的BMID数量为220个，BMID在[1,220]内分配；
3)使用DSCP字段表示BMID信息，如附图10C所示。根据草案draft-ieft-bier-mpls-encapsulation-，DSCP字段在MPLS网络中不使用，可由用户自定义其实际含义。DSCP字段长度为6bit，可表示的BMID数量为26个。由于BIER包头中封装了BFIR-id信息，本公开提出可以选择将BFIR-id和DSCP字段组合来表示一个BMID，对两个组播业务，如果其对应的BFIR不同，则BMID可以相同，此时对每个BFIR，可表示的BMID数量为26个；
4)由转发设备维护组播BMID的信息，如附图7所示。当收到BIER包时，可以解封装Payload得到组播源IP地址和目的IP地址信息，从而通过查表得到该数据包对应的BMID。此方案，可表示的BMID个数没有理论限制。
实施方式二：
控制器计算备份路径时，NH尽量仅作为叶子节点。
图11A和11B是本实施方式中计算备份路径的示意图。如附图11A所示，对邻接(B,D) 计算故障保护路径时，因为B到NNH节点F有路径B-A-C-G-H-I-F可达，则不采用跳数更少的B-A-C-D-F，这是因为采用保护路径B-A-C-G-H-I-F，若NH节点D发生故障，FRR流量仍可正常到达NNH节点F，而采用保护路径B-A-C-D-F，则不能。
仅当如附图11B所示，对邻接(B,D)计算保护路径时，B到NNH节点E的保护路径，若不通过NH节点D，则无其它路径可达，此时才将NH节点D作为中间节点计算保护路径。
实施方式三：
图12A和12B是本实施方式的计算示意图。如附图12A和12B所示，对PLR节点C的邻接(C,F)，LDBitMask、ResetBitMask和AddBitMask的计算过程如下：
1)统计PLRC的NNHs。NNH节点为E、H、G，其local-decap BP分别为13、15、16；
2)G在附图12A中带箭头实线表示的组播树中不是以C为父的子树节点，则LDBitMask中包含15；
3)在组播树中，链路(C,F)不在C到节点E的路径上，因此LDBitMask中包含13。综上，对邻接(C,F)该组播业务的LDBitMask为..0101000000000000；
4)BIER隧道即附图12B中带箭头点划线表示的备份组播路径，对应bitstring为3,5,4,7,10,12,13,14,15,16，因此对邻接(C,F)，AddBitMask为..01111101001011100；
5)C到F的connected BP为6，因此ResetBitMask包含6；
6)D到E、H的connected BP分别为8、11、12，因此ResetBitMask包含6、8、11、12。综上，对邻接(C,F)，ResetBitMask为..0110010100000。
实施方式四：
图13A和13B是实施方式四的BBE FRR的流程示意图。如附图13A和13B所示，某组播业务入节点为A，出节点为G、H、I、J，当PLR节点C的邻接(C,F)发生故障时，BBE FRR的流程如下：
1)以邻接(C,F)为index查找BTAFT，得到AddBitMask为..01011110010101011100，ResetBitMask为..0101010100000；
2)内层BIER包的bitstring为..011110001111010100010，执行内层bitstring&＝～ResetBitMask，则内层bitstring修改为..0111100010100000 00010；
3)以邻接和该组播流BMID查找CNMT，对应表项不存在；
4)以AddBitMask作为外层bitstring封BIER-in-BIER数据包并按标准转发流程转发；
5)若为链路故障，BIER-in-BIER数据包在节点E、F、G、I执行解封操作，若为节点F故障，则在节点E、G、I执行解封操作，得到内层BIER数据包并按标准转发流程转发。
实施方式五：
图14A-14C是实施方式五的BBE FRR的流程示意图。如附图14A-14C所示，某组播业务入节点为A，出节点为G、H、I、J，当PLR节点C的邻接(C,F)发生故障时，BBE FRR的流程如下：
1)以邻接(C,F)为index查找BTAFT，得到AddBitMask为..010111100101010111000，ResetBitMask为..01010101000000；
2)内层BIER包的bitstring为..0111100011100011101110，执行内层bitstring&＝～ResetBitMask，则内层bitstring修改为..0111100010100010101110；
3)以邻接和该组播流BMID查找CNMT，得到LDBitMask为..0101000000000000000；
4)外层BIER包的bitstring为AddBitMask&～LDBitMask，即..010010100101110011000；
5)以外层bitstring封BIER-in-BIER数据包并按标准转发流程转发；
6)若为链路故障，BIER-in-BIER数据包在节点F、I执行解封操作，若为节点F故障，则仅在节点I执行解封操作，得到内层BIER数据包并按标准转发流程转发。
实施方式六：
如附图14A所示，对于HM FRR，某组播业务入节点为A，出节点为G、H、I、J，假设其对应组播标识为BMID。对邻接(C,F)，按本公开中提出的HM FRR备份路径计算流程，先求得备份路径BIER出节点集合为{I}，然后计算该邻接对应BMID的备份路径如附图14C中的虚线表示，其对应的bitstring为..010000100100000101000。当(C,F)发生故障时，则PLRC只需按Adjacency和BMID查找得到备份bitstring，并替换故障BIER包的包头bitstring即可按标准流程转发FRR BIER包。
实施例4
本公开的实施例还提供了一种存储介质，该存储介质中存储有计算机程序，其中，该计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
可选地，在本实施例中，上述存储介质可以被设置为存储用于执行以下步骤的计算机程序：
S1，设置数据包的位索引显式复制BIER组播标识信息，其中，BIER组播标识信息用于指示数据包所属的组播信道；
S2，将BIER组播标识信息发送给BIER入节点。
可选地，在本实施例中，上述存储介质可以包括但不限于：U盘、只读存储器(Read-Only Memory，简称为ROM)、随机存取存储器(Random Access Memory，简称为RAM)、移动硬盘、磁碟或者光盘等各种可以存储计算机程序的介质。
本公开的实施例还提供了一种电子装置，包括存储器和处理器，该存储器中存储有计算机程序，该处理器被设置为运行计算机程序以执行上述任一项方法实施例中的步骤。
可选地，上述电子装置还可以包括传输设备以及输入输出设备，其中，该传输设备和上述处理器连接，该输入输出设备和上述处理器连接。
可选地，在本实施例中，上述处理器可以被设置为通过计算机程序执行以下步骤：
S1，设置数据包的位索引显式复制BIER组播标识信息，其中，BIER组播标识信息用于指示数据包所属的组播信道；
S2，将所述BIER组播标识信息发送给BIER入节点。
显然，本领域的技术人员应该明白，上述的本公开的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置 中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本公开不限制于任何特定的硬件和软件结合。
以上所述仅为本公开的优选实施例而已，并不用于限制本公开，对于本领域的技术人员来说，本公开可以有各种更改和变化。凡在本公开的原则之内，所作的任何修改、等同替换、改进等，均应包含在本公开的保护范围之内。

Claims (12)

  1. 一种数据包的处理方法，包括：
    设置数据包的位索引显式复制BIER组播标识信息，其中，所述BIER组播标识信息用于指示所述数据包所属的组播信道；
    将所述BIER组播标识信息发送给BIER入节点。
  2. 根据权利要求1所述的方法，其中，设置BIER组播标识信息包括以下之一：
    确定待进入BIER流量工程BIER-TE网络的数据包，在所述数据包的BIER包头的第一字段中封装所述BIER组播标识信息；
    通过预设映射表设置所述BIER组播标识信息，其中，所述预设映射表用于描述组播路由信息与BIER组播标识信息的对应关系。
  3. 根据权利要求1所述的方法，其中，将所述BIER组播标识信息发送给BIER入节点包括：
    在发送所述数据包的组播转发信息时，将所述BIER组播标识信息发送给BIER入节点。
  4. 一种数据包的处理方法，包括：
    在本地节点上创建组播节点映射表CNMT，其中，所述CNMT用于描述组播业务流，以及所述本地节点对邻节点的各个不需要执行弹出的下一跳的下一跳NNH节点的local-decap BP信息；
    在所述邻节点故障时，根据所述CNMT对发往所述邻节点的数据包进行快速重路由FRR保护，其中，所述数据包携带位索引显式复制BIER组播标识信息。
  5. 根据权利要求4所述的方法，其中，根据所述CNMT对发往所述邻节点的数据包进行FRR保护包括：
    查询所述CNMT，确定所述数据包在外层BIER头中bitstring指定的邻节点的NNH执行弹出操作。
  6. 根据权利要求5所述的方法，其中，查询所述CNMT包括：
    获取所述数据包中的BIER组播标识信息；
    根据所述BIER组播标识信息查询所述CNMT。
  7. 根据权利要求4所述的方法，其中，所述CNMT的表项包括：邻接，BIER组播标识信息，数据包不需要弹出的NNH节点的local-decap BP信息构成的LDBitMask。
  8. 根据权利要求7所述的方法，其中，根据所述CNMT对所述邻节点的数据包进行FRR保护包括：
    以邻接Adjacency作为索引查找BIER-TE邻接快速重路由BTAFT表，得到ResetBitMask和AddBitMask；
    使用ResetBitMask修改内层BIER包头的bitstring；
    解析外层BIER包头得到所述数据包所属的组播业务的BIER组播标识信息；
    以所述Adjacency和所述BIER组播标识信息作为索引查找所述CNMT，得到LDBitMask；
    使用所述AddBitMask和所述LDBitMask，计算外层BIER包头的bitstring；
    以所述外层BIER包头的bitstring封装BIER-in-BIER数据包，并转发所述BIER-in-BIER数据包；
    其中，所述数据包包括：所述内层BIER包，所述外层BIER包。
  9. 一种数据包的处理装置，其中，包括：
    设置模块，设置为设置数据包的位索引显式复制BIER组播标识信息，其中，所述BIER组播标识信息用于指示所述数据包所属的组播信道；
    发送模块，设置为将所述BIER组播标识信息发送给BIER入节点。
  10. 一种数据包的处理装置，包括：
    创建模块，设置为在本地节点上创建组播节点映射表CNMT，其中，所述CNMT用于描述组播业务流，以及所述本地节点对邻节点的各个不需要执行弹出的下一跳的下一跳NNH节点的local-decap BP信息；
    处理模块，设置为在所述邻节点故障时，根据所述CNMT对发往所述邻节点的数据包进行快速重路由FRR保护，其中，所述数据包携带位索引显式复制BIER组播标识信息。
  11. 一种存储介质，其中存储有计算机程序，其中，所述计算机程序被设置为运行时执行所述权利要求1至8任一项中所述的方法。
  12. 一种电子装置，包括存储器和处理器，其中，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行所述权利要求1至8任一项中所述的方法。
PCT/CN2019/076756 2018-04-25 2019-03-01 数据包的处理方法及装置、存储介质、电子装置 WO2019205806A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US17/043,052 US11627070B2 (en) 2018-04-25 2019-03-01 Data packet processing method and apparatus, storage medium, and electronic device
EP19793365.8A EP3787243B1 (en) 2018-04-25 2019-03-01 Data packet processing method and apparatus, storage medium, and electronic device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810379327.2A CN110401599B (zh) 2018-04-25 2018-04-25 数据包的处理方法及装置、存储介质、电子装置
CN201810379327.2 2018-04-25

Publications (1)

Publication Number Publication Date
WO2019205806A1 true WO2019205806A1 (zh) 2019-10-31

Family

ID=68294837

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/076756 WO2019205806A1 (zh) 2018-04-25 2019-03-01 数据包的处理方法及装置、存储介质、电子装置

Country Status (4)

Country Link
US (1) US11627070B2 (zh)
EP (1) EP3787243B1 (zh)
CN (1) CN110401599B (zh)
WO (1) WO2019205806A1 (zh)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10855577B2 (en) * 2018-08-21 2020-12-01 Cisco Technology, Inc. Service traffic replication and dynamic policy enforcement in a multi-cloud service mesh
US11102146B2 (en) * 2019-12-09 2021-08-24 Mellanox Technologies Tlv Ltd. Scalable pipeline for EVPN multi-homing
CN112511988B (zh) 2020-03-06 2024-04-19 中兴通讯股份有限公司 报文转发方法、设备、系统、网络设备和存储介质
CN112511443A (zh) * 2020-03-26 2021-03-16 中兴通讯股份有限公司 消息处理方法、装置、设备、存储介质及系统
US20210105207A1 (en) * 2020-11-18 2021-04-08 Intel Corporation Direct memory access (dma) engine with network interface capabilities
CN114598635A (zh) * 2020-12-02 2022-06-07 华为技术有限公司 报文传输的方法和装置
CN114598634A (zh) * 2020-12-02 2022-06-07 华为技术有限公司 报文传输的方法、获取对应关系的方法、装置及系统
US11451468B2 (en) * 2021-01-28 2022-09-20 Cisco Technology, Inc. Management framework for BIER in-band traffic accounting and path monitoring
CN117501673A (zh) * 2021-06-21 2024-02-02 华为技术有限公司 一种用于bier-te路径的bgp
CN116112696A (zh) * 2021-11-11 2023-05-12 中兴通讯股份有限公司 直播方法、系统、bier控制器、路由器、设备及可读介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150138961A1 (en) * 2013-09-17 2015-05-21 Cisco Technology, Inc. Per-Prefix LFA FRR With Bit Indexed Explicit Replication
CN104811387A (zh) * 2014-01-24 2015-07-29 思科技术公司 具有位索引显式复制的等价多路径
CN105556899A (zh) * 2013-09-17 2016-05-04 思科技术公司 位索引显式复制
CN107204867A (zh) * 2016-03-18 2017-09-26 中兴通讯股份有限公司 一种信息传输方法、装置和系统

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9544230B2 (en) * 2013-09-17 2017-01-10 Cisco Technology, Inc. Migration support for bit indexed explicit replication
US9832031B2 (en) * 2014-10-24 2017-11-28 Futurewei Technologies, Inc. Bit index explicit replication forwarding using replication cache
CN111934944A (zh) * 2014-12-30 2020-11-13 华为技术有限公司 位转发入口路由器、位转发路由器及操作管理维护检测方法
US9544240B1 (en) * 2015-07-13 2017-01-10 Telefonaktiebolaget L M Ericsson (Publ) MTU discovery over multicast path using bit indexed explicit replication
US10103981B2 (en) * 2015-11-01 2018-10-16 Cisco Technology, Inc. BIER forwarding validation
CN107171977B (zh) * 2016-03-08 2021-08-17 中兴通讯股份有限公司 报文转发方法及装置
US10447496B2 (en) * 2017-03-30 2019-10-15 Cisco Technology, Inc. Multicast traffic steering using tree identity in bit indexed explicit replication (BIER)
US10511548B2 (en) * 2017-06-22 2019-12-17 Nicira, Inc. Multicast packet handling based on control information in software-defined networking (SDN) environment
CN109246624B (zh) * 2017-07-11 2020-04-03 华为技术有限公司 一种组播转发方法及相关设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150138961A1 (en) * 2013-09-17 2015-05-21 Cisco Technology, Inc. Per-Prefix LFA FRR With Bit Indexed Explicit Replication
CN105556899A (zh) * 2013-09-17 2016-05-04 思科技术公司 位索引显式复制
CN104811387A (zh) * 2014-01-24 2015-07-29 思科技术公司 具有位索引显式复制的等价多路径
CN107204867A (zh) * 2016-03-18 2017-09-26 中兴通讯股份有限公司 一种信息传输方法、装置和系统

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
EP3787243A1 (en) 2021-03-03
CN110401599A (zh) 2019-11-01
CN110401599B (zh) 2022-08-02
EP3787243B1 (en) 2023-07-19
EP3787243A4 (en) 2021-07-21
US20210036950A1 (en) 2021-02-04
US11627070B2 (en) 2023-04-11

Similar Documents

Publication Publication Date Title
WO2019205806A1 (zh) 数据包的处理方法及装置、存储介质、电子装置
US10693765B2 (en) Failure protection for traffic-engineered bit indexed explicit replication
EP3734906B1 (en) Method and device for bearing multicast virtual private network
US10158561B2 (en) Data plane learning of bi-directional service chains
US10103981B2 (en) BIER forwarding validation
CN106603413B (zh) 通过指定路径传输流量的方法和装置
US20200153728A1 (en) Multicast Forwarding Method and Related Device
CN109660460B (zh) Bier-te信息的处理方法、服务器及存储介质
CN107770073A (zh) 一种信息同步的方法，装置及系统
US11962491B2 (en) Source routing tunnel ingress protection
JP2022537296A (ja) Ｅｖｐｎメッセージ転送方法、システム、記憶媒体及び端末
CN112491718A (zh) 报文头的处理方法及装置、存储介质、电子装置
US20230291682A1 (en) Method and device for processing data packet, storage medium, and electronic device
US11888727B2 (en) Extending BGP protection for SR path ingress protection
CN116094987A (zh) 转发路径的确定方法及装置
CN110535675B (zh) 一种组播快速切换的方法及装置
WO2024082617A1 (zh) 转发表索引的通告方法、节点及存储介质
US20240146642A1 (en) BIER-TE Encapsulation With Multiple Sets
US10924395B2 (en) Seamless multipoint label distribution protocol (mLDP) transport over a bit index explicit replication (BIER) core
US20230283558A1 (en) Bit Index Explicit Replication Traffic Engineering Fast Reroute
CN115733796A (zh) 通信方法及装置
CN116648893A (zh) 位索引显式复制流量工程出口保护
CN116848831A (zh) 用于bier-te的igp扩展

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019793365

Country of ref document: EP

Effective date: 20201125