WO2019165900A1 - 一种处理组播数据报文的方法及装置 - Google Patents

一种处理组播数据报文的方法及装置 Download PDF

Info

Publication number
WO2019165900A1
WO2019165900A1 PCT/CN2019/075317 CN2019075317W WO2019165900A1 WO 2019165900 A1 WO2019165900 A1 WO 2019165900A1 CN 2019075317 W CN2019075317 W CN 2019075317W WO 2019165900 A1 WO2019165900 A1 WO 2019165900A1
Authority
WO
WIPO (PCT)
Prior art keywords
identifier
label
data packet
node
bier
Prior art date
Application number
PCT/CN2019/075317
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 EP22177937.4A priority Critical patent/EP4120630A1/en
Priority to EP19760490.3A priority patent/EP3751805B1/en
Publication of WO2019165900A1 publication Critical patent/WO2019165900A1/zh
Priority to US17/009,640 priority patent/US11233724B2/en
Priority to US17/549,202 priority patent/US11652735B2/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/16Arrangements for providing special services to substations
    • H04L12/18Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1836Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with heterogeneous network architecture
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/16Arrangements for providing special services to substations
    • H04L12/18Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1863Arrangements for providing special services to substations for broadcast or conference, e.g. multicast comprising mechanisms for improved reliability, e.g. status reports
    • H04L12/1877Measures taken prior to transmission
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/16Multipoint routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/24Multipath
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/48Routing tree calculation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/50Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/50Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H04L45/507Label distribution
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing
    • H04L45/742Route cache; Operation thereof

Definitions

  • the embodiments of the present invention relate to the field of communications technologies, and in particular, to a method and an apparatus for processing a multicast data packet.
  • Multicast technology refers to the use of a specific multicast address to transmit multicast data packets to a host set corresponding to a multicast group according to the maximum delivery principle.
  • the basic method is as follows: The source host sends only one multicast data packet, and its destination address is the multicast group address. All receivers in a multicast group can receive a multicast data packet.
  • Multicast technology implements data transmission between point-to-multipoint (P2MP) in Internet Protocol (IP) networks, which can effectively save network bandwidth and reduce network load.
  • P2MP point-to-multipoint
  • IP Internet Protocol
  • a multicast tree includes a P2MP tree with a specific edge node as the root and other edge nodes as leaves.
  • the particular edge node is an edge node that is close to the multicast source and is capable of communicating with the multicast source.
  • the other edge node is an edge node in the multicast network other than the specific edge node.
  • Each edge node that is a leaf can be assigned a bit position that can be used to uniquely identify an edge node in the multicast tree as a leaf.
  • Each of the edge nodes of the leaf passes its bit position through a tree building protocol, such as protocol independent multicast (PIM) protocol, label distribution protocol (LDP) multipoint expansion (multipoint).
  • PIM protocol independent multicast
  • LDP label distribution protocol
  • multipoint multipoint
  • the extensions for LDP (mLDP) protocol or the Resource Reservation Protocol-Traffic Engineering (RSVP-TE) for the traffic engineering extension is sent to the root node of the multicast tree.
  • Each node of the multicast tree can know the edge node corresponding to each bit position as a leaf.
  • the root node may encapsulate a bit string in a multicast data message sent to an edge node that is a leaf.
  • the bit position in the bit string indicates the destination edge node to which the multicast data message is to be reached.
  • the node in the multicast tree After receiving the multicast data packet containing the bit string, the node in the multicast tree forwards the packet according to the bit string included in the multicast data packet, so that the multi
  • the embodiment of the present invention provides a method and an apparatus for processing a multicast data packet, which solves the problem of high deployment cost and difficulty of deployment of the BIER technology in the multicast network in the prior art.
  • the first aspect provides a method for processing a multicast data packet, which is applied to a P2MP-based BIER multicast tree.
  • the intermediate node of the multicast tree supports forwarding PIER packets by using P2MP, where the method includes: The intermediate node receives the first multicast data packet, where the BIER header of the first multicast data packet includes a first label, and the intermediate node acquires the first forwarding entry according to the first label, where the first The forwarding entry includes the first label, the first identifier, and the second identifier, where the first identifier is used to identify the multicast tree, and the second identifier is used to perform P2MP forwarding on the packet; The node obtains a second forwarding entry according to the first identifier, where the second forwarding entry includes the first identifier and the second label, and the intermediate node is configured according to the second identifier and the second forwarding entry.
  • the intermediate node supports the use of the P2MP to forward the BIER message.
  • the intermediate node does not support processing the data except the BIER tag in the BIER header.
  • the intermediate node uses the P2MP to forward the BIER message, where the bit string is Processing includes reading, arithmetic (AND operation) of bit strings, and subsequent forwarding actions. The forwarding action is based on the AND result to determine whether to forward to the next hop.
  • the intermediate node may also have the role of a multicast leaf, that is, the intermediate node may send a multicast data packet to the lower-level node, and may also send a multicast IP packet to the locally connected device.
  • the intermediate node when the intermediate node cannot identify and process the bit string in the BIER header, but supports the use of the P2MP to forward the BIER message, the intermediate node can read only the BIER tag when receiving the BIER message. It is not necessary to read and analyze the data other than the BIER tag in the BIER header, and use the P2MP to forward the BIER message, so that the BIER technology can be deployed without hardware upgrade of the node, thereby reducing the deployment cost and deployment difficulty.
  • the second forwarding entry further includes an outbound interface
  • the intermediate node is configured according to the second identifier, the second forwarding entry, and the first multicast And obtaining, by the data packet, the second multicast data packet, and sending, by the intermediate node, replacing, by the second label, the first label included in the first multicast data packet according to the second identifier And obtaining the second multicast data packet, where the intermediate node sends the second multicast data packet by using the outbound interface.
  • the outbound interface is determined by the intermediate node according to an identifier of a downstream node thereof, and is not necessarily determined according to an interface that receives information of a downstream node thereof.
  • the intermediate node may replace the first label included in the first multicast data packet with only the second label when forwarding the first multicast data packet.
  • the second multicast data packet is obtained and sent through the outbound interface, thereby simplifying the processing mode of the BIER packet, so that the intermediate node can use the P2MP to forward the BIER packet, thereby reducing the deployment of the BIER technology. Cost and difficulty.
  • the method before the obtaining, by the intermediate node, the first forwarding entry, the method further includes: the intermediate node, according to the first configuration information, the first Generating the first forwarding table by using a label and the first identifier, where the first configuration information is used to indicate that the intermediate node forwards a BIER packet by using a P2MP, and the second identifier is according to the first configuration information.
  • the intermediate node may generate the second identifier according to the first configuration information, or search for a corresponding relationship table according to the first configuration information to obtain the second identifier.
  • the intermediate node may obtain the second identifier by using a corresponding configuration, and generate the first forwarding entry, and may forward the BIER packet by using the P2MP when forwarding the BIER packet.
  • the second forwarding entry further includes a third identifier and an outbound interface, where the third identifier is used to indicate deleting data other than the BIER label in the BIER header.
  • the outbound interface is determined by the intermediate node according to an identifier of a downstream node thereof, and is not necessarily determined according to an interface that receives information of a downstream node thereof.
  • the intermediate node may also delete data other than the BIER tag in the BIER header, and forward the BIER packet. Further, the deployment cost and difficulty of the BIER technology can be reduced.
  • the method before the obtaining, by the intermediate node, the second forwarding entry, the method further includes: the intermediate node receiving the downstream node of the multicast tree Sending the second label and the second configuration information, where the second configuration information is used to indicate that the downstream node does not support deleting data other than the BIER label in the BIER header; the intermediate node is according to the second label And generating, by the second configuration information, the second forwarding entry, where the third identifier is an identifier obtained according to the second configuration information.
  • the downstream node of the multicast tree may be the next hop node of the intermediate node in the message transmission path formed by the intermediate node and the specific leaf node.
  • the intermediate node may obtain the second identifier according to the corresponding configuration, and generate the second forwarding entry, so that the BIER header may be deleted in addition to the BIER label when forwarding the BIER packet.
  • the data before the obtaining, by the intermediate node, the second forwarding entry, the method further includes: the intermediate node receiving the downstream node
  • the second aspect provides a method for processing a multicast data packet, which is applied to a P2MP-based BIER multicast tree, where the intermediate node of the multicast tree supports deleting data other than the BIER tag in the BIER header.
  • the method includes: the intermediate node receives a first multicast data packet, where a BIER header of the first multicast data packet includes a first label, and the intermediate node acquires a first forwarding entry according to the first label
  • the first forwarding entry includes the first label and the first identifier, where the first identifier is used to identify the multicast tree, and the intermediate node obtains a second forwarding entry according to the first identifier.
  • the second forwarding entry includes the first identifier, the second identifier, and the second label, where the second identifier is used to indicate deleting data other than the BIER label in the BIER header; and the intermediate node is according to the second Forwarding the entry and the first multicast data packet, and obtaining the second multicast data packet, where the second multicast data packet includes the second label.
  • the intermediate node may delete the BIER tag in the BIER header of the multicast data packet when forwarding the multicast data packet.
  • the external data enables the downstream node to process or forward the received multicast data packet, so that the BIER packet can be forwarded without hardware upgrade of the node, thereby reducing the deployment cost of the BIER technology. Difficulty.
  • the second forwarding entry further includes an outbound interface, where the intermediate node obtains the first according to the second forwarding entry and the first multicast data packet. And sending, by the intermediate node, the data of the BIER header of the first multicast data packet except the first label, according to the second identifier, and obtaining the deleted data.
  • the intermediate node sends the second multicast data packet by using the outbound interface.
  • the outbound interface is determined by the intermediate node according to an identifier of a downstream node thereof, and is not necessarily determined according to an interface that receives information of a downstream node thereof.
  • the intermediate node may replace the first label included in the first multicast data packet with only the second label when forwarding the first multicast data packet.
  • the second multicast data packet is obtained and sent through the outbound interface, thereby simplifying the processing manner of the BIER packet, so that the intermediate node can forward the packet carrying only the BIER label, thereby reducing the BIER.
  • the method before the obtaining, by the intermediate node, the second forwarding entry, the method further includes: the intermediate node receiving the downstream node of the multicast tree Sending the second label and configuration information, the configuration information is used to indicate that the downstream node does not support deleting data other than the BIER label in the BIER header; the intermediate node is configured according to the second label and the second node And generating, by the information, the second forwarding entry, where the second identifier is an identifier obtained according to the configuration information.
  • the downstream node of the multicast tree may be the next hop node of the intermediate node in the message transmission path formed by the intermediate node and the specific leaf node.
  • the intermediate node may obtain the second identifier according to the corresponding configuration, and generate the second forwarding entry, so that the BIER header may be deleted in addition to the BIER label when forwarding the BIER packet.
  • the data before the obtaining, by the intermediate node, the second forwarding entry, the method further includes: the intermediate node receiving the downstream node of
  • a third aspect provides a method for processing a multicast data packet, which is applied to a P2MP-based BIER multicast tree, where the multicast tree includes a leaf node, and the leaf node does not support processing of a bit string in a BIER header.
  • the method includes: receiving a second multicast data packet, where the BIER header of the second multicast data packet includes only a second BIER label; and acquiring a third forwarding entry according to the multicast tree identifier, where The third forwarding entry includes a fourth identifier, where the fourth identifier is used to indicate that the BIER label is deleted, and the second BIER label in the second multicast data packet is deleted according to the fourth identifier.
  • the multicast IP packet is obtained, and the multicast IP packet is sent to the local outbound interface.
  • the method further includes: generating, according to the pre-configured deletion label indication information and the first identifier, the third forwarding entry, where the fourth identifier is according to the The identifier of the configuration information is used to indicate that the leaf node deletes the BIER label when forwarding the multicast data packet to the local device.
  • a forwarding device is provided, where the forwarding device is an intermediate node in a multicast tree applied to a P2MP-based BIER, and the forwarding device supports forwarding a BIER packet by using a P2MP, where the forwarding device can implement the The function of the method for processing multicast data messages provided by any of the possible implementations of the first aspect.
  • the functions may be implemented by hardware or by corresponding software implemented by hardware.
  • the hardware or software includes one or more corresponding units of the above functions.
  • the forwarding device may include a receiving unit, an obtaining unit, and a sending unit.
  • the forwarding device may further include a generating unit.
  • the forwarding device includes a processor, a memory, a communication interface, and a bus, where the processor, the memory, and the communication interface are connected by using the bus.
  • the memory is for storing program code, when the program code is executed by the processor, causing the forwarding device to perform the processing of the multicast datagram provided by any one of the possible implementations of the first aspect to the first aspect The steps in the method of the text.
  • a forwarding device is provided, where the forwarding device is an intermediate node in a multicast tree applied to a P2MP-based BIER, and the medium forwarding device supports deleting data other than the BIER tag in the BIER header.
  • the forwarding device may implement the function of the method for processing a multicast data message provided by any one of the possible implementations of the second aspect to the second aspect.
  • the functions may be implemented by hardware or by corresponding software implemented by hardware.
  • the hardware or software includes one or more corresponding units of the above functions.
  • the forwarding device may include a receiving unit, an obtaining unit, and a sending unit.
  • the forwarding device may further include a generating unit.
  • the forwarding device includes a processor, a memory, a communication interface, and a bus, where the processor, the memory, and the communication interface are connected by using the bus.
  • the memory is for storing program code, when the program code is executed by the processor, causing the forwarding device to perform the processing of the multicast datagram provided by any one of the possible implementations of the second aspect to the second aspect The steps in the method of the text.
  • a forwarding device is provided, where the forwarding device is a leaf node in a multicast tree applied to a P2MP-based BIER, and the forwarding device does not support processing of a bit string in a BIER header, and the forwarding device may The function of the method for processing a multicast data message provided by any one of the possible implementations of the third aspect to the third aspect.
  • the functions may be implemented by hardware or by corresponding software implemented by hardware.
  • the hardware or software includes one or more corresponding units of the above functions.
  • the forwarding device may include a receiving unit, a processing unit, and a sending unit.
  • the forwarding device includes a processor, a memory, a communication interface, and a bus, where the processor, the memory, and the communication interface are connected by using the bus.
  • the memory is configured to store program code, when the program code is executed by the processor, causing the forwarding device to perform processing of a multicast datagram provided by any one of the possible implementations of the third aspect to the third aspect The steps in the method of the text.
  • a still further aspect of the present application provides a computer readable storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the first aspect or the first aspect described above
  • a method for processing a multicast data message provided by any of the possible implementations.
  • a still further aspect of the present application provides a computer readable storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the second aspect or the second aspect described above
  • a method for processing a multicast data message provided by any of the possible implementations.
  • a computer program product comprising instructions which, when run on a computer, cause the computer to perform the processing provided by any of the above first aspect or any of the possible implementations of the first aspect The method of multicast data packets.
  • a computer program product comprising instructions which, when run on a computer, cause the computer to perform the processing provided by any of the possible implementations of the second aspect or the second aspect above The method of multicast data packets.
  • any device, computer storage medium or computer program product of the above-mentioned method for processing a multicast data message is used to execute the corresponding method provided above, and therefore, the beneficial effects thereof can be achieved.
  • FIG. 1 is a schematic structural diagram of a multicast tree according to an embodiment of the present disclosure
  • FIG. 2 is a schematic structural diagram of a BIER head according to an embodiment of the present application.
  • FIG. 3 is a schematic flowchart of a method for processing a multicast data packet according to an embodiment of the present disclosure
  • FIG. 4 is a schematic flowchart of a method for processing a multicast data packet according to an embodiment of the present disclosure
  • FIG. 5 is a schematic flowchart of a third method for processing a multicast data packet according to an embodiment of the present disclosure
  • FIG. 6 is a schematic flowchart of a fourth method for processing a multicast data packet according to an embodiment of the present disclosure
  • FIG. 7 is a schematic diagram of forwarding a first BIER packet according to an embodiment of the present application.
  • FIG. 8 is a schematic diagram of forwarding a second BIER packet according to an embodiment of the present disclosure.
  • FIG. 9 is a schematic diagram of forwarding a third BIER packet according to an embodiment of the present application.
  • FIG. 10 is a schematic diagram of forwarding a fourth BIER packet according to an embodiment of the present application.
  • FIG. 11 is a schematic diagram of forwarding a fifth BIER packet according to an embodiment of the present application.
  • FIG. 12 is a schematic structural diagram of a first forwarding device as an intermediate node according to an embodiment of the present disclosure
  • FIG. 13 is a schematic structural diagram of a second forwarding device as an intermediate node according to an embodiment of the present disclosure
  • FIG. 14 is a schematic structural diagram of a third forwarding device as an intermediate node according to an embodiment of the present disclosure.
  • FIG. 15 is a schematic structural diagram of a fourth forwarding device as an intermediate node according to an embodiment of the present disclosure.
  • FIG. 1 is a schematic structural diagram of a multicast tree according to an embodiment of the present disclosure.
  • the multicast tree can include a root node, an intermediate node, and a leaf node.
  • the intermediate node may refer to a node other than the edge node, such as node B and node C in FIG.
  • An edge node can include a root node and a leaf node.
  • Node A is the root node.
  • Node D, Node E, and Node F are leaf nodes.
  • the transmission path between the node E and the node C can replace the transmission path between the node B and the node C in FIG. 1 to generate another multicast tree.
  • the node E as a leaf node also functions as an intermediate node
  • the node E is referred to as a bud node.
  • the structure of the multicast tree shown in FIG. 1 is merely exemplary and is not intended to limit the application.
  • the process of forwarding the multicast data packet includes: the root node of the multicast tree receives the multicast data packet sent by the multicast source, and the root node sends the multicast data packet to the leaf node of the multicast tree.
  • the root node forwards the multicast data packet to the downstream node.
  • the downstream node of a node refers to the next hop node of the node in the transmission path along the direction from the root node to the leaf node in the multicast tree. If the downstream node of the root node is an intermediate node, the intermediate node sends the multicast data packet to the leaf node of the multicast tree through its downstream node. After receiving the multicast data packet, the leaf node sends it to the host connected to the local port through the local port.
  • the bud node sends the copied multicast data packet to the downstream node through the local port.
  • node A sends a multicast data packet from the multicast source to its downstream node B.
  • the Node B replicates the multicast data packet and sends the multicast data packet to the node E and the node C downstream thereof.
  • the node C copies the multicast data packet and sends the multicast data packet to the node F and the node D downstream thereof.
  • Node F and node D can respectively send the multicast data packets through their respective local ports.
  • the node E is a bud node
  • the node E can copy the multicast data packet, and send a multicast data packet through its local port and a port that can communicate with the downstream C node.
  • the relationship between the bit string, the bit position, and the edge node is described by taking a bit string capable of identifying four edge nodes as an example.
  • the bit position corresponding to the node D is 1, the bit position corresponding to the node E is 2, the bit position corresponding to the node F is 3, and the bit position corresponding to the node A is 4.
  • the bit string corresponding to the multicast data packet may be represented as 0001.
  • the bit string corresponding to the multicast data packet can be represented as 0010.
  • the bit string corresponding to the multicast data packet may be represented as 0100.
  • the bit string corresponding to the multicast data message may be represented as 0101.
  • nodes D, E, and F advertise their respective bit positions to their respective upstream nodes through a tree-building protocol.
  • the upstream node of a certain node is the previous hop node of the certain node on the transmission path in the direction from the root node to the leaf node of the multicast tree.
  • the node A After receiving the notifications of the nodes D, E, and F, the node A acquires the bit positions of the nodes D, E, and F and saves them. After receiving the multicast data packet from the multicast source, the node A determines that the multicast data packet needs to be sent to the nodes E and F according to the multicast source information and the multicast group information. Node A obtains a bitstring of 0110 according to the bit positions of node E and node F. The node A obtains a BIER message according to the bit string and the multicast data packet. The BIER message includes a BIER header and the multicast data message. The bit string included in the BIER header is 0110. Node A sends the BIER message to Node B.
  • the BIER header includes a 32-bit BIER-label, 64-bit other fields, and a bitstring.
  • the BIER-label includes tag values and other information for the tag.
  • the BIER-label can be used to determine the length of the bitstring.
  • the tag value can occupy the first 20 bits of the BIER-label.
  • Other information of the tag may occupy the last 12 bits of the BIER-label.
  • the length of the bitstring can be 64bit, 128bit or 256bit.
  • the length of the bitstring can also be set to other values. The length of the bitsring is not illustrated here.
  • the other fields can be found in the corresponding content in RFC8296.
  • each node included in the multicast tree Before the multicast data packet is forwarded by the P2MP-based BIER technology, each node included in the multicast tree establishes a forwarding entry through the control plane. After the forwarding entry is established, each node included in the multicast tree sends a multicast data packet according to the forwarding entry at the forwarding plane.
  • the process of establishing a forwarding entry and the process of forwarding a multicast data packet are respectively described in different embodiments.
  • the forwarding entry of each node in the multicast tree may be established hop by hop from the leaf node to the root node.
  • the following describes the forwarding entry of each node and the process of establishing a forwarding entry.
  • the root node supports BIER packet forwarding of P2MP, and the root node can identify and process the bit string in the BIER header.
  • the forwarding entry of the root node includes the following two types: a first forwarding entry and a second forwarding entry.
  • the first forwarding entry may be represented as a forwarding equivalence class (FEC) to a next hop label forwarding entry (NHLFE) mapping (FEC to NHLFE, FTN).
  • the second forwarding entry may be represented as BIER_NHLFE.
  • the FTN includes a multicast source (S), a multicast group (G), a tree tree identifier (treeid), and a bit string.
  • S multicast source
  • G multicast group
  • treeid tree tree identifier
  • bit string For example, the FTN is represented as (S, G, treeid, bitstring).
  • the treeid included in the FTN is an identifier obtained by the root node according to a P2MP ID from its downstream node in the process of establishing a multicast tree.
  • the treeid included in the FTN is used to uniquely identify a multicast tree locally at the root node.
  • the root node may search for the FTN according to (S, G) in the received multicast data packet to obtain a treeid and a bitstring.
  • the leaf node that receives the multicast data message is determined by the bit position of the bitstring in the FTN.
  • the embodiment of the present application uses a P2MP ID as a specific example of the identifier used by the tree-building protocol, and describes a method for obtaining a forwarding entry for each node of the multicast tree.
  • the P2MP ID can be replaced according to the adopted tree-building protocol.
  • the identifier used in the tree-building protocol is a P2MP session.
  • the tree-building protocol is mLP, and the identifier used in the tree-building protocol is P2MP FEC.
  • the tree-building protocol is PIM, and the identifier used in the tree-building protocol is the multicast source group information used to establish the multicast tree.
  • the multicast source group information can be expressed as (S, G).
  • the embodiment of the present application is described by taking a P2MP ID from a downstream node as an example.
  • the P2MP ID can also be obtained by the upstream node.
  • the method for obtaining the P2MP ID from the upstream node in the embodiment of the present application is not described again.
  • the BIER_NHLFE includes a treeid, an out interface, an outlabel, and a forwarding bitmask (F-BM).
  • the BIER_NHLFE is represented as (treeid, outinterface, outlabel, F-BM).
  • the root node may obtain a BIER_NHLFE including the treeid according to a treeid in the FTN.
  • the root node may obtain outinterface, outlabel, and F-BM according to the obtained BIER_NHLFE.
  • the F-BM is a parameter obtained by the root node according to the bit position advertised by the leaf node of the multicast data packet corresponding to the (S, G).
  • the root node When the root node sends a BIER message to the leaf node corresponding to the bitstring, the root node may perform a logical AND operation on the bitstring included in the BIER header and the F-BM in the BIER_NHLFE. If the result of the AND operation is non-zero, the BIER message is sent through the outbound interface corresponding to the outinterface of the BIER_NHLFE. The BIER tag in the BIER packet sent by the outbound interface corresponding to the outinterface is encapsulated as an outlabel. If the result of the AND operation is 0, the BIER message is not sent to the outbound interface corresponding to the outinterface in the BIER_NHLFE.
  • the intermediate node supports the BIER technique, and at least one node in the downstream node of the intermediate node does not support deleting data other than the BIER tag in the BIER header.
  • the forwarding entry of the intermediate node includes the following two types: a third forwarding entry and a fourth forwarding entry.
  • the third forwarding entry may be represented as a BIER incoming label map (BIER_ILM).
  • the fourth forwarding entry can be represented as BIER_NHLFE.
  • the parameter type of the fourth forwarding entry is the same as that of the BIER_NHLFE in the root node, and is not described here.
  • the third forwarding entry and the fourth forwarding entry may also adopt other names, which are not specifically limited herein.
  • the BIER_ILM includes an inlabel, a treeid, a bitstring length, and a first flag bit.
  • Inlabel is a label of the intermediate node sent by the intermediate node to the root node.
  • the treeid in BIER_ILM is an identifier obtained by the intermediate node according to the P2MP ID from its downstream node in the process of establishing a multicast tree.
  • the treeid in BIER_ILM is used to uniquely identify the multicast tree locally at the intermediate node.
  • the intermediate node obtains the BIER_ILM by using the BIER tag in the received BIER packet as an inlabel.
  • Bitstringlen is used to identify the length of the bitstring in the BIER header.
  • the length of the bitstring in the packet carrying the BIER header and the length of the F-BM in the fourth forwarding entry are both bitstringlen.
  • BIER head message is used to identify the length of the bitstring in the BIER header.
  • the length of the bitstring in the packet carrying the BIER header and the length of the F-BM in the fourth forwarding entry are both bitstringlen.
  • Bitstringlen is the advertisement from the downstream node in the process of controlling the surface to generate the entry.
  • a method of sending a forwarding entry to a node of a multicast tree by using a method of sending a downstream node to an upstream node is described as an example.
  • the bitstring may be from a path message sent by the upstream node to the downstream node, or may be from a reservation message (RESV message) sent by the downstream node to the upstream node.
  • RESV message reservation message
  • the BIER_NHLFE includes a treeid, an outinterface, an outlabel, an F-BM, and a second flag.
  • outinterface, outlabel, and F-BM refer to the corresponding content in the second forwarding entry.
  • For the meaning of the treeid refer to the meaning of the treeid in the third forwarding entry.
  • the intermediate node may learn, by using configuration information sent by the downstream node, that at least one downstream node does not support deleting data other than the BIER tag in the BIER header.
  • the at least one downstream node may support reading the BIER tag.
  • the configuration information is used to identify that the downstream node does not support deleting data other than the BIER tag in the BIER header.
  • the intermediate node can obtain a treeid according to the BIER_ILM.
  • the intermediate node When the AND operation of the bitstring and the F-BM in the BIER_NHLFE is non-zero, the intermediate node deletes data other than the BIER tag in the BIER header, and replaces the BIER tag in the BIER header with an outlabel. .
  • the intermediate node may further send the packet that carries the P2MP label but does not carry other parameters of the BIER header after the label is replaced, by referring to the root node.
  • the intermediate node may also configure the corresponding BIER_NHLFE for the downstream node supporting the BIER technology in a conventional manner, and details are not described herein again.
  • the intermediate node supports the BIER technique and has the role of a leaf node. At least one of the downstream nodes of the intermediate node does not support deleting data other than the BIER tag in the BIER header.
  • the forwarding entry of the intermediate node includes a fifth forwarding entry and a sixth forwarding entry, in addition to the third forwarding entry and the fourth forwarding entry in (i).
  • the fifth forwarding entry may be represented as BIER_NHLFE_Leaf.
  • the sixth forwarding entry may be represented as a multicast forwarding information base (MFIB).
  • the BIER_NHLFE_Leaf includes: a treeid and a third flag.
  • the BIER header in the BIER message is deleted to delete the 12-byte plus bitstringlen length data starting from the BIER tag in the BIER message.
  • the intermediate node searches for the local MFIB by deleting the multicast data packet of the BIER header, and sends the MFIB to the local outbound interface according to the matched MFIB.
  • the MFIB can be expressed as (S, G, localmcastId). The localmcastId is used to locate the MFIB_LocalLeaf entry.
  • the intermediate node having the leaf role also uses the localmcastId to find the MFIB_LocalLeaf to obtain the local interface of the intermediate node having the leaf role.
  • MFIB_LocalLeaf can be expressed as (localmcastId, outinterface).
  • the intermediate node supports forwarding using P2MP, which does not support the identification and processing of the bitstring in the BIER header.
  • the identification and processing of the bitstring in the BIER header includes reading the bitstring in the BIER header and using the bitstring to determine whether to forward the packet carrying the BIER header to the downstream node.
  • the forwarding entry of the intermediate node includes the following two types: a seventh forwarding entry and an eighth forwarding entry.
  • the seventh forwarding entry may be represented as P2MP_ILM.
  • the eighth forwarding entry may be represented as P2MP_NHLFE.
  • the P2MP_ILM includes an inlabel, a treeid, and a fourth flag. Inlabel and treeid can be found in the corresponding contents in (i) and (ii).
  • the fourth flag bit may be set according to its own performance in the process of generating the forwarding entry by the intermediate node. The performance of the intermediate node includes: supporting P2MP forwarding and not supporting recognition processing of the bitstring in the BIER header.
  • the P2MP_NHLFE includes a treeid, an outinterface, and an outlabel.
  • the meanings of the treeid, outinterface and outlabel can be found in the corresponding contents in (i) and (ii).
  • the P2MP_NHLFE can be expressed as (treeid, outinterface, outlabel).
  • the forwarding by using the P2MP means forwarding according to the label carried in the to-be-forwarded packet and the corresponding forwarding entry.
  • the corresponding forwarding entry may be a P2MP_NHLFE determined according to the treeid in the P2MP_ILM.
  • the intermediate node supports forwarding using P2MP.
  • the intermediate node does not support the identification and processing of the bitstring in the BIER header.
  • At least one node in the downstream node of the intermediate node does not support deleting data other than the BIER tag in the BIER header.
  • the forwarding entry of the intermediate node includes the following: a seventh forwarding entry and a ninth forwarding entry in (iii).
  • the content of the ninth forwarding entry that is the same as the eighth forwarding entry may be referred to (iii).
  • the second flag bit can be referred to the corresponding content in (i).
  • the forwarding entry of the intermediate node may include (ii) in addition to the seventh forwarding entry and the ninth forwarding entry.
  • the fifth forwarding entry and the sixth forwarding entry are both.
  • Any of the above flag bits is set by the intermediate node according to corresponding configuration information carried in the advertisement sent by the downstream node.
  • the representation of any of the flag bits is not limited to the above representation.
  • the leaf node supports deleting the BIER header.
  • inlabel is the label of the leaf node.
  • the leaf node does not support deleting data other than the BIER tag in the BIER header.
  • the leaf node has the role of an intermediate node, and the forwarding entry of the leaf node having the intermediate node role can be referred to the forwarding entry of the intermediate node with the leaf role in b.
  • the treeid in the forwarding entry of the leaf node may be the identifier obtained by the leaf node according to the P2MP ID in the process of establishing the multicast tree.
  • the treeid is used to uniquely identify the multicast tree locally at the leaf node.
  • the leaf node of the multicast tree learns the P2MP identifier (ID) corresponding to the multicast tree.
  • the P2MP ID includes an IP address of the root node and an identifier of the multicast tree where the leaf node is located.
  • the identifier of the multicast tree where the leaf node is located may be an identifier represented by a sequence number.
  • the leaf node of the multicast tree learns the next hop node in the upstream direction. As shown in Figure 1, node A is the next hop node in the upstream direction of node B, node B is the next hop node in the upstream direction of node E, and node C is the next hop node in the upstream direction of node D, node B.
  • the leaf node of the multicast tree can learn its corresponding bit position.
  • Node D can advertise its bit position to be 1 by transmitting a bitmask with a content of 0001.
  • node E can advertise its bit position to 2 by sending a bitmask with content 0010.
  • Node F can advertise its bit position to be 3 by sending a bitmask with content 0100.
  • the leaf node of the multicast tree can send a label identifying itself to its upstream node.
  • the leaf node of the multicast tree may also send configuration information indicating whether it supports deleting data other than the BIER tag in the BIER header to its upstream node.
  • the leaf node of the multicast tree can send the bitmask, P2MP ID and its own label to the next hop node in its upstream direction.
  • the intermediate node may obtain the corresponding forwarding entry in (1) according to the foregoing information sent by the leaf node.
  • the leaf node may obtain a corresponding forwarding entry in (1) according to the configuration information and its own label.
  • the intermediate node may use label ⁇ by node> as an outlabel.
  • the intermediate node obtains a treeid according to the identifier of the multicast tree in the P2MP ID.
  • the intermediate node may use the bitmask as an F-BM according to its own capabilities.
  • the intermediate node may set a flag according to the received configuration information.
  • the intermediate node obtains a corresponding bit string according to the bitmask sent by the downstream node, and specifically, may perform an OR operation on the bitmask from the downstream node to obtain a corresponding bit string.
  • the intermediate node may send the supported capability, its own label, and the obtained bitstring to the IP address of the root node included in the P2MP ID.
  • the method for specifically transmitting the supported capability, its own label, and the obtained bitstring may include: the intermediate node obtaining a next hop node in the upstream direction according to the IP of the root node; the intermediate node is in the upstream direction The next hop node sends its own label and the obtained bitstring.
  • the capabilities supported by the intermediate node may be sent by means of configuration information.
  • the capabilities supported by the intermediate node can be found in the corresponding description in (1).
  • the intermediate node may obtain the forwarding entry related to the in label in the above (1) according to its own capability, the obtained treeid, and its own label.
  • the label of the intermediate node itself is an inlabel in the forwarding entry of the intermediate node.
  • Node C obtains the next hop in the direction of the root node as Node B according to the IP of the root node.
  • the configuration information sent by node C is used to indicate the capabilities of node C and its connected leaf nodes.
  • Node C can establish corresponding forwarding entries according to the information sent by nodes D and F and label ⁇ byC>.
  • the label of node B can be label ⁇ byB>.
  • the Node B can establish corresponding forwarding entries according to the information sent by the nodes E and C and the label ⁇ byB>.
  • the root node establishes a description of the forwarding entry: after receiving the information sent by the downstream node, the root node may establish a forwarding entry of the root node as described in (1) above according to the information sent by the downstream node. For example, as shown in FIG. 1, the node A obtains a corresponding forwarding entry according to the information from the Node B, the capability of the node A itself, and the label of the node A.
  • the forwarding entry of the root node of the multicast tree the forwarding entry of the intermediate node, and the forwarding entry of the leaf node in the embodiment corresponding to FIG. 3, FIG. 4, FIG. 5 or FIG. 6 below, refer to the above (1).
  • the forwarding entry of the intermediate node, and the forwarding entry of the leaf node in the embodiment corresponding to FIG. 3, FIG. 4, FIG. 5 or FIG. 6 below refer to the above (1).
  • the corresponding content in For the specific manner of generating a forwarding entry by any node of the multicast tree in the embodiment corresponding to FIG. 3, FIG. 4, FIG. 5 or FIG. 6 below, refer to the corresponding content in (2) above.
  • FIG. 3 is a schematic flowchart of a method for processing a multicast data packet according to an embodiment of the present disclosure. This method is applied to the P2MP-based BIER multicast tree.
  • the intermediate node of the multicast tree supports forwarding of received packets by using P2MP. The method provided by the embodiment of the present application will be described below with reference to FIG. 3.
  • Step 301 The intermediate node receives the first multicast data packet, where the BIER header of the first multicast data packet includes the first label.
  • the intermediate node uses the P2MP to forward the received message.
  • the received packet may be a multicast data packet carrying a BIER header or a multicast data packet without parameters other than the BIER tag in the BIER header.
  • the parameter other than the BIER tag in the BIER header may be a bitstring.
  • the identification process may include a bit string read, an operation (AND operation), and a subsequent forwarding action.
  • the forwarding action may refer to determining whether to perform a forwarding operation to the next hop according to the AND result.
  • the first label in the BIER header of the first multicast data packet is a label of the intermediate node.
  • the first multicast data message may be sent by the upstream node of the intermediate node to the intermediate node.
  • the upstream node may be the root node or other intermediate nodes other than the intermediate node.
  • the root node supports the identification and processing of the bitstring in the BIER header.
  • the root node may obtain the treeid as the first identifier according to (S, G) and FTN in the multicast data packet. And bitstring.
  • the root node finds BIER_NHLFE (treeid, outinterface, outlabel, F-BM) according to the obtained treeid.
  • the root node performs an AND operation on the bitstring and the F-BM. When the result of the logical AND operation is non-zero, the first multicast data message is obtained according to the bitstring and the outlabel as the first label.
  • the root node sends the first multicast data packet to the outbound interface identified by the out interface to send the first multicast data packet to the intermediate node.
  • the intermediate node that is the upstream node can have the same capability as the root node, and can forward the BIER message by referring to the method adopted by the root node.
  • the intermediate node that is the upstream node does not support the processing of the data other than the BIER tag in the BIER header, and the intermediate node that is the upstream node can process the received first multicast datagram according to the following method provided by the embodiment of the present application. Text.
  • Step 302 The intermediate node obtains a first forwarding entry according to the first label, where the first forwarding entry includes the first label, the first identifier, and the second identifier, where the first identifier is used to identify the multicast tree, and the second identifier is used to identify the multicast tree.
  • the identifier is used to indicate P2MP forwarding of the packet.
  • the intermediate node may obtain the first forwarding entry according to the first label.
  • the first identifier in the first forwarding entry is used to identify the multicast tree, and the second identifier is used to instruct P2MP forwarding on the packet.
  • the first identifier may be the treeid included in the forwarding entry of the intermediate node mentioned in the foregoing embodiment.
  • Step 303 The intermediate node obtains a second forwarding entry according to the first identifier, where the second forwarding entry includes the first identifier and the second label.
  • the intermediate node may obtain the second forwarding entry according to the first identifier.
  • the second tag included in the second forwarding entry is its own tag sent by the downstream node of the intermediate node.
  • the second forwarding entry may include a P2MP_NHLFE represented as (treeid, outlabel).
  • the outlabel in the second forwarding entry may be referred to as a second label.
  • the second entry included in the P2MP_NHLFE on the intermediate node mentioned in b above may also be included in the second entry.
  • Step 304 The intermediate node obtains and sends the second multicast data packet according to the second identifier, the second forwarding entry, and the first multicast data packet, where the second multicast data packet includes the second label.
  • the intermediate node determines to perform P2MP forwarding according to the second identifier. After determining that the P2MP forwarding is performed, the intermediate node may not need to identify the parameters other than the BIER tag of the received BIER header.
  • the intermediate node processes the first multicast data packet according to the second label in the second forwarding entry to obtain the second multicast data packet.
  • the BIER tag in the BIER header of the second multicast data message is the second tag.
  • the intermediate node may send the second multicast data message to its downstream node.
  • the intermediate node acquires and sends the second data multicast packet through step 304.
  • the method will be different and will be explained separately below.
  • the downstream node of the intermediate node supports deleting data other than the BIER tag in the BIER header
  • the second forwarding entry may further include an outbound interface.
  • the outbound interface may be determined according to the identifier of the downstream node, and the interface of the outbound interface and the information sent by the intermediate node to the downstream node may be the same or different.
  • the step 304 may include: the intermediate node replaces the first label in the first multicast data packet with the second label in the second forwarding entry according to the second identifier, to obtain the second multicast data packet. The intermediate node sends the second multicast data packet to its downstream node through the outbound interface in the second forwarding entry.
  • the intermediate node may replace the BIER label in the BIER header of the first multicast data packet with outlabel.
  • the second multicast data packet is obtained, and the second multicast data packet is sent to the downstream node through the outinterface.
  • the first multicast data packet and the second multicast data packet may all be packets carrying the BIER header.
  • the second forwarding entry when the downstream node of the intermediate node does not support deleting data other than the BIER tag in the BIER header, the second forwarding entry further includes a third identifier and an outbound interface, and the third identifier is used to indicate deletion.
  • the outbound interface may also be determined according to the identifier of the downstream node, and the interface of the outbound interface and the information sent by the intermediate node to the downstream node may be the same or different.
  • the step 304 may include: the intermediate node replaces the first label included in the first multicast data packet with the second label according to the second identifier, and obtains the first multicast data packet after the label replacement;
  • the third identifier is used to delete the data of the BIER header of the first multicast data packet after the label replacement, except for the second label, to obtain the second multicast data packet, that is, the second multicast data packet includes only the second Packets and multicast IP packets; the intermediate node sends the second multicast data packet through the outbound interface.
  • the intermediate node may use the first multicast data.
  • the second multicast data packet that is, the second multicast data packet, includes the second packet and the multicast IP packet.
  • the intermediate node sends a second multicast data packet to its downstream node through the outinterface.
  • the first multicast data packet may be a packet carrying a BIER header
  • the second multicast data packet may be a packet carrying a P2MP label but not carrying other parameters of the BIER header.
  • the leaf node can receive the second multicast data packet.
  • the leaf node may obtain the third forwarding entry according to the first identifier, where the third forwarding entry includes the first identifier and the fourth identifier, and the fourth identifier is used to indicate that the second label is deleted, so that the leaf node may be deleted according to the third identifier.
  • the second label in the second multicast data packet obtains the multicast IP packet.
  • the leaf node reads the source IP address and the destination IP address of the IP header in the multicast IP packet, that is, the multicast group IP address, matches the local multicast forwarding entry, and determines the local outgoing interface according to the local multicast forwarding entry.
  • the multicast forwarding entry may include the MFIB (S, G, localmcastId), and the (S, G) is called the multicast source group information.
  • the localmcastId may be used to indicate the local outgoing interface.
  • the leaf node may further generate a third forwarding entry. Specifically, the leaf node may generate a third forwarding entry according to the indication information and the first identifier, where the indication information is used to indicate that the leaf node deletes the BIER label when forwarding the packet locally, and the fourth identifier is according to the indication. The identifier of the information obtained.
  • the intermediate node may also send a multicast IP packet to the local outbound interface of the intermediate node according to the method of processing the second multicast data packet by the leaf node.
  • the description in the node is not described in detail in this embodiment of the present application.
  • the intermediate node may further generate a first forwarding entry and a second forwarding entry required for forwarding the first multicast data packet.
  • the method may further include step 300a.
  • Step 300a The intermediate node generates a first forwarding table according to the first configuration information, the first label, and the first identifier, where the first configuration information is used to indicate that the intermediate node forwards the BIER packet by using the P2MP, and the second identifier is according to the first configuration.
  • the second identifier is an identifier obtained according to the first configuration information.
  • the obtaining the second identifier may include: generating a second identifier according to the first configuration information, or searching for the corresponding relationship table according to the first configuration information to obtain the second identifier.
  • the first configuration information may be configured for the intermediate node, so that the intermediate node obtains the second identifier according to the first configuration information, and according to the first label, the first identifier, and the second
  • the identifier generates a first forwarding entry.
  • the method may further include steps 300b-300c before the intermediate node acquires the second forwarding entry according to the first identifier (ie, step 303), the method may further include steps 300b-300c.
  • step 300a and step 300b-step 400c are located before step 301 as an example for description.
  • Step 300b The intermediate node receives the second label and the second configuration information sent by the downstream node of the multicast tree, where the second configuration information is used to indicate that the downstream node does not support deleting data other than the BIER label in the BIER header.
  • the downstream node of the intermediate node may send the second configuration information to the intermediate node and send the second tag to the intermediate node.
  • Step 300c The intermediate node generates a second forwarding entry according to the first identifier, the second label, and the second configuration information, where the third identifier is an identifier obtained according to the second configuration information.
  • the third identifier is an identifier obtained according to the second configuration information.
  • the method for obtaining the third identifier may include: generating a third identifier according to the second configuration information, or searching for the corresponding relationship table according to the second configuration information to obtain the third identifier.
  • the intermediate node may obtain the third identifier according to the second configuration information, and generate a second forwarding entry according to the first identifier, the second label, and the third identifier.
  • the outlabel is label ⁇ by node2>, which is the label of the downstream node of the intermediate node.
  • the intermediate node if the intermediate node cannot identify and process the bit string of the BIER header, but supports the use of the P2MP to forward the BIER message, the intermediate node receives the first multicast data packet and obtains the first forwarding table. And the second forwarding data packet is processed by the intermediate node according to the second identifier and the second forwarding entry in the first forwarding entry, where the P2MP forwarding is performed on the packet, to process the first multicast data packet.
  • the second multicast data packet is obtained, and the BIER header of the first multicast data packet is not required to be read and analyzed during processing, so that the BIER packet can be forwarded without hardware upgrade of the node, thereby saving The cost of hardware upgrades.
  • the intermediate node when the downstream node of the intermediate node does not support deleting the data other than the BIER tag in the BIER header, the intermediate node can also delete the BIER header of the multicast data packet except the BIER tag when forwarding the multicast data packet.
  • the data enables the downstream nodes to process or forward the received multicast data packets, thereby enabling the forwarding of BIER packets without hardware upgrades to the nodes, further saving the cost of hardware upgrades. .
  • FIG. 5 is a schematic flowchart of a method for processing a multicast data packet according to an embodiment of the present application, which is applied to a P2MP-based BIER multicast tree, where an intermediate node of the multicast tree supports deleting a BIER header except BIER.
  • Figure 5 For data outside the label, see Figure 5, which includes the following steps.
  • Step 501 The intermediate node receives the first multicast data packet, where the BIER header of the first multicast data packet includes the first label.
  • Step 502 The intermediate node obtains the first forwarding entry according to the first label, where the first forwarding entry includes a first label and a first identifier, where the first identifier is used to identify the multicast tree.
  • the intermediate node may obtain the first forwarding entry according to the first label.
  • the first identifier in the first forwarding entry is used to identify the multicast tree.
  • the first identifier may be the treeid in the forwarding entry provided by the foregoing embodiment, and the first label is the label of the intermediate node, first.
  • the forwarding entry may include P2MP_ILM represented as (inlabel, treeid). Inlabel can be the label of the intermediate node.
  • Step 503 The intermediate node acquires a second forwarding entry according to the first identifier, where the second forwarding entry includes a first identifier, a second identifier, and a second label, where the second identifier is used to delete data in the BIER header except the BIER label. .
  • the intermediate node may obtain the second forwarding entry according to the first identifier.
  • the second tag included in the second forwarding entry is a tag assigned by the downstream node of the intermediate node and sent to the intermediate node.
  • Step 504 The intermediate node obtains and sends the second multicast data packet according to the second forwarding entry and the first multicast data packet, where the second multicast data packet includes the second label.
  • the intermediate node may process the first multicast data packet according to the second forwarding entry to obtain the second label.
  • the second multicast data packet may send the second multicast data message to its downstream node.
  • the second forwarding entry may further include an egress interface, where the egress interface may be determined according to the identifier of the downstream node, and the egress interface may be the same as or different from the interface that the intermediate node receives the information sent by the downstream node.
  • the intermediate node may delete the data other than the first label in the BIER header of the first multicast data packet according to the second identifier in the second forwarding entry, and obtain the first multicast datagram after deleting the data. Text.
  • the intermediate node replaces the first label included in the first multicast data packet after the data is deleted by using the second label, and obtains the second multicast data packet.
  • the intermediate node sends a second multicast data packet to its downstream node by using the outbound interface in the second forwarding entry.
  • the first multicast data packet may be a packet carrying a BIER header
  • the second multicast data packet may be a packet carrying a P2MP label but not carrying other parameters of the BIER header.
  • the leaf node can receive the second multicast data packet.
  • the leaf node may obtain the third forwarding entry according to the first identifier, where the third forwarding entry includes the first identifier and the fourth identifier, and the fourth identifier is used to indicate that the second label is deleted, so that the leaf node may be deleted according to the third identifier.
  • the second label in the second multicast data packet obtains the multicast IP packet.
  • the leaf node reads the source IP address and the destination IP address of the IP header in the multicast IP packet, that is, the multicast group IP address, matches the local multicast forwarding entry, and determines the local outgoing interface according to the local multicast forwarding entry.
  • the multicast forwarding entry may include the MFIB (S, G, localmcastId), and the localmcastId may be used to indicate the local outgoing interface.
  • For the method for the leaf node to obtain the third forwarding entry and the fourth identifier refer to the corresponding content in the embodiment corresponding to FIG. 3.
  • the method before the intermediate node acquires the second forwarding entry according to the first identifier (ie, step 503), the method further includes: steps 500a-500b.
  • the step 500 is located before step 501 as an example.
  • Step 500a The intermediate node receives the second label and configuration information sent by the downstream node of the multicast tree, where the configuration information is used to indicate that the downstream node does not support deleting data other than the BIER label in the BIER header.
  • the downstream node of the intermediate node may send configuration information to the intermediate node and send its assigned second tag to the intermediate node.
  • Step 500b The intermediate node generates a first forwarding entry according to the second label and the configuration information, where the second identifier is an identifier obtained according to the configuration information.
  • the second identifier is an identifier obtained according to the configuration information.
  • the intermediate node may obtain the second identifier according to the configuration information, and generate a second forwarding entry according to the first identifier, the second label, and the second identifier.
  • the outlabel is label ⁇ by node2>, that is, the label of the downstream node of the intermediate node.
  • the intermediate node may further generate a first forwarding entry according to the first identifier and the first identifier. For example, the intermediate node generates a first forwarding entry according to label ⁇ by node1> as the first label (node1 indicates the intermediate node) and the treeid as the first identifier.
  • the first forwarding entry is a P2MP_ILM identified as (inlabel, treeid).
  • the inlabel is label ⁇ by node1>, which is the label of the intermediate node.
  • the multicast tree provided by the embodiment of the present invention may include a node that supports the BIER technology and a node that does not support the BIER technology, and may be processed according to the operation corresponding to the flag in the forwarding entry of the node, and details are not described herein.
  • the node that does not support the BIER technique refers to a node that does not support deleting data other than the BIER tag in the BIER header.
  • node F does not support deleting data other than the BIER tag in the BIER header.
  • the remaining nodes support deleting data other than the BIER tag in the BIER header, and the node C can generate a corresponding forwarding entry according to the information from the F.
  • the node C can process the received BIER message in a corresponding manner according to its forwarding entry. For example, when the node C forwards the multicast data packet to the node F, the node B can delete the data other than the BIER tag in the BIER header of the multicast data packet.
  • the BIER header of the multicast data packet received by the node F contains only the BIER tag.
  • node C and node F do not support deleting data other than the BIER tag in the BIER header.
  • the remaining nodes support deleting data other than the BIER tag in the BIER header, and the node B can be processed by the method of node C in FIG. Received BIER message.
  • the BIER header of the multicast data packet received by the node C includes only the BIER tag.
  • the BIER header of the multicast data message forwarded by node C to node F and node D also includes only the BIER tag. Since the node D supports the BIER technology, the BIER header of the multicast data packet sent by the node C includes only the BIER tag, and the node D can be configured not to delete the data other than the BIER tag in the BIER header.
  • Node B and Node F do not support deleting data other than the BIER tag in the BIER header.
  • the remaining nodes support deleting data other than the BIER tag in the BIER header.
  • Node A can be processed by the method of Node C in Figure 7.
  • Nodes C, E, and D can process the received multicast data message by referring to the manner of node D in FIG.
  • Node C, Node F, and Node D do not support deleting data other than the BIER tag in the BIER header.
  • the remaining nodes support deleting data other than the BIER tag in the BIER header.
  • Node B can use Node C in Figure 7.
  • the method handles the received BIER message.
  • the BIER header of the multicast data message forwarded by node C to node F and node D also includes only the BIER tag.
  • Node E can process the received multicast data message by the method of node D in FIG.
  • node B to node F do not support deleting data other than the BIER tag in the BIER header.
  • Node A supports deleting data other than the BIER tag in the BIER header, and node A uses the method of node C in FIG. Received BIER message. Forward and process BIER messages according to P2MP.
  • the node E becomes a bud node.
  • the processing mode of the node E refer to the processing modes of the intermediate node and the leaf node, and details are not described herein.
  • the intermediate node when the downstream node of the intermediate node does not support deleting the data except the BIER tag in the BIER header, the intermediate node may also delete the BIER header of the multicast data packet when forwarding the multicast data packet.
  • the data except the BIER tag enables the downstream node to process or forward the received multicast data packet, so that the BIER message can be forwarded without hardware upgrade of the node, saving hardware. The cost of the upgrade.
  • each network element such as an intermediate node and a leaf node.
  • each network element such as an intermediate node and a leaf node.
  • it includes hardware structures and/or software modules corresponding to the execution of the respective functions.
  • the present application can be implemented in a combination of hardware or hardware and computer software in combination with the elements and algorithm steps of the various examples described in the embodiments disclosed herein. Whether a function is implemented in hardware or computer software to drive hardware depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods to implement the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present application.
  • the embodiment of the present application may divide the function module into the intermediate node according to the foregoing method example.
  • each function module may be divided according to each function, or two or more functions may be integrated into one module.
  • the above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of the module in the embodiment of the present application is schematic, and is only a logical function division, and the actual implementation may have another division manner. The following is an example of dividing each functional module by using corresponding functions:
  • FIG. 12 shows a possible structural diagram of a forwarding device as an intermediate node involved in the above embodiment.
  • the forwarding device as the intermediate node supports forwarding of the BIER message by using the P2MP, and includes: a receiving unit 1201, an obtaining unit 1202, and a sending unit 1203.
  • the receiving unit 1201 is configured to support the forwarding device as the intermediate node to perform step 301 in FIG. 3 or steps 300b and 301 in FIG. 4;
  • the obtaining unit 1202 is configured to support the forwarding device as the intermediate node to perform FIG. 3 Or step 302 and step 303 in FIG. 4;
  • the obtaining unit 1202 and the sending unit 1203 are further configured to support the forwarding device as the intermediate node to perform step 304 in FIG.
  • the forwarding device as the intermediate node may further include a generating unit 1204, and the generating unit 1204 is configured to support the forwarding device as the intermediate node to perform step 300a and step 300c in FIG. 4. All the related content of the steps involved in the foregoing method embodiments may be referred to the functional description of the corresponding functional modules, and details are not described herein again.
  • the obtaining unit 1202 and the generating unit 1204 in the present application may be the processor of the forwarding device as the intermediate node, and the receiving unit 1201 may be the receiver, the sending unit of the forwarding device as the intermediate node. 1203 may be the transmitter of the forwarding device as the intermediate node, and the transmitter may be generally integrated with the receiver as a transceiver, and the specific transceiver may also be referred to as a communication interface.
  • FIG. 13 is a schematic diagram showing a possible logical structure of an intermediate node involved in the foregoing embodiment provided by an embodiment of the present application.
  • the forwarding device as the intermediate node supports forwarding the BIER message by using the P2MP, and includes: a processor 1302 and a communication interface 1303.
  • the processor 1302 is configured to control and manage the action of the forwarding device as the intermediate node.
  • the processor 1302 is configured to support the step of the forwarding device as the intermediate node to perform the foregoing obtaining unit 1202 and the generating unit 1204, and/or Other processes of the techniques described herein.
  • the forwarding device as an intermediate node may further include a memory 1301 and a bus 1304.
  • the processor 1302, the communication interface 1303, and the memory 1301 are connected to each other through a bus 1304.
  • the communication interface 1303 is configured to support the forwarding device as an intermediate node to perform communication;
  • the memory 1301 is for storing program codes and data of the forwarding device as an intermediate node.
  • the processor 1302 can be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. It is possible to implement or carry out the various illustrative logical blocks, modules and circuits described in connection with the present disclosure.
  • the processor may also be a combination of computing functions, for example, including one or more microprocessor combinations, combinations of digital signal processors and microprocessors, and the like.
  • the bus 1304 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus or the like.
  • PCI peripheral component interconnect
  • EISA extended industry standard architecture
  • FIG. 14 shows a possible structural diagram of a forwarding device as an intermediate node involved in the above embodiment.
  • the forwarding device as an intermediate node supports deleting data other than the BIER tag in the BIER header, and includes: a receiving unit 1401, an obtaining unit 1402, and a transmitting unit 1403.
  • the receiving unit 1401 is configured to support the forwarding device as the intermediate node to receive step 501 in FIG. 5 or steps 500a and 501 in FIG. 6;
  • the obtaining unit 1402 is configured to support the forwarding device as the intermediate node to perform FIG. 5 or Step 502 and step 503 in FIG.
  • the obtaining unit 1402 and the sending unit 1403 are further configured to support the forwarding device as the intermediate node to perform step 504 in FIG. 5 or FIG. 6.
  • the forwarding device as the intermediate node further includes: a generating unit 1404, configured to perform step 500b in FIG. 6. All the related content of the steps involved in the foregoing method embodiments may be referred to the functional description of the corresponding functional modules, and details are not described herein again.
  • the obtaining unit 1402 and the generating unit 1404 in the present application may be the processor of the forwarding device as the intermediate node, and the receiving unit 1401 may be the receiver, the sending unit of the forwarding device as the intermediate node.
  • 1403 may be the transmitter of the forwarding device as the intermediate node, and the transmitter may be generally integrated with the receiver as a transceiver, and the specific transceiver may also be referred to as a communication interface.
  • FIG. 15 is a schematic diagram showing a possible logical structure of a forwarding device as an intermediate node involved in the foregoing embodiment provided by the embodiment of the present application.
  • the forwarding device as an intermediate node supports deleting data other than the BIER tag in the BIER header, including: the processor 1502 and the communication interface 1503.
  • the processor 1502 is configured to control and manage the actions of the forwarding device as an intermediate node, for example, the steps of the processor 1502 for executing the obtaining unit 1402 and the generating unit 1404, and/or other techniques for the techniques described herein process.
  • the forwarding device as an intermediate node may further include a memory 1501 and a bus 1504.
  • the processor 1502, the communication interface 1503, and the memory 1501 are connected to each other through a bus 1504.
  • the communication interface 1503 is configured to support the forwarding device as an intermediate node to perform communication;
  • the memory 1501 is for storing program codes and data of the forwarding device as an intermediate node.
  • the processor 1502 can be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. It is possible to implement or carry out the various illustrative logical blocks, modules and circuits described in connection with the present disclosure.
  • the processor may also be a combination of computing functions, for example, including one or more microprocessor combinations, combinations of digital signal processors and microprocessors, and the like.
  • the bus 1504 may be a Peripheral Component Interconnect Standard (PCI) bus or an Extended Industry Standard Architecture (EISA) bus or the like.
  • PCI Peripheral Component Interconnect Standard
  • EISA Extended Industry Standard Architecture
  • a readable storage medium stores computer execution instructions, when a device (which may be a single chip microcomputer, a chip, etc.) or a processor executes FIG. 3 or FIG. 4 The steps in the method of processing a multicast data message.
  • the aforementioned readable storage medium may include various media that can store program codes, such as a USB flash drive, a removable hard disk, a read only memory, a random access memory, a magnetic disk, or an optical disk.
  • a readable storage medium stores computer execution instructions, when a device (which may be a single chip microcomputer, a chip, etc.) or a processor executes FIG. 5 or FIG. 6 The steps in the method of processing a multicast data message.
  • the aforementioned readable storage medium may include various media that can store program codes, such as a USB flash drive, a removable hard disk, a read only memory, a random access memory, a magnetic disk, or an optical disk.
  • a computer program product comprising computer executed instructions stored in a computer readable storage medium; at least one processor of the device may be Reading the storage medium reads the computer execution instructions, and the at least one processor executing the computer to execute the instructions such that the apparatus performs the steps in the method of processing the multicast data message provided in FIG. 3 or FIG.
  • a computer program product comprising computer executed instructions stored in a computer readable storage medium; at least one processor of the device may be Reading the storage medium reads the computer execution instructions, and the at least one processor executing the computer execution instructions causes the device to perform the steps in the method of processing the multicast data message provided in FIG. 5 or FIG. 6.
  • the forwarding device as the intermediate node receives the first multicast datagram.
  • the forwarding device as the intermediate node may use the second identifier and the second forwarding table in the first forwarding entry to indicate P2MP forwarding of the packet according to the text and the first forwarding entry and the second forwarding entry.
  • the first multicast data packet is processed to obtain the second multicast data packet, and the BIER header of the first multicast data packet is not required to be read and analyzed during processing, so that the node can be upgraded without hardware upgrade. In the case of BIER message forwarding, the cost of hardware upgrade is saved.
  • the forwarding device serving as the intermediate node can also delete the multicast data packet when forwarding the multicast data packet.
  • the BIER header has data other than the BIER tag, so that the downstream node can process or forward the received multicast data packet, so that the BIER packet can be forwarded without hardware upgrade. Further saving the cost of hardware upgrades.

Landscapes

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

Abstract

本申请提供一种处理组播数据报文的方法及装置,涉及通信技术领域,用于降低在组播网络中部署BIER技术时的部署成本和难度。应用于基于P2MP的BIER的组播树中,该组播树的中间节点支持利用P2MP转发BIER报文,包括:接收第一组播数据报文,第一组播数据报文的BIER头包括第一标签;根据第一标签获取第一转发表项,第一转发表项包括第一标签、第一标识和第二标识,第一标识用于标识所述组播树,第二标识用于指示对报文进行P2MP转发;根据第一标识获取第二转发表项,第二转发表项包括第一标识和第二标签;根据第二标识、第二转发表项和第一组播数据报文,获得第二组播数据报文并发送,第二组播数据报文包括第二标签。

Description

一种处理组播数据报文的方法及装置
本申请要求于2018年3月2日提交中国专利局、申请号为CN 201810175653.1、发明名称为“一种处理组播数据报文的方法及装置”的中国专利申请的优先权,其全部内容通过引用结合在本申请中。
技术领域
本申请实施例涉及通信技术领域,尤其涉及一种处理组播数据报文的方法及装置。
背景技术
组播技术是指通过使用特定的组播地址,按照最大投递原则,可以将组播数据报文传输到组播组(Multicast Group)对应的主机集合。其基本方法是:源主机只发送一份组播数据报文,其目的地址为组播组地址。组播组中的所有接收者均可以收到一份组播数据报文。组播技术实现了互联网协议(Internet Protocol,IP)网络中点到多点(point-to-multipoint,P2MP)间的数据传输,能够有效的节约网络带宽和降低网络负载。
基于P2MP的BIER技术属于BIER技术的中的一种。应用基于P2MP的BIER技术的组播网络中,组播树包括以特定的边缘节点为根、其它边缘节点为叶子的P2MP树。该特定的边缘节点是靠近组播源且能够与该组播源通信的边缘节点。该其他边缘节点为组播网络中除该特定的边缘节点之外的边缘节点。每个作为叶子的边缘节点可被分配比特位置(bit position),该比特位置可用于唯一地标识组播树中作为叶子的边缘节点。该每个作为叶子的边缘节点将其比特位置通过建树协议(tree building protocol),如协议无关组播(Protocol Independent Multicast,PIM)协议、标签分发协议(label Distribution Protocol,LDP)多点扩展(multipoint extensions for LDP,mLDP)协议或针对流量工程扩展的资源预留协议(Resource Reservation Protocol-Traffic Engineering,RSVP-TE),发往该组播树的根节点。该组播树的每个节点可获知每个比特位置所对应的作为叶子的边缘节点。该根节点可在发送至作为叶子的边缘节点的组播数据报文中,封装一个比特串(bit string)。该比特串中的比特位置表示该组播数据报文要到达的目的边缘节点。组播树上的节点收到包含有比特串的组播数据报文后,根据组播数据报文包括的比特串进行转发,使得组播数据报文发送至该比特串所标识的作为叶子的边缘节点。
当在组播网络中部署上述BIER技术时,需要组播网络中的设备能够对BIER头中的比特串进行识别和处理。目前,网络中的设备需要通过升级才能支持BIER技术,这就会造成BIER技术的部署成本较高和部署难度较大。
发明内容
本申请的实施例提供一种处理组播数据报文的方法及装置,解决了现有技术中BIER技术在组播网络中存在的部署成本较高和部署难度较大的问题。
为达到上述目的,本申请的实施例采用如下技术方案:
第一方面,提供一种处理组播数据报文的方法,应用于基于P2MP的BIER的组播树中,所述组播树的中间节点支持利用P2MP转发BIER报文,所述方法包括:所述中间节点接收第一组播数据报文,所述第一组播数据报文的BIER头包括第一标签;所述中间节 点根据所述第一标签获取第一转发表项,所述第一转发表项包括所述第一标签、第一标识和第二标识,所述第一标识用于标识所述组播树,所述第二标识用于指示对报文进行P2MP转发;所述中间节点根据所述第一标识获取第二转发表项,所述第二转发表项包括所述第一标识和第二标签;所述中间节点根据所述第二标识、所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文并发送,所述第二组播数据报文包括所述第二标签。其中,中间节点支持利用P2MP转发BIER报文可以理解为:所述中间节点不支持对BIER头中除BIER标签外的数据进行处理,所述中间节点采用P2MP来转发BIER报文,这里比特串的处理包括比特串的读取、运算(AND操作)和后续的转发动作。转发动作是根据AND结果确定是否往下一跳进行转发操作。另外,所述中间节点还可以有组播叶子的角色,即所述中间节点可以向其下级节点发送组播数据报文,还可以向本地连接的设备发送组播IP报文。
上述技术方案中,当所述中间节点无法识别和处理BIER头中的比特串,但支持利用P2MP转发BIER报文时,所述中间节点在接收到BIER报文时,可以仅读取BIER标签,无需对BIER头中除BIER标签外的其他数据进行读取分析,并利用P2MP转发BIER报文,从而可以在不对节点进行硬件升级的情况下部署BIER技术,降低其部署成本和部署难度。
在第一方面的一种可能的实现方式中,所述第二转发表项还包括出接口,所述中间节点根据所述第二标识、所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文并发送包括:所述中间节点根据所述第二标识,用所述第二标签替换所述第一组播数据报文包括的所述第一标签,获得所述第二组播数据报文;所述中间节点通过所述出接口发送所述第二组播数据报文。可选的,所述出接口是所述中间节点根据其下游节点的标识来进行确定,而不一定是根据接收其下游节点的信息的接口来确定。上述可能的实现方式中,所述中间节点在对第一组播数据报文进行转发处理时,可以仅用所述第二标签替换所述第一组播数据报文包括的所述第一标签,来获得所述第二组播数据报文,并通过所述出接口发送,从而简化了BIER报文的处理方式,使得所述中间节点可以利用P2MP转发BIER报文,进而降低BIER技术的部署成本和难度。
在第一方面的一种可能的实现方式中,所述中间节点根据所述第一标签获取第一转发表项之前,所述方法还包括:所述中间节点根据第一配置信息、所述第一标签和所述第一标识,生成所述第一转发表,所述第一配置信息用于表示所述中间节点利用P2MP转发BIER报文,所述第二标识是根据所述第一配置信息获得的标识。可选的,所述中间节点可以根据所述第一配置信息生成所述第二标识,或者根据所述第一配置信息查找对应关系表来获得所述第二标识。上述可能的实现方式中,所述中间节点可以相应的配置获得所述第二标识,并生成所述第一转发表项,进而在转发BIER报文时可以利用P2MP转发BIER报文。
在第一方面的一种可能的实现方式中,所述第二转发表项还包括第三标识和出接口,所述第三标识用于指示删除BIER头中除BIER标签之外的数据,所述中间节点根据所述第二标识、所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文并发送包括:所述中间节点根据所述第二标识,用所述第二标签替换所述第一组播数据报文包括的所述第一标签,获得标签替换后的第一组播数据报文;所述中间节点根据所述第三标识,删除所述标签替换后的第一组播数据报文的BIER头中除所述第二标签之外的数据,获得所述第二组播数据报文;所述中间节点通过所述出接口发送所述第二组播数据报文。可选 的,所述出接口是所述中间节点根据其下游节点的标识来进行确定,而不一定是根据接收其下游节点的信息的接口来确定。上述可能的实现方式中,在所述中间节点的下游节点不支持删除BIER头中的BIER标签时,所述中间节点还可以删除BIER头中除BIER标签外的数据,并转发所述BIER报文,进一步可以降低BIER技术的部署成本和难度。
在第一方面的一种可能的实现方式中,所述中间节点根据所述第一标识获取第二转发表项之前,所述方法还包括:所述中间节点接收所述组播树的下游节点发送的所述第二标签和第二配置信息,所述第二配置信息用于表示所述下游节点不支持删除BIER头中除BIER标签之外的数据;所述中间节点根据所述第二标签和所述第二配置信息,生成所述第二转发表项,所述第三标识是根据所述第二配置信息获得的标识。所述组播树的下游节点可以是所述中间节点与特定的叶子节点组成的报文传输路径中所述中间节点的下一跳节点。上述可能的实现方式中,所述中间节点可以根据相应的配置获取所述第二标识,并生成所述第二转发表项,进而在转发BIER报文时可以删除BIER头中除BIER标签之外的数据。
第二方面,提供一种处理组播数据报文的方法,应用于基于P2MP的BIER的组播树中,所述组播树的中间节点支持删除BIER头中除BIER标签之外的数据,所述方法包括:所述中间节点接收第一组播数据报文,所述第一组播数据报文的BIER头包括第一标签;所述中间节点根据所述第一标签获取第一转发表项,所述第一转发表项包括所述第一标签和第一标识,所述第一标识用于标识所述组播树;所述中间节点根据所述第一标识获取第二转发表项,所述第二转发表项包括所述第一标识、第二标识和第二标签,所述第二标识用于指示删除BIER头中除BIER标签外的数据;所述中间节点根据所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文并发送,所述第二组播数据报文包括所述第二标签。
上述技术方案中,中间节点的下游节点不支持删除BIER头中除BIER标签外的数据时,该中间节点可以在转发组播数据报文时,删除组播数据报文的BIER头中除BIER标签外的数据,使其下游节点可以实现对接收到的组播数据报文的处理或转发,从而可以在不对节点进行硬件升级的情况下实现BIER报文的转发,进而降低BIER技术的部署成本和难度。
在第二方面的一种可能的实现方式中,所述第二转发表项还包括出接口,所述中间节点根据所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文并发送包括:所述中间节点根据所述第二标识,删除所述第一组播数据报文的BIER头中除所述第一标签之外的数据,获得删除数据后的第一组播数据报文;所述中间节点用所述第二标签替换所述删除数据后的第一组播数据报文包括的所述第一标签,获得所述第二组播数据报文;所述中间节点通过所述出接口发送所述第二组播数据报文。可选的,所述出接口是所述中间节点根据其下游节点的标识来进行确定,而不一定是根据接收其下游节点的信息的接口来确定。上述可能的实现方式中,所述中间节点在对第一组播数据报文进行转发处理时,可以仅用所述第二标签替换所述第一组播数据报文包括的所述第一标签,来获得所述第二组播数据报文,并通过所述出接口发送,从而简化了BIER报文的处理方式,使得所述中间节点可以利用转发仅携带BIER标签的报文,进而降低BIER技术的部署成本和难度。
在第二方面的一种可能的实现方式中,所述中间节点根据所述第一标识获取第二转发表项之前,所述方法还包括:所述中间节点接收所述组播树的下游节点发送的所述第二标签和配置信息,所述配置信息用于表示所述下游节点不支持删除BIER头中除BIER标签 之外的数据;所述中间节点根据所述第二标签和所述配置信息,生成所述第二转发表项,所述第二标识是根据所述配置信息获得的标识。所述组播树的下游节点可以是所述中间节点与特定的叶子节点组成的报文传输路径中所述中间节点的下一跳节点。上述可能的实现方式中,所述中间节点可以根据相应的配置获取所述第二标识,并生成所述第二转发表项,进而在转发BIER报文时可以删除BIER头中除BIER标签之外的数据。
第三方面,提供一种处理组播数据报文的方法,应用于基于P2MP的BIER的组播树中,所述组播树包括叶子节点,所述叶子节点不支持BIER头中比特串的处理,所述方法包括:接收第二组播数据报文,所述第二组播数据报文的BIER头中仅包括第二BIER标签;根据所述组播树标识获取第三转发表项,所述第三转发表项包括第四标识,所述第四标识用于指示删除所述BIER标签;根据所述第四标识,删除所述第二组播数据报文中的所述第二BIER标签,得到组播IP报文;向本地出接口发送所述组播IP报文。
在第三方面的一种可能的实现方式中,所述方法还包括:根据预先配置的删除标签指示信息和第一标识,生成所述第三转发表项,所述第四标识是根据所述配置信息获取的标识,所述删除标签指示信息用于指示该叶子节点向本地转发组播数据报文时删除BIER标签。
第四方面,提供了一种转发设备,所述转发设备为应用于基于P2MP的BIER的组播树中的中间节点,所述转发设备支持利用P2MP转发BIER报文,所述转发设备可以实现第一方面至第一方面的任一种可能的实现方式所提供的处理组播数据报文的方法的功能。所述功能可以通过硬件实现,也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个上述功能相应的单元。示例性的,所述转发设备可以包括接收单元、获取单元和发送单元。所述转发设备还可以包括生成单元。
在第四方面的一种可能的实现方式中,所述转发设备的结构中包括处理器、存储器、通信接口和总线,所述处理器、所述存储器和所述通信接口通过所述总线连接。所述存储器用于存储程序代码,当该程序代码被所述处理器执行时,使得所述转发设备执行第一方面至第一方面的任一种可能的实现方式所提供的处理组播数据报文的方法中的步骤。
第五方面,提供了一种转发设备,所述转发设备为应用于基于P2MP的BIER的组播树中的中间节点,所述中转发设备支持删除BIER头中除BIER标签之外的数据,所述转发设备可以实现第二方面至第二方面的任一种可能的实现方式所提供的处理组播数据报文的方法的功能。所述功能可以通过硬件实现,也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个上述功能相应的单元。示例性的,所述转发设备可以包括接收单元、获取单元和发送单元。所述转发设备还可以包括生成单元。
在第五方面的一种可能的实现方式中,所述转发设备的结构中包括处理器、存储器、通信接口和总线,所述处理器、所述存储器和所述通信接口通过所述总线连接。所述存储器用于存储程序代码,当该程序代码被所述处理器执行时,使得所述转发设备执行第二方面至第二方面的任一种可能的实现方式所提供的处理组播数据报文的方法中的步骤。
第六方面,提供了一种转发设备,所述转发设备为应用于基于P2MP的BIER的组播树中的叶子节点,所述转发设备不支持BIER头中比特串的处理,所述转发设备可以实现第三方面至第三方面的任一种可能的实现方式所提供的处理组播数据报文的方法的功 能。所述功能可以通过硬件实现,也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个上述功能相应的单元。示例性的,所述转发设备可以包括接收单元、处理单元和发送单元。
在第六方面的一种可能的实现方式中,所述转发设备的结构中包括处理器、存储器、通信接口和总线,所述处理器、所述存储器和所述通信接口通过所述总线连接。所述存储器用于存储程序代码,当该程序代码被所述处理器执行时,使得所述转发设备执行第三方面至第三方面的任一种可能的实现方式所提供的处理组播数据报文的方法中的步骤。
本申请的又一方面,提供了一种计算机可读存储介质,所述计算机可读存储介质中存储有指令,当其在计算机上运行时,使得该计算机执行上述第一方面或第一方面的任一种可能的实现方式所提供的处理组播数据报文的方法。
本申请的又一方面,提供了一种计算机可读存储介质,所述计算机可读存储介质中存储有指令,当其在计算机上运行时,使得该计算机执行上述第二方面或第二方面的任一种可能的实现方式所提供的处理组播数据报文的方法。
本申请的又一方面,提供了一种包含指令的计算机程序产品,当其在计算机上运行时,使得该计算机执行上述第一方面或第一方面的任一种可能的实现方式所提供的处理组播数据报文的方法。
本申请的又一方面,提供了一种包含指令的计算机程序产品,当其在计算机上运行时,使得该计算机执行上述第二方面或第二方面的任一种可能的实现方式所提供的处理组播数据报文的方法。
可以理解地,上述提供的任一种处理组播数据报文的方法的装置、计算机存储介质或者计算机程序产品均用于执行上文所提供的对应的方法,因此,其所能达到的有益效果可参考上文所提供的对应的方法中的有益效果,此处不再赘述。
附图说明
图1为本申请实施例提供的一种组播树的结构示意图;
图2为本申请实施例提供的一种BIER头的结构示意图;
图3为本申请实施例提供的第一种处理组播数据报文的方法的流程示意图;
图4为本申请实施例提供的第二种处理组播数据报文的方法的流程示意图;
图5为本申请实施例提供的第三种处理组播数据报文的方法的流程示意图;
图6为本申请实施例提供的第四种处理组播数据报文的方法的流程示意图;
图7为本申请实施例提供的第一种BIER报文的转发示意图;
图8为本申请实施例提供的第二种BIER报文的转发示意图;
图9为本申请实施例提供的第三种BIER报文的转发示意图;
图10为本申请实施例提供的第四种BIER报文的转发示意图;
图11为本申请实施例提供的第五种BIER报文的转发示意图;
图12为本申请实施例提供的第一种作为中间节点的转发设备的结构示意图;
图13为本申请实施例提供的第二种作为中间节点的转发设备的结构示意图;
图14为本申请实施例提供的第三种作为中间节点的转发设备的结构示意图;
图15为本申请实施例提供的第四种作为中间节点的转发设备的结构示意图。
具体实施方式
图1为本申请实施例提供的一种组播树的结构示意图。组播树可以包括根节点、中间节点和叶子节点。中间节点可以是指边缘节点之外的节点,比如图1中的节点B和节点C。边缘节点可以包括根节点和叶子节点。节点A为根节点。节点D、节点E和节点F为叶子节点。当作为叶子节点的节点E还作为中间节点时,节点E和节点C之间的传输路径可替换图1中节点B和节点C之间的传输路径,以生成另一组播树。作为叶子节点的节点E还作为中间节点的情况下,节点E被称为混合(bud)节点。图1中所示的组播树的结构仅为示例性的,并不对本申请构成限定。
组播数据报文的转发流程包括:组播树的根节点接收组播源发送的组播数据报文,所述根节点向所述组播树的叶子节点发送所述组播数据报文。根节点将组播数据报文转发给下游节点。其中,某个节点的下游节点是指组播树中沿根节点到叶子节点的方向上所述某个节点在传输路径上的下一跳节点。如果所述根节点的下游节点为中间节点,则中间节点通过其下游节点向所述组播树的叶子节点发送所述组播数据报文。叶子节点接收到所述组播数据报文后,将其通过本地端口发送至所述本地端口连接的主机。如果所述组播树中存在bud节点,则所述bud节点在向其下游节点发送所述组播数据报文之外,还会将复制后的组播数据报文通过本地端口进行发送。如图1所示的组播树,节点A向其下游的节点B发送来自组播源的组播数据报文。节点B对所述组播数据报文进行复制,并分别向其下游的节点E和节点C发送所述组播数据报文。节点C对所述组播数据报文进行复制,并分别向其下游的节点F和节点D发送所述组播数据报文。节点F和节点D可分别将所述组播数据报文通过各自的本地端口进行发送。当节点E为bud节点时,节点E可对所述组播数据报文进行复制,通过其本地端口和能够与下游的C节点通信的端口分别发送一份组播数据报文。
在图1所示的组播树中,以能够标识4个边缘节点的比特串为例,对比特串、比特位置以及边缘节点的关系进行说明。节点D对应的比特位置为1,节点E对应的比特位置为2,节点F对应的比特位置为3,节点A对应的比特位置为4。当节点D为接收组播数据报文的边缘节点时,与所述组播数据报文对应的比特串可表示为0001。当节点E为接收组播数据报文的边缘节点时,与所述组播数据报文对应的比特串可表示为0010。当节点F为接收组播数据报文的边缘节点时,与所述组播数据报文对应的比特串可表示为0100。当节点F和节点D为接收组播数据报文的数据节点时,与所述组播数据报文对应的比特串可表示为0101。在建立组播树中的过程中,节点D、E和F通过建树协议将各自的比特位置通告给各自的上游节点。某一节点的上游节点为所述组播树的根节点到叶子节点的方向上所述某一节点在传输路径上的上一跳节点。节点A接收到节点D、E和F的通告后,获取所述节点D、E和F的比特位置并保存。节点A收到来自组播源的组播数据报文后,根据组播源的信息和组播组的信息,确定所述组播数据报文需要发送给节点E和F。节点A根据节点E和节点F的比特位置获得bitstring为0110。节点A根据所述bitstring和所述组播数据报文,获得BIER报文。所述BIER报文包括BIER头和所述组播数据报文。所述BIER头包括的bitstring为0110。节点A向节点B发送所述BIER报文。
如图2所示,BIER头包括一个32bit的BIER标签(BIER-label)、64bit的其它字段和bitstring。所述BIER-label包括标签值和标签的其他信息。所述BIER-label可用来确定 bitstring的长度。其种,所述标签值可占用所述BIER-label的前20bit。所述标签的其他信息可占用所述BIER-label的后12bit。bitstring的长度可以是64bit、128bit或256bit。bitstring的长度也可设置为其他数值,在此不再对bitsring的长度进行逐一举例说明。所述其他字段可参见RFC8296中的相应内容。
采用基于P2MP的BIER技术转发组播数据报文之前,组播树包括的各节点通过控制平面建立转发表项。在建立转发表项之后,所述组播树包括的各节点在转发平面根据转发表项发送组播数据报文。下面分别通过不同的实施例来阐述建立转发表项的过程和转发组播数据报文的过程。
本申请实施例提供的一种建立转发表项的方法中,组播树中各节点的转发表项可以是由叶子节点向根节点的方向逐跳建立的。下面对各节点的转发表项和建立转发表项的过程进行详细说明。
(1)根节点、中间节点和叶子节点的转发表项的相关描述
a、根节点的转发表项
根节点支持P2MP的BIER报文转发,且根节点能够识别和处理BIER头中的比特串。根节点的转发表项包括以下两种:第一转发表项和第二转发表项。所述第一转发表项可以表示为转发等价类(forwarding equivalence class,FEC)到下一跳标签转发入口(next hop label forwarding entry,NHLFE)映射(FEC to NHLFE,FTN)。所述第二转发表项可表示为BIER_NHLFE。其中,所述FTN包括组播源(S)、组播组(G)、组播树的标识(treeid)和比特串,比如所述FTN表示为(S,G,treeid,bitstring)。所述FTN包括的treeid是建立组播树的过程中所述根节点根据来自其下游节点的P2MP ID获得的标识。所述FTN包括的treeid用于在所述根节点本地唯一地标识组播树。所述根节点可根据接收到的组播数据报文中的(S,G)查找所述FTN,获得treeid和bitstring。接收所述组播数据报文的叶子节点是由FTN中的bitstring的比特位置来确定的。本申请实施例以P2MP ID作为建树协议所采用的标识的一种具体实例,对组播树的各节点获得转发表项的方法进行说明。P2MP ID可根据所采用的建树协议而进行相应的替换,比如:建树协议为RSVP-TE,则建树协议所采用的标识为P2MP会话(session)。建树协议为mLDP,则建树协议所采用的标识为P2MP FEC。建树协议为PIM,则建树协议所采用的标识为建立组播树所使用的组播源组信息。组播源组信息可表示为(S,G)。本申请实施例以P2MP ID来自于下游节点为例进行说明。P2MP ID还可通过上游节点获取,在本申请实施例中对于从上游节点获取P2MP ID的方法不再进行赘述。
所述BIER_NHLFE包括treeid、出接口(outinterface)、出标签(outlabel)和转发比特掩码(forwarding bitmask,F-BM)。比如所述BIER_NHLFE表示为(treeid,outinterface,outlabel,F-BM)。所述根节点可根据所述FTN中的treeid,获得包括所述treeid的BIER_NHLFE。所述根节点可根据获得的BIER_NHLFE,获得outinterface、outlabel和F-BM。F-BM是所述根节点根据需接收(S,G)对应的组播数据报文的叶子节点通告的比特位置获取的参数。根节点在向bitstring对应的叶子节点发送BIER报文时,根节点可将BIER头包括的bitstring和BIER_NHLFE中的F-BM进行逻辑与(AND)操作。如果AND操作的结果为非0,则通过BIER_NHLFE中outinterface对应的出接口发送BIER报文。经outinterface对应的出接口发送的BIER报文中的BIER标签被封装为outlabel。如果AND操作的结果为0,则不往BIER_NHLFE中的outinterface对应的出接口发送BIER报文。
b、中间节点的转发表项
(i)中间节点支持BIER技术,中间节点的下游节点中至少存在一个节点不支持删除BIER头中除BIER标签之外的数据。为了和上述第一转发表项和上述第二转发表项的名称进行区分,中间节点的转发表项包括以下两种:第三转发表项和第四转发表项。第三转发表项可表示为BIER入标签映射(BIER incoming label map,BIER_ILM)。第四转发表项可表示为BIER_NHLFE。第四转发表项的包含的参数类型与根节点中的BIER_NHLFE包含的参数类型相同,在此不再赘述。第三转发表项和所述第四转发表项还可采用其他名称,在此不进行具体限定。
所述BIER_ILM包括入标签(inlabel)、treeid、比特串长度(bitstringlen)和第一标志位。所述第一标志位可表示为flag=checkbitstring。所述BIER_ILM可表示为(inlabel,treeid,bitstringlen,flag=checkbitstring)。inlabel为所述中间节点向根节点发送的所述中间节点的标签(label)。BIER_ILM中的treeid是建立组播树的过程中所述中间节点根据来自其下游节点的P2MP ID获得的标识。BIER_ILM中的treeid用于在所述中间节点本地唯一地标识组播树。所述中间节点将接收到的BIER报文中的BIER标签作为inlabel,获得所述BIER_ILM。所述中间节点可从所述BIER_ILM获得treeid,bitstringlen和flag=checkbitstring。bitstringlen用于标识BIER头中的bitstring的长度。携带BIER头的报文中bitstring长度和所述第四转发表项中F-BM的长度均为bitstringlen。flag=checkbitstring表示对BIER头中的bitstring进行识别和处理,比如将识别获得的BIER头中的bitstring与所述第四转发表项中的F-BM进行AND操作来确定是否继续向下游节点发送携带BIER头的报文。bitstringlen是控制面生成表项的过程中来自下游节点的通告。本申请实施例以bitstringlen通过下游节点向上游节点发送的方式为例,对组播树的节点生成转发表项的方法进行说明。当建树协议为RSVP-TE时,bitstringlen可来自于上游节点发送给下游节点的路径(path)消息,也可来自于下游节点发送给上游节点的预留消息(RESV message)。本申请实施例对于获取bitstringlen的方式不进行限定。
所述BIER_NHLFE包括treeid、outinterface、outlabel,F-BM和第二标志位。所述第二标志位可表示为flag=popBIERexcluding。flag=popBIERexcluding表示弹出BIER头中除BIER标签之外的数据。所述BIER_NHLFE可表示为(treeid,outinterface,outlabel,F-BM,flag=popBIERexcluding)。其中,outinterface,outlabel和F-BM的含义可参见所述第二转发表项中的相应内容。treeid的含义可参见所述第三转发表项中的treeid含义。所述中间节点可通过下游节点发送的配置信息,获知至少一个下游节点不支持删除BIER头中除BIER标签之外的数据。所述至少一个下游节点可支持读取BIER标签。所述配置信息用于标识所述下游节点不支持删除BIER头中除BIER标签之外的数据。所述中间节点可根据所述配置信息,在生成与所述至少一个下游节点对应的BIER_NHLFE时,增加flag=popBIERexcluding。相应地,所述中间节点可根据所述BIER_ILM获得treeid。所述中间节点可根据所述所述BIER_ILM包括的treeid获得了包括flag=popBIERexcluding的BIER_NHLFE。当所述BIER_NHLFE中的bitstring与F-BM的AND操作为非0时,所述中间节点删除所述BIER头中除BIER标签之外的数据,并将所述BIER头中的BIER标签替换为outlabel。所述中间节点后续可参照所述根节点的方式发送所述标签替换后的携带P2MP标签但是不携带BIER头的其他参数的报文。所述中间节点还可采用通常的方法,针对支持BIER技术的下游节点配置其对应的BIER_NHLFE,在此不再赘述。
(ii)中间节点支持BIER技术,且有叶子节点的角色。中间节点的下游节点中至少存在一个节点不支持删除BIER头中除BIER标签之外的数据。其中,所述中间节点的转发表项除了包括(i)中的第三转发表项和第四转发表项这两种之外,还包括第五转发表项和第六转发表项。所述第五转发表项可表示为BIER_NHLFE_Leaf。所述第六转发表项可表示为组播转发信息库(multicast forwarding information Base,MFIB)。所述BIER_NHLFE_Leaf包括:treeid和第三标志位。所述第三标志位可表示为flag=popBIERincluding。flag=popBIERincluding表示删除BIER报文中的BIER头。所述删除BIER报文中的BIER头为删除BIER报文中以BIER标签开始的12字节外加bitstringlen长度的数据。所述BIER_NHLFE_Leaf表示为(treeid,flag=popBIERincluding)。所述中间节点用删除BIER头的组播数据报文查找本地的MFIB,并根据匹配的MFIB向本地出接口发送。所述MFIB可表示为(S,G,localmcastId)。localmcastId用于定位MFIB_LocalLeaf这一表项。所述具有叶子角色的中间节点还利用localmcastId查找MFIB_LocalLeaf获得所述具有叶子角色的中间节点的本地接口。MFIB_LocalLeaf可表示为(localmcastId,outinterface)。
(iii)中间节点支持利用P2MP转发,所述中间节点不支持对BIER头中的bitstring进行识别和处理。其中,对BIER头中的bitstring进行识别和处理包括对BIER头中的bitstring进行读取并利用bitstring确定是否向下游节点转发携带BIER头的报文。中间节点的转发表项包括以下两种:第七转发表项和第八转发表项。所述第七转发表项可表示为P2MP_ILM。所述第八转发表项可表示为P2MP_NHLFE。
其中,所述P2MP_ILM包括inlabel,treeid和第四标志位。inlabel和treeid可参见(i)和(ii)中的相应内容。所述第四标志位可表示为flag=P2MP。flag=P2MP用于表示采用P2MP进行转发。所述P2MP_ILM可表示为(inlabel,treeid,flag=P2MP)。所述第四标志位可以是所述中间节点生成转发表项的过程中根据其自身的性能设置的。所述中间节点的性能包括:支持P2MP转发和不支持对BIER头中的bitstring进行识别处理。所述P2MP_NHLFE包括treeid,outinterface和outlabel。所述treeid,outinterface和outlabel的含义可参见(i)和(ii)中的相应内容。所述P2MP_NHLFE可表示为(treeid,outinterface,outlabel)。所述采用P2MP进行转发表示根据待转发报文中携带的标签和相应的转发表项实现转发。所述相应的转发表项可以是根据P2MP_ILM中的treeid确定的P2MP_NHLFE。
(iiii)中间节点支持利用P2MP转发,所述中间节点不支持对BIER头中的bitstring进行识别和处理,中间节点的下游节点中至少存在一个节点不支持删除BIER头中除BIER标签之外的数据。所述中间节点的转发表项包括以下几种:(iii)中的第七转发表项和第九转发表项。所述第九转发表项可以是在(iii)中的第八转发表项中增加上述的第二标志位,即所述第九转发表项可表示为(treeid,outinterface,outlabel,flag=popBIERexcluding)。所述第九转发表项中与所述第八转发表项中相同的内容可参见(iii)。所述第二标志位可参见(i)中的相应内容。
当(iiii)对应的中间节点还具有叶子节点的角色时,中间节点的转发表项除了包括所述第七转发表项和所述第九转发表项这两种之外,还可包括(ii)中的第五转发表项和第六转发表项这两种。
上述的任一标志位为所述中间节点根据其下游节点发送的通告中携带的相应配置信息进行设置的。任一标志位的表示方式并不局限于上述的表示方式。
c、叶子节点的转发表项
(i)叶子节点支持删除BIER头,叶子节点的转发表项可以包括以下几种:表示成(inlabel,treeid,bitstringlen,lag=checkbitstring)的BIER_ILM和表示成(treeid,flag=popBIERincluding)的BIER_NHLFE_Leaf。或者叶子节点的转发表项可以为表示成(inlabel,treeid,bitstringlen,flag=popBIERincluding)的BIER_ILM。其中,inlabel为叶子节点的标签。bitstringlen和flag=checkbitstring的内容可参见中间节点中的相应内容。flag=popBIERincluding表示删除BIER报文中的BIER头,具体的内容可参见中间节点中的相应内容。
(ii)叶子节点不支持删除BIER头中除BIER标签之外的数据,叶子节点的转发表项可以包括表示成(inlabel,treeid)的P2MP_ILM和表示成(treeid,flag=poplabel)P2MP_NHLFE_Leaf。或者叶子节点的转发表项可以为表示成(inlabel,treeid,flag=poplabel)的P2MP_ILM。其中,flag=poplabel表示删除报文中的标签,所述标签可以是BIER标签或P2MP标签。
(iii)叶子节点具有中间节点的角色,则具有中间节点角色的叶子节点的转发表项可参见b中的具有叶子角色的中间节点的转发表项。
需要说明的是,叶子节点的转发表项中的treeid可以是建立组播树的过程中所述叶子节点根据P2MP ID获得的标识。treeid用于在所述叶子节点本地唯一地标识组播树。
(2)、根节点、中间节点和叶子节点建立转发表项的相关描述
组播树的叶子节点获知所述组播树对应的P2MP标识(identifier,ID)。所述P2MP ID包括:根节点的IP地址和所述叶子节点所在的组播树的标识。所述叶子节点所在的组播树的标识可以是通过序号表示的标识。所述组播树的叶子节点获知沿上游方向的下一跳节点。如图1所示,节点A为节点B沿上游方向的下一跳节点,节点B为节点E沿上游方向的下一跳节点,节点C为节点D沿上游方向的下一跳节点,节点B为节点C沿上游方向的下一跳节点。所述组播树的叶子节点可获知其对应的比特位置。节点D可通过发送内容为0001的比特掩码(bitmask)通告其比特位置是1。同理,节点E可通过发送内容为0010的bitmask通告其比特位置是2。节点F可通过发送内容为0100的bitmask通告其比特位置是3。组播树的叶子节点可将用于标识其自身的label发送至其上游节点。组播树的叶子节点还可将用于表示其是否支持删除BIER头中除BIER标签之外的数据的配置信息发送给其上游节点。这样,组播树的叶子节点可将bitmask、P2MP ID和其自身的label发送给其上游方向的下一跳节点。中间节点可根据叶子节点发送的上述信息获得(1)中相应的转发表项。所述叶子节点可根据配置信息和其自身的label获得(1)中相应的转发表项。如图1所示,假设节点D的标签可以为label<byD>,节点D向节点C发送(P2MP ID,label<byD>,bitmask=0001,配置信息)。节点F的标签可以为label<byF>,节点F向节点C发送(P2MP ID,label<byF>,bitmask=0100,配置信息)。节点E的标签可以为label<byE>,节点E向节点B发送(P2MP ID,label<byE>,bitmask=0010,配置信息)。所述中间节点可将label<by node>作为outlabel。所述中间节点根据P2MP ID中的组播树的标识获得treeid。所述中间节点可根据其自身能力将bitmask作为F-BM。所述中间节点可根据接收到的配置信息设置flag。
中间节点根据下游节点发送的bitmask获得相应的比特串,具体可以是将来自下游节点的bitmask进行或(OR)操作来获得对应的比特串。所述中间节点可将所支持的能力、 其自身的label和获得的bitstring发送至P2MP ID包括的根节点的IP地址。具体发送所支持的能力、其自身的label和获得的bitstring的方法可包括:所述中间节点根据所述根节点的IP,获得上游方向的下一跳节点;所述中间节点向所述上游方向的下一跳节点发送其自身的label和获得的bitstring。所述中间节点所支持的能力可以通过配置信息的方式进行发送。所述中间节点所支持的能力可参见(1)中的相应描述。中间节点可根据自身的能力、获得的treeid和自身的标签获得上述(1)中与inlabel相关的转发表项。所述中间节点自身的标签为所述中间节点的转发表项中的inlabel。
比如,如图1所示,节点C的标签可以为label<byC>,节点C将来自节点D和F的两个bitmask进行“或”操作,获得“或”操作后的bitmask=0101。节点C根据根节点的IP,获得朝向根节点方向的下一跳为节点B。节点C向节点B发送信息(P2MP ID,label<byC>,bitmask=0101,配置信息)。节点C发送的配置信息用于表示节点C和其连接的叶子节点的能力。节点C可以根据节点D和F发送的信息和label<byC>建立相应的转发表项。节点B的标签可以为label<byB>。节点B将来自节点E和C的两个bitmask进行“或”操作,获得“或”操作后的bitmask=0111。节点B根据根节点的IP,向节点A发送信息(P2MP ID,label<byB>,bitmask=0111)。节点B可以根据节点E和C发送的信息和label<byB>建立相应的转发表项。
根节点建立转发表项的相关描述:根节点接收到下游节点发送的信息后,可以根据下游节点发送的信息可以建立如上述(1)中所描述的根节点的转发表项。比如,如图1所示,节点A根据来自节点B的信息、节点A自身的能力和节点A的label获得相应的转发表项。
下述图3、图4、图5或图6对应的实施例中组播树的根节点的转发表项、中间节点的转发表项以及叶子节点的转发表项的具体说明可参见上述(1)中的相应内容。下述图3、图4、图5或图6对应的实施例中组播树的任一节点生成转发表项的具体方式可参见上述(2)中的相应内容。
图3为本申请实施例提供的一种处理组播数据报文的方法的流程示意图。该方法应用于基于P2MP的BIER的组播树中。该组播树的中间节点支持利用P2MP转发接收到的报文。下面结合图3对本申请实施例提供的方法进行说明。
步骤301:中间节点接收第一组播数据报文,第一组播数据报文的BIER头包括第一标签。
如果中间节点不支持对BIER头中除BIER标签以外的数据进行处理,比如对BIER头中除BIER标签之外的参数进行识别处理,则中间节点采用P2MP转发接收到的报文。所述接收到的报文可以是携带有BIER头的组播数据报文或不带有BIER头中除BIER标签之外参数的组播数据报文。所述BIER头中除BIER标签之外的参数可以是bitstring。所述识别处理可以包括bitstring的读取、运算(AND操作)和后续的转发动作。所述转发动作可以是指根据AND结果确定是否往下一跳进行转发操作。
其中,第一组播数据报文的BIER头中的第一标签是该中间节点的标签。第一组播数据报文可以是由该中间节点的上游节点发送给该中间节点的。该上游节点可能是根节点,也可能是除该中间节点之外的其他中间节点。所述根节点支持对BIER头中的bitstring进行识别和处理。当根节点需要向组播树中的叶子节点发送组播数据报文时,所述根节点可以根据组播数据报文中的(S,G)和FTN,获得作为所述第一标识的treeid和bitstring。 所述根节点根据获得的treeid查找到BIER_NHLFE(treeid,outinterface,outlabel,F-BM)。所述根节点将bitstring与F-BM进行AND操作。当该逻辑AND操作的结果为非0时,则根据bitstring和作为所述第一标签的outlabel获得第一组播数据报文中。所述根节点向outinterface所标识的出接口发送所述第一组播数据报文,以将第一组播数据报文发送给中间节点。
当该中间节点的上游节点也为中间节点时,作为上游节点的中间节点可以与所述根节点具有相同的能力,即可参照所述根节点采用的方法转发BIER报文。作为上游节点的中间节点不支持对BIER头中除BIER标签以外的数据进行处理,则作为上游节点的中间节点可以按照本申请实施例所提供的下述方法处理接收到的第一组播数据报文。
步骤302:所述中间节点根据第一标签获取第一转发表项,第一转发表项包括所述第一标签、第一标识和第二标识,第一标识用于标识组播树,第二标识用于指示对报文进行P2MP转发。
中间节点可以根据第一标签获取第一转发表项。第一转发表项中的第一标识用于标识该组播树,第二标识用于指示对报文进行P2MP转发。比如,第一标识可以为上述实施例提及的中间节点的转发表项包括的treeid。第二标识可以为上述实施例提及的中间节点的转发表项包括的flag=P2MP。相应的,第一转发表项可以包括上述实施例提及的中间节点上表示成(inlabel,treeid,flag=P2MP)的P2MP_ILM。
步骤303:中间节点根据第一标识获取第二转发表项,第二转发表项包括第一标识和第二标签。
中间节点可以根据第一标识获取第二转发表项。第二转发表项包括的第二标签是中间节点的下游节点发送的其自身的标签。比如,第二转发表项可以包括表示成(treeid,outlabel)的P2MP_NHLFE。中间节点可以根据表示成(inlabel,treeid,flag=P2MP)的P2MP_ILM中的treeid获取第二转发表项。第二转发表项中的outlabel可以称为第二标签。可选地,所述第二表项中还可包括上述b中所提及的中间节点上的P2MP_NHLFE所包括的outinterface。
步骤304:中间节点根据第二标识、第二转发表项和第一组播数据报文,获得第二组播数据报文并发送,第二组播数据报文包括第二标签。
当中间节点获取到第二标识、第二转发表项和第一组播数据报文时,所述中间节点根据第二标识确定进行P2MP转发。所述中间节点在确定进行P2MP转发后,可无需对接收到的BIER头除BIER标签之外的参数进行识别处理。中间节点根据第二转发表项中的第二标签对第一组播数据报文进行处理,以获得第二组播数据报文。第二组播数据报文的BIER头中的BIER标签为第二标签。中间节点可以将第二组播数据报文发送给其下游节点。
当中间节点的下游节点支持删除BIER头中除BIER标签之外的数据或者不支持删除BIER头中除BIER标签之外的数据时,中间节点通过步骤304获取并发送第二数据组播报文的方法会有所不同,下面分别进行阐述。
在一种方式中,中间节点的下游节点支持删除BIER头中除BIER标签之外的数据,则第二转发表项还可以包括出接口。可选的,该出接口可以根据其下游节点的标识来确定,该出接口与该中间节点接收其下游节点发送的信息的接口可以相同,也可以不同。相应的,步骤304具体可以包括:中间节点根据第二标识,用第二转发表项中的第二标签替换第一组播数据报文中的第一标签,以获得第二组播数据报文;中间节点通过第二转发表项中的 出接口将第二组播数据报文发送给其下游节点。比如,第二标识为flag=P2MP,第二转发表项包括表示成(treeid,outinterface,outlabel)的P2MP_NHLFE,则中间节点可以将第一组播数据报文的BIER头中的BIER标签替换为outlabel,得到第二组播数据报文,并通过outinterface向其下游节点发送第二组播数据报文。这种情况下,第一组播数据报文和第二组播数据报文可以均为携带BIER头的报文。
在另一种方式中,当中间节点的下游节点不支持删除BIER头中除BIER标签之外的数据时,则第二转发表项还包括第三标识和出接口,第三标识用于指示删除BIER头中除BIER标签之外的数据。可选的,该出接口也可以根据其下游节点的标识来确定,该出接口与该中间节点接收其下游节点发送的信息的接口可以相同,也可以不同。相应的,步骤304具体可以包括:中间节点根据第二标识,用第二标签替换第一组播数据报文包括的第一标签,获得标签替换后的第一组播数据报文;中间节点根据第三标识,删除标签替换后的第一组播数据报文的BIER头中除第二标签之外的数据,获得第二组播数据报文,即第二组播数据报文仅包括第二报文和组播IP报文;中间节点通过出接口发送第二组播数据报文。比如,第二标识为flag=P2MP,第三标识为flag=popBIERexcluding,第二转发表项包括表示成(treeid,outinterface,outlabel,flag=popBIERexcluding)的P2MP_NHLFE,则中间节点可以将第一组播数据报文的BIER头中的BIER标签替换为outlabel(第二标签),得到标签替换后的第一组播数据报文,并根据flag=popBIERexcluding删除BIER头中除第二标签之外的数据,得到第二组播数据报文,即第二组播数据报文包括第二报文和组播IP报文。中间节点通过outinterface向其下游节点发送第二组播数据报文。这种情况下,第一组播数据报文可以为携带BIER头的报文,第二组播数据报文可以为携带P2MP标签但是不携带BIER头的其他参数的报文。
当该中间节点的下游节点为叶子节点时,该叶子节点可以接收到第二组播数据报文。该叶子节点可以根据第一标识获取第三转发表项,第三转发表项包括第一标识和第四标识,第四标识用于指示删除第二标签,从而该叶子节点可以根据第三标识删除第二组播数据报文中的第二标签,获得组播IP报文。叶子节点读取组播IP报文中的IP头部的源IP和目的IP(即组播组IP),匹配本地的组播转发表项,根据本地组播转发表项确定本地出接口,并向本地出接口发送组播IP报文。比如,第三转发表项可以包括P2MP_NHLFE_Leaf(treeid,flag=poplabel),treeid可以是第一标识,flag=poplabel可以为第四标识。组播转发表项可以包括MFIB(S,G,localmcastId),(S,G)称为组播源组信息,localmcastId可以用于指示本地出接口。flag=poplabel用于表示弹出标签,所述标签可以是BIER标签或P2MP标签。
相应的,在该叶子节点根据第一标识获取第三转发表项之前,该叶子节点还可以生成第三转发表项。具体的,该叶子节点可以根据指示信息和第一标识,生成第三转发表项,所述指示信息用于指示该叶子节点向本地转发报文时删除BIER标签,第四标识是根据所述指示信息获取的标识。
当该中间节点还同时作为叶子节点时,该中间节点也可以按照上述叶子节点处理第二组播数据报文的方法,向该中间节点的本地出接口发送组播IP报文,具体参见上述叶子节点中的描述,本申请实施例对此不再赘述。
进一步的,中间节点在处理第一组播数据报文之前,中间节点还可以生成第一组播数据报文转发时所需的第一转发表项和第二转发表项。具体的,参见图4,在中间节点根据 第一标签获取第一转发表项(即步骤302)之前,该方法还可以包括步骤300a。
步骤300a:中间节点根据第一配置信息、第一标签和第一标识,生成第一转发表,第一配置信息用于表示该中间节点利用P2MP转发BIER报文,第二标识是根据第一配置信息获得的标识。其中,第二标识是根据第一配置信息获得的标识。所述第二标识的获取方式可以包括:根据第一配置信息生成第二标识,或者根据第一配置信息查找对应关系表来获得第二标识。当该中间节点利用P2MP转发BIER报文时,可以为该中间节点配置第一配置信息,以使该中间节点根据第一配置信息获取第二标识,并根据第一标签、第一标识和第二标识,生成第一转发表项。比如,该中间节点可以根据第一配置信息获得的标识为flag=P2MP,并根据第一标签label<by node1>(node1表示该中间节点)和作为第一标识的treeid,生成第一转发表项。所述第一转发表项可为表示成(inlabel,treeid,flag=P2MP)的P2MP_ILM。inlabel为该中间节点的标签。
相应的,参见图4,在中间节点根据第一标识获取第二转发表项(即步骤303)之前,该方法还可以包括步骤300b-步骤300c。图4中以步骤300a和步骤300b-步骤400c位于步骤301之前为例进行说明。
步骤300b:中间节点接收组播树的下游节点发送的第二标签和第二配置信息,第二配置信息用于表示该下游节点不支持删除BIER头中除BIER标签之外的数据。
当该中间节点的下游节点不支持删除BIER头中除BIER标签之外的数据时,该下游节点可以向该中间节点发送第二配置信息,以及将第二标签发送给该中间节点。
步骤300c:中间节点根据第一标识、第二标签和第二配置信息,生成第二转发表项,第三标识是根据第二配置信息获得的标识。
其中,第三标识是根据第二配置信息获得的标识。所述第三标识的获取方法可以包括:根据第二配置信息生成第三标识,或者根据第二配置信息查找对应关系表来获得第三标识。当该中间节点接收到第二配置信息时,该中间节点可以根据第二配置信息获取第三标识,并根据第一标识、第二标签和第三标识,生成第二转发表项。比如,该中间节点可以根据第二配置信息获得的标识为flag=popBIERexcluding,并根据用作第一标识的treeid、用作第二标签的label<by node2>(node2表示该中间节点的下游节点)、作为第三标识的flag=popBIERexcluding,生成第二转发表项。第二转发表项可表示为P2MP_NHLFE(treeid,outinterface,outlabel,flag=popBIERexcluding)。outlabel为label<by node2>,即该中间节点的下游节点的标签。
在本申请实施例中,若中间节点无法识别和处理BIER头的比特串,但支持利用P2MP转发BIER报文,则当该中间节点接收到第一组播数据报文,并获取第一转发表项和第二转发表项时,该中间节点可以根据第一转发表项中用于指示对报文进行P2MP转发的第二标识和第二转发表项,处理第一组播数据报文,以获得第二组播数据报文,且在处理时无需对第一组播数据报文的BIER头进行读取分析,从而可以在不对节点进行硬件升级的情况下实现BIER报文的转发,节省了硬件升级的成本。此外,在中间节点的下游节点不支持删除BIER头中除BIER标签外的数据时,该中间节点还可以在转发组播数据报文时,删除组播数据报文的BIER头中除BIER标签外的数据,使其下游节点可以实现对接收到的组播数据报文的处理或转发,从而也可以在不对节点进行硬件升级的情况下实现BIER报文的转发,进一步了节省了硬件升级的成本。
图5为本申请实施例提供的一种处理处理组播数据报文的方法的流程示意图,应用于 基于P2MP的BIER的组播树中,该组播树的中间节点支持删除BIER头中除BIER标签之外的数据,参见图5,该方法包括以下几个步骤。
步骤501:中间节点接收第一组播数据报文,第一组播数据报文的BIER头包括第一标签。
具体可参见图4或图3对应的实施例中301的相应内容。
步骤502:中间节点根据第一标签获取第一转发表项,第一转发表项包括第一标签和第一标识,第一标识用于标识组播树。
中间节点可以根据第一标签获取第一转发表项。第一转发表项中的第一标识用于标识该组播树,比如,第一标识可以为上述实施例所提供的转发表项中的treeid,第一标签是该中间节点的标签,第一转发表项可以包括表示成(inlabel,treeid)的P2MP_ILM。inlabel可以是该中间节点的标签。
步骤503:中间节点根据第一标识获取第二转发表项,第二转发表项包括第一标识、第二标识和第二标签,第二标识用于指示删除BIER头中除BIER标签外的数据。
中间节点可以根据第一标识获取第二转发表项。第二转发表项包括的第二标签是由中间节点的下游节点分配并发给中间节点的标签。比如,第二转发表项可以包括表示成(treeid,outlabel,flag=popBIERexcluding)的P2MP_NHLFE,中间节点可以根据第一标识treeid获取第二转发表项,第二转发表项中的outlabel可以为第二标签,flag=popBIERexcluding可以为第二标识。
步骤504:中间节点根据第二转发表项和第一组播数据报文,获得第二组播数据报文并发送,第二组播数据报文包括第二标签。
当中间节点接收到第一组播数据报文,并获取到第二转发表项时,中间节点可以根据第二转发表项对第一组播数据报文进行处理,以获得包括第二标签的第二组播数据报文。中间节点可以将第二组播数据报文发送给其下游节点。
第二转发表项还可以包括出接口,该出接口可以根据其下游节点的标识来确定,该出接口与该中间节点接收其下游节点发送的信息的接口可以相同,也可以不同。具体的,中间节点可以根据第二转发表项中的第二标识,删除第一组播数据报文的BIER头中除第一标签之外的数据,获得删除数据后的第一组播数据报文。所述中间节点用第二标签替换删除数据后的第一组播数据报文包括的第一标签,获得第二组播数据报文。所述中间节点通过第二转发表项中的出接口向其下游节点发送第二组播数据报文。在这种情况下,第一组播数据报文可以为携带BIER头的报文,第二组播数据报文可以为携带P2MP标签但是不携带BIER头的其他参数的报文。
当该中间节点的下游节点为叶子节点时,该叶子节点可以接收到第二组播数据报文。该叶子节点可以根据第一标识获取第三转发表项,第三转发表项包括第一标识和第四标识,第四标识用于指示删除第二标签,从而该叶子节点可以根据第三标识删除第二组播数据报文中的第二标签,获得组播IP报文。叶子节点读取组播IP报文中的IP头部的源IP和目的IP(即组播组IP),匹配本地的组播转发表项,根据本地组播转发表项确定本地出接口,并向本地出接口发送组播IP报文。比如,第三转发表项可以包括表示成(treeid,flag=poplabel)的P2MP_NHLFE_Leaf,其中,P2MP_NHLFE_Leaf包括的treeid可以是第一标识,flag=poplabel可以为第四标识。组播转发表项可以包括MFIB(S,G,localmcastId),localmcastId可以用于指示本地出接口。flag=poplabel的含义可参见图3或图4对应的实施 例中的相应内容。所述叶子节点获得第三转发表项以及第四标识的方法可参见图3对应的实施例中的相应内容。
进一步的,参见图6,在中间节点根据第一标识获取第二转发表项(即步骤503)之前,该方法还包括:步骤500a-步骤500b。图6中以步骤500位于步骤501之前为例进行说明。
步骤500a:中间节点接收组播树的下游节点发送的第二标签和配置信息,该配置信息用于表示该下游节点不支持删除BIER头中除BIER标签之外的数据。
当该中间节点的下游节点不支持删除BIER头中除BIER标签之外的数据时,该下游节点可以向该中间节点发送配置信息,以及将其分配的第二标签发送给该中间节点。
步骤500b:中间节点根据第二标签和该配置信息,生成第一转发表项,第二标识是根据该配置信息获得的标识。
其中,第二标识是根据该配置信息获得的标识。获取第二标识的方法可参见图4或图3对应的实施例。当该中间节点接收到该配置信息时,该中间节点可以根据该配置信息获取第二标识,并根据第一标识、第二标签和第二标识,生成第二转发表项。比如,该中间节点可以根据该配置信息获得的标识为flag=popBIERexcluding,并根据作为第一标识的treeid、作为第二标签的label<by node2>(node2表示该中间节点的下游节点)、作为第二标识的flag=popBIERexcluding,生成第二转发表项。所述第二转发表项可为表示成(treeid,outinterface,outlabel,flag=popBIERexcluding)的P2MP_NHLFE。其中,outlabel为label<by node2>,即该中间节点的下游节点的标签。
在一种方式中,在中间节点根据第一标签获取第一转发表项之前,中间节点还可以根据第一标识和第一标识,生成第一转发表项。比如,中间节点根据作为第一标签的label<by node1>(node1表示该中间节点)和作为第一标识的treeid,生成第一转发表项。所述第一转发表项是标识成(inlabel,treeid)的P2MP_ILM。其中,inlabel为label<by node1>,即该中间节点的标签。
本申请实施例提供的组播树中可能同时包括支持BIER技术的节点和不支持BIER技术的节点,具体可根据节点的转发表项中的flag所对应的操作进行处理,在此不再赘述。所述不支持BIER技术的节点指的是不支持删除BIER头中除BIER标签之外的数据的节点。
为便于理解,这里以图7~图11所示的五种场景为例进行举例说明。
图7中节点F不支持删除BIER头中除BIER标签之外的数据,其余节点支持删除BIER头中除BIER标签之外的数据,则节点C可根据来自F的信息生成相应的转发表项。节点C可根据其转发表项采用相应的方式处理接收到的BIER报文。比如节点C向节点F转发组播数据报文时,可以删除组播数据报文的BIER头中除BIER标签之外的数据。节点F接收的组播数据报文的BIER头中仅包含BIER标签。此外,节点C可根据其自身的转发表项中是否包括flag=P2MP来确定是否进行P2MP转发。
图8中节点C和节点F不支持删除BIER头中除BIER标签之外的数据,其余节点支持删除BIER头中除BIER标签之外的数据,则节点B可采用图7中节点C的方法处理接收到的BIER报文。节点C接收到组播数据报文的BIER头中仅包括BIER标签。节点C转发给节点F和节点D的组播数据报文的BIER头中也仅包括BIER标签。由于节点D支持BIER技术,节点C发送的组播数据报文的BIER头中仅包括BIER标签,还可以配置节点D不删除BIER头中除BIER标签之外的数据。此外,节点B和节点C可根据其自身 的转发表项中是否包括flag=P2MP来确定是否进行P2MP转发。
图9中节点B和节点F不支持删除BIER头中除BIER标签之外的数据,其余节点支持删除BIER头中除BIER标签之外的数据,则节点A可采用图7中节点C的方法处理接收到的BIER报文。节点C、E和D可参照图8中节点D的方式来处理接收到的组播数据报文。此外,节点B和节点C可根据其自身的转发表项中是否包括flag=P2MP来确定是否进行P2MP转发。
图10中节点C、节点F和节点D不支持删除BIER头中除BIER标签之外的数据,其余节点支持删除BIER头中除BIER标签之外的数据,则节点B可采用图7中节点C的方法处理接收到的BIER报文。节点C转发给节点F和节点D的组播数据报文的BIER头中也仅包括BIER标签。节点E可采用图8中节点D的方法来处理接收到的组播数据报文。节点B和节点C可根据其自身的转发表项中是否包括flag=P2MP来确定是否进行P2MP转发。
图11中节点B~节点F均不支持删除BIER头中除BIER标签之外的数据,节点A支持删除BIER头中除BIER标签之外的数据,则节点A采用图7中节点C的方法处理接收到的BIER报文。按照P2MP方式转发和处理BIER报文。
上述图7到图11的组播树中的节点B和节点C之间的路径被节点E和节点C之间的路径替换后,节点E成为bud节点。节点E的处理方式可参见上述中间节点和叶子节点的处理方式,在此不再赘述。
在本申请实施例中,当中间节点的下游节点不支持删除BIER头中除BIER标签外的数据时,该中间节点还可以在转发组播数据报文时,删除组播数据报文的BIER头中除BIER标签外的数据,使其下游节点可以实现对接收到的组播数据报文的处理或转发,从而也可以在不对节点进行硬件升级的情况下实现BIER报文的转发,节省了硬件升级的成本。
上述主要从网元之间交互的角度对本申请实施例提供的方案进行了介绍。可以理解的是,各个网元,例如中间节点和叶子节点。为了实现上述功能,其包含了执行各个功能相应的硬件结构和/或软件模块。本领域技术人员应该很容易意识到,结合本文中所公开的实施例描述的各示例的单元及算法步骤,本申请能够以硬件或硬件和计算机软件的结合形式来实现。某个功能究竟以硬件还是计算机软件驱动硬件的方式来执行,取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能,但是这种实现不应认为超出本申请的范围。
本申请实施例可以根据上述方法示例对中间节点进行功能模块的划分,例如,可以对应各个功能划分各个功能模块,也可以将两个或两个以上的功能集成在一个模块中。上述集成的模块既可以采用硬件的形式实现,也可以采用软件功能模块的形式实现。需要说明的是,本申请实施例中对模块的划分是示意性的,仅仅为一种逻辑功能划分,实际实现时可以有另外的划分方式。下面以采用对应各个功能划分各个功能模块为例进行说明:
在采用集成的单元的情况下,图12示出了上述实施例中所涉及的作为中间节点的转发设备的一种可能的结构示意图。作为中间节点的转发设备支持利用P2MP转发BIER报文,包括:接收单元1201、获取单元1202和发送单元1203。其中,接收单元1201用于支持该作为中间节点的转发设备执行图3中的步骤301、或者图4中的步骤300b和步骤301;获取单元1202用于支持该作为中间节点的转发设备执行图3或者图 4中的步骤302和步骤303;获取单元1202和发送单元1203还用于支持该作为中间节点的转发设备执行图3或图4中的步骤304。进一步的,该作为中间节点的转发设备还可以包括生成单元1204,生成单元1204用于支持该作为中间节点的转发设备执行图4中的步骤300a和步骤300c。上述方法实施例涉及的各步骤的所有相关内容均可以援引到对应功能模块的功能描述,在此不再赘述。
在采用硬件实现的基础上,本申请中的获取单元1202和生成单元1204可以为该作为中间节点的转发设备的处理器,接收单元1201可以为该作为中间节点的转发设备的接收器,发送单元1203可以为该作为中间节点的转发设备的发送器,发送器通常可以和接收器集成在一起用作收发器,具体的收发器还可以称为通信接口。
图13所示,为本申请的实施例提供的上述实施例中所涉及的中间节点的一种可能的逻辑结构示意图。该作为中间节点的转发设备支持利用P2MP转发BIER报文,包括:处理器1302和通信接口1303。处理器1302用于对该作为中间节点的转发设备的动作进行控制管理,例如,处理器1302用于支持该作为中间节点的转发设备执行上述获取单元1202和生成单元1204的步骤,和/或用于本文所描述的技术的其他过程。此外,该作为中间节点的转发设备还可以包括存储器1301和总线1304,处理器1302、通信接口1303以及存储器1301通过总线1304相互连接;通信接口1303用于支持该作为中间节点的转发设备进行通信;存储器1301用于存储该作为中间节点的转发设备的程序代码和数据。
其中,处理器1302可以是中央处理器单元,通用处理器,数字信号处理器,专用集成电路,现场可编程门阵列或者其他可编程逻辑器件、晶体管逻辑器件、硬件部件或者其任意组合。其可以实现或执行结合本申请公开内容所描述的各种示例性的逻辑方框,模块和电路。所述处理器也可以是实现计算功能的组合,例如包含一个或多个微处理器组合,数字信号处理器和微处理器的组合等等。总线1304可以是外设部件互连标准(peripheral component interconnect,PCI)总线或扩展工业标准结构(extended industry standard architecture,EISA)总线等。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示,图13中仅用一条粗线表示,但并不表示仅有一根总线或一种类型的总线。
在采用集成的单元的情况下,图14示出了上述实施例中所涉及的作为中间节点的转发设备的一种可能的结构示意图。该作为中间节点的转发设备支持删除BIER头中除BIER标签之外的数据,包括:接收单元1401、获取单元1402和发送单元1403。其中,接收单元1401用于支持该作为中间节点的转发设备接收图5中的步骤501、或者图6中的步骤500a和步骤501;获取单元1402用于支持作为中间节点的转发设备执行图5或图6中的步骤502和步骤503;获取单元1402和发送单元1403还用于支持该作为中间节点的转发设备执行图5或者图6中的步骤504。进一步的,该作为中间节点的转发设备还包括:生成单元1404,用于执行图6中的步骤500b。上述方法实施例涉及的各步骤的所有相关内容均可以援引到对应功能模块的功能描述,在此不再赘述。
在采用硬件实现的基础上,本申请中的获取单元1402和生成单元1404可以为该作为中间节点的转发设备的处理器,接收单元1401可以为该作为中间节点的转发设备的接收器,发送单元1403可以为该作为中间节点的转发设备的发送器,发送器通常可以和接收器集成在一起用作收发器,具体的收发器还可以称为通信接口。
图15所示,为本申请的实施例提供的上述实施例中所涉及的作为中间节点的转发 设备的一种可能的逻辑结构示意图。该作为中间节点的转发设备支持删除BIER头中除BIER标签之外的数据,包括:处理器1502和通信接口1503。处理器1502用于对该作为中间节点的转发设备的动作进行控制管理,例如,处理器1502用于执行获取单元1402和生成单元1404的的步骤,和/或用于本文所描述的技术的其他过程。此外,该作为中间节点的转发设备还可以包括存储器1501和总线1504,处理器1502、通信接口1503以及存储器1501通过总线1504相互连接;通信接口1503用于支持该作为中间节点的转发设备进行通信;存储器1501用于存储该作为中间节点的转发设备的程序代码和数据。
其中,处理器1502可以是中央处理器单元,通用处理器,数字信号处理器,专用集成电路,现场可编程门阵列或者其他可编程逻辑器件、晶体管逻辑器件、硬件部件或者其任意组合。其可以实现或执行结合本申请公开内容所描述的各种示例性的逻辑方框,模块和电路。所述处理器也可以是实现计算功能的组合,例如包含一个或多个微处理器组合,数字信号处理器和微处理器的组合等等。总线1504可以是外设部件互连标准(PCI)总线或扩展工业标准结构(EISA)总线等。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示,图15中仅用一条粗线表示,但并不表示仅有一根总线或一种类型的总线。
在本申请的另一实施例中,还提供一种可读存储介质,可读存储介质中存储有计算机执行指令,当一个设备(可以是单片机,芯片等)或者处理器执行图3或者图4所提供的处理组播数据报文的方法中的步骤。前述的可读存储介质可以包括:U盘、移动硬盘、只读存储器、随机存取存储器、磁碟或者光盘等各种可以存储程序代码的介质。
在本申请的另一实施例中,还提供一种可读存储介质,可读存储介质中存储有计算机执行指令,当一个设备(可以是单片机,芯片等)或者处理器执行图5或者图6所提供的处理组播数据报文的方法中的步骤。前述的可读存储介质可以包括:U盘、移动硬盘、只读存储器、随机存取存储器、磁碟或者光盘等各种可以存储程序代码的介质。
在本申请的另一实施例中,还提供一种计算机程序产品,该计算机程序产品包括计算机执行指令,该计算机执行指令存储在计算机可读存储介质中;设备的至少一个处理器可以从计算机可读存储介质读取该计算机执行指令,至少一个处理器执行该计算机执行指令使得设备执行图3或者图4所提供的处理组播数据报文的方法中的步骤。
在本申请的另一实施例中,还提供一种计算机程序产品,该计算机程序产品包括计算机执行指令,该计算机执行指令存储在计算机可读存储介质中;设备的至少一个处理器可以从计算机可读存储介质读取该计算机执行指令,至少一个处理器执行该计算机执行指令使得设备执行图5或者图6所提供的处理组播数据报文的方法中的步骤。
在本申请实施例中,若作为中间节点的转发设备无法识别和处理BIER头的比特串,但支持利用P2MP转发BIER报文,则当该作为中间节点的转发设备接收到第一组播数据报文,并获取第一转发表项和第二转发表项时,该作为中间节点的转发设备可以根据第一转发表项中用于指示对报文进行P2MP转发的第二标识和第二转发表项,处理第一组播数据报文,以获得第二组播数据报文,且在处理时无需对第一组播数据报文的BIER头进行读取分析,从而可以在不对节点进行硬件升级的情况下实现BIER报文的转发,节省了硬件升级的成本。此外,在作为中间节点的转发设备的下游节点不支持删除BIER头中除BIER 标签外的数据时,该作为中间节点的转发设备还可以在转发组播数据报文时,删除组播数据报文的BIER头中除BIER标签外的数据,使其下游节点可以实现对接收到的组播数据报文的处理或转发,从而也可以在不对节点进行硬件升级的情况下实现BIER报文的转发,进一步了节省了硬件升级的成本。
最后应说明的是:以上所述,仅为本申请的具体实施方式,但本申请的保护范围并不局限于此,任何在本申请揭露的技术范围内的变化或替换,都应涵盖在本申请的保护范围之内。因此,本申请的保护范围应以所述权利要求的保护范围为准。

Claims (16)

  1. 一种处理组播数据报文的方法,其特征在于,应用于基于点到多点P2MP的比特索引显式复制BIER的组播树中,所述组播树的中间节点支持利用P2MP转发BIER报文,所述方法包括:
    所述中间节点接收第一组播数据报文,所述第一组播数据报文的BIER头包括第一标签;
    所述中间节点根据所述第一标签获取第一转发表项,所述第一转发表项包括所述第一标签、第一标识和第二标识,所述第一标识用于标识所述组播树,所述第二标识用于指示对报文进行P2MP转发;
    所述中间节点根据所述第一标识获取第二转发表项,所述第二转发表项包括所述第一标识和第二标签;
    所述中间节点根据所述第二标识、所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文并发送,所述第二组播数据报文包括所述第二标签。
  2. 根据权利要求1所述的方法,其特征在于,所述第二转发表项还包括出接口,所述中间节点根据所述第二标识、所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文并发送包括:
    所述中间节点根据所述第二标识,用所述第二标签替换所述第一组播数据报文包括的所述第一标签,获得所述第二组播数据报文;
    所述中间节点通过所述出接口发送所述第二组播数据报文。
  3. 根据权利要求1或2所述的方法,其特征在于,所述中间节点根据所述第一标签获取第一转发表项之前,所述方法还包括:
    所述中间节点根据第一配置信息、所述第一标签和所述第一标识,生成所述第一转发表,所述第一配置信息用于表示所述中间节点利用P2MP转发BIER报文,所述第二标识是根据所述第一配置信息获得的标识。
  4. 根据权利要求1所述的方法,其特征在于,所述第二转发表项还包括第三标识和出接口,所述第三标识用于指示删除BIER头中除BIER标签之外的数据,所述中间节点根据所述第二标识、所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文并发送包括:
    所述中间节点根据所述第二标识,用所述第二标签替换所述第一组播数据报文包括的所述第一标签,获得标签替换后的第一组播数据报文;
    所述中间节点根据所述第三标识,删除所述标签替换后的第一组播数据报文的BIER头中除所述第二标签之外的数据,获得所述第二组播数据报文;
    所述中间节点通过所述出接口发送所述第二组播数据报文。
  5. 根据权利要求1或4所述的方法,其特征在于,所述中间节点根据所述第一标识获取第二转发表项之前,所述方法还包括:
    所述中间节点接收所述组播树的下游节点发送的所述第二标签和第二配置信息,所述第二配置信息用于表示所述下游节点不支持删除BIER头中除BIER标签之外的数据;
    所述中间节点根据所述第二标签和所述第二配置信息,生成所述第二转发表项,所述第三标识是根据所述第二配置信息获得的标识。
  6. 一种处理组播数据报文的方法,其特征在于,应用于基于点到多点P2MP的比特索 引显式复制BIER的组播树中,所述组播树的中间节点支持删除BIER头中除BIER标签之外的数据,所述方法包括:
    所述中间节点接收第一组播数据报文,所述第一组播数据报文的BIER头包括第一标签;
    所述中间节点根据所述第一标签获取第一转发表项,所述第一转发表项包括所述第一标签和第一标识,所述第一标识用于标识所述组播树;
    所述中间节点根据所述第一标识获取第二转发表项,所述第二转发表项包括所述第一标识、第二标识和第二标签,所述第二标识用于指示删除BIER头中除BIER标签外的数据;
    所述中间节点根据所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文并发送,所述第二组播数据报文包括所述第二标签。
  7. 根据权利要求6所述的方法,其特征在于,所述第二转发表项还包括出接口,所述中间节点根据所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文并发送包括:
    所述中间节点根据所述第二标识,删除所述第一组播数据报文的BIER头中除所述第一标签之外的数据,获得删除数据后的第一组播数据报文;
    所述中间节点用所述第二标签替换所述删除数据后的第一组播数据报文包括的所述第一标签,获得所述第二组播数据报文;
    所述中间节点通过所述出接口发送所述第二组播数据报文。
  8. 根据权利要求6或7所述的方法,其特征在于,所述中间节点根据所述第一标识获取第二转发表项之前,所述方法还包括:
    所述中间节点接收所述组播树的下游节点发送的所述第二标签和配置信息,所述配置信息用于表示所述下游节点不支持删除BIER头中除BIER标签之外的数据;
    所述中间节点根据所述第二标签和所述配置信息,生成所述第二转发表项,所述第二标识是根据所述配置信息获得的标识。
  9. 一种转发设备,其特征在于,所述转发设备为应用于基于点到多点P2MP的比特索引显式复制BIER的组播树中的中间节点,所述转发设备支持利用P2MP转发BIER报文,包括:
    接收单元,用于接收第一组播数据报文,所述第一组播数据报文的BIER头包括第一标签;
    获取单元,用于根据所述第一标签获取第一转发表项,所述第一转发表项包括所述第一标签、第一标识和第二标识,所述第一标识用于标识所述组播树,所述第二标识用于指示对报文进行P2MP转发;
    所述获取单元,还用于根据所述第一标识获取第二转发表项,所述第二转发表项包括所述第一标识和第二标签;
    所述获取单元,还用于根据所述第二标识、所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文,所述第二组播数据报文包括所述第二标签;
    发送单元,用于发送所述第二组播数据报文。
  10. 根据权利要求9所述的转发设备,其特征在于,所述第二转发表项还包括出接口:
    所述获取单元,还用于根据所述第二标识,用所述第二标签替换所述第一组播数据报文包括的所述第一标签,获得所述第二组播数据报文;
    所述发送单元,还用于通过所述出接口发送所述第二组播数据报文。
  11. 根据权利要求9或10所述的转发设备,其特征在于,还包括:
    生成单元,用于根据第一配置信息、所述第一标签和所述第一标识,生成所述第一转发表,所述第一配置信息用于表示所述转发设备利用P2MP转发BIER报文,所述第二标识是根据所述第一配置信息获得的标识。
  12. 根据权利要求9所述的转发设备,其特征在于,所述第二转发表项还包括第三标识和出接口,所述第三标识用于指示删除BIER头中除BIER标签之外的数据:
    所述获取单元,还用于根据所述第二标识,用所述第二标签替换所述第一组播数据报文包括的所述第一标签,获得标签替换后的第一组播数据报文;
    所述获取单元,还用于根据所述第三标识,删除所述标签替换后的第一组播数据报文的BIER头中除所述第二标签之外的数据,获得所述第二组播数据报文;
    所述发送单元,还用于通过所述出接口发送所述第二组播数据报文。
  13. 根据权利要求9或12所述的转发设备,其特征在于:
    所述接收单元,还用于接收所述组播树的下游节点发送的所述第二标签和第二配置信息,所述第二配置信息用于表示所述下游节点不支持删除BIER头中除BIER标签之外的数据;
    所述生成单元,还用于根据所述第二标签和所述第二配置信息,生成所述第二转发表项,所述第三标识是根据所述第二配置信息获得的标识。
  14. 一种转发设备,其特征在于,所述转发设备为应用于基于点到多点P2MP的比特索引显式复制BIER的组播树中的中间节点,所述转发设备支持删除BIER头中除BIER标签之外的数据,包括:
    接收单元,用于接收第一组播数据报文,所述第一组播数据报文的BIER头包括第一标签;
    获取单元,用于根据所述第一标签获取第一转发表项,所述第一转发表项包括所述第一标签和第一标识,所述第一标识用于标识所述组播树;
    所述获取单元,还用于根据所述第一标识获取第二转发表项,所述第二转发表项包括所述第一标识、第二标识和第二标签,所述第二标识用于指示删除BIER头中除BIER标签外的数据;
    所述获取单元,还用于根据所述第二转发表项和所述第一组播数据报文,获得第二组播数据报文,所述第二组播数据报文包括所述第二标签;
    发送单元,用于发送所述第二组播数据报文。
  15. 根据权利要求14所述的转发设备,其特征在于,所述第二转发表项还包括出接口:
    所述获取单元,还用于根据所述第二标识,删除所述第一组播数据报文的BIER头中除所述第一标签之外的数据,获得删除数据后的第一组播数据报文;
    所述获取单元,还用于用所述第二标签替换所述删除数据后的第一组播数据报文包括的所述第一标签,获得所述第二组播数据报文;
    所述发送单元,还用于通过所述出接口发送所述第二组播数据报文。
  16. 根据权利要求14或15所述的转发设备,其特征在于:
    所述接收单元,还用于接收所述组播树的下游节点发送的所述第二标签和配置信息,所述配置信息用于表示所述下游节点不支持删除BIER头中除BIER标签之外的数据;
    所述转发设备还包括:生成单元,用于根据所述第二标签和所述配置信息,生成所述第二转发表项,所述第二标识是根据所述配置信息获得的标识。
PCT/CN2019/075317 2018-03-02 2019-02-18 一种处理组播数据报文的方法及装置 WO2019165900A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP22177937.4A EP4120630A1 (en) 2018-03-02 2019-02-18 Multicast data packet processing method, and apparatus
EP19760490.3A EP3751805B1 (en) 2018-03-02 2019-02-18 Method and device for processing multicast data packet
US17/009,640 US11233724B2 (en) 2018-03-02 2020-09-01 Multicast data packet processing method, and apparatus
US17/549,202 US11652735B2 (en) 2018-03-02 2021-12-13 Multicast data packet processing method, and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810175653.1 2018-03-02
CN201810175653.1A CN110224935B (zh) 2018-03-02 2018-03-02 一种处理组播数据报文的方法及装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/009,640 Continuation US11233724B2 (en) 2018-03-02 2020-09-01 Multicast data packet processing method, and apparatus

Publications (1)

Publication Number Publication Date
WO2019165900A1 true WO2019165900A1 (zh) 2019-09-06

Family

ID=67805918

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/075317 WO2019165900A1 (zh) 2018-03-02 2019-02-18 一种处理组播数据报文的方法及装置

Country Status (4)

Country Link
US (2) US11233724B2 (zh)
EP (2) EP3751805B1 (zh)
CN (2) CN110224935B (zh)
WO (1) WO2019165900A1 (zh)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110224935B (zh) * 2018-03-02 2020-10-23 华为技术有限公司 一种处理组播数据报文的方法及装置
US20210243111A1 (en) * 2020-02-04 2021-08-05 Nokia Solutions And Networks Oy Supporting multicast communications
CN113364695B (zh) * 2020-03-06 2022-03-01 烽火通信科技股份有限公司 一种bier组播在bier域内的单播传输方法及系统
CN114598635A (zh) * 2020-12-02 2022-06-07 华为技术有限公司 报文传输的方法和装置
US11934897B2 (en) * 2021-01-29 2024-03-19 Tenstorrent Inc. Application data flow graph execution using network-on-chip overlay
CN113765877A (zh) * 2021-02-08 2021-12-07 北京沃东天骏信息技术有限公司 会话识别方法、装置、电子设备和计算机可读介质
CN115134289A (zh) * 2021-03-22 2022-09-30 华为技术有限公司 组播报文发送方法及装置
CN115733796A (zh) * 2021-08-24 2023-03-03 华为技术有限公司 通信方法及装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150078377A1 (en) * 2013-09-17 2015-03-19 Cisco Technology, Inc. Bit Indexed Explicit Replication
CN106209559A (zh) * 2016-07-12 2016-12-07 华为技术有限公司 一种建立组播隧道的方法和装置
CN106982157A (zh) * 2016-01-18 2017-07-25 中兴通讯股份有限公司 流量工程隧道建立方法和装置

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7558219B1 (en) * 2004-08-30 2009-07-07 Juniper Networks, Inc. Multicast trees for virtual private local area network (LAN) service multicast
CN103716169B (zh) 2012-09-29 2017-11-24 华为技术有限公司 点到多点的组播实现方法、网络节点和系统
US9544230B2 (en) * 2013-09-17 2017-01-10 Cisco Technology, Inc. Migration support for bit indexed explicit replication
US10003494B2 (en) * 2013-09-17 2018-06-19 Cisco Technology, Inc. Per-prefix LFA FRR with bit indexed explicit replication
US9832031B2 (en) * 2014-10-24 2017-11-28 Futurewei Technologies, Inc. Bit index explicit replication forwarding using replication cache
US10341221B2 (en) * 2015-02-26 2019-07-02 Cisco Technology, Inc. Traffic engineering for bit indexed explicit replication
CN106341327A (zh) * 2015-07-08 2017-01-18 中兴通讯股份有限公司 一种bier报文的传输方法及系统
CN112087386B (zh) * 2015-09-22 2024-01-02 华为技术有限公司 一种报文处理的方法、设备和系统
CN107204867B (zh) * 2016-03-18 2020-03-24 中兴通讯股份有限公司 一种信息传输方法、装置和系统
US10630743B2 (en) * 2016-09-23 2020-04-21 Cisco Technology, Inc. Unicast media replication fabric using bit indexed explicit replication
US10447496B2 (en) * 2017-03-30 2019-10-15 Cisco Technology, Inc. Multicast traffic steering using tree identity in bit indexed explicit replication (BIER)
US10164794B2 (en) * 2017-04-28 2018-12-25 Cisco Technology, Inc. Bridging of non-capable subnetworks in bit indexed explicit replication
CN109150730A (zh) * 2017-06-15 2019-01-04 中兴通讯股份有限公司 组播跨域方法、装置、系统及计算机可读存储介质
US20180367456A1 (en) * 2017-06-20 2018-12-20 Cisco Technology, Inc. System and method to facilitate packet forwarding using stateful bit index explicit replication (bier) in a networking environment
US10469278B2 (en) * 2017-10-24 2019-11-05 Cisco Technology, Inc. Method and device for multicast content delivery
CN109995634B (zh) * 2017-12-29 2021-08-17 中兴通讯股份有限公司 一种组播虚拟专用网络的承载方法和设备
CN110224935B (zh) * 2018-03-02 2020-10-23 华为技术有限公司 一种处理组播数据报文的方法及装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150078377A1 (en) * 2013-09-17 2015-03-19 Cisco Technology, Inc. Bit Indexed Explicit Replication
CN106982157A (zh) * 2016-01-18 2017-07-25 中兴通讯股份有限公司 流量工程隧道建立方法和装置
CN106209559A (zh) * 2016-07-12 2016-12-07 华为技术有限公司 一种建立组播隧道的方法和装置

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
EP3751805B1 (en) 2022-06-15
EP4120630A1 (en) 2023-01-18
US11233724B2 (en) 2022-01-25
US20200403903A1 (en) 2020-12-24
CN110224935A (zh) 2019-09-10
CN110224935B (zh) 2020-10-23
US20220103461A1 (en) 2022-03-31
EP3751805A4 (en) 2021-04-14
EP3751805A1 (en) 2020-12-16
US11652735B2 (en) 2023-05-16
CN112422438A (zh) 2021-02-26

Similar Documents

Publication Publication Date Title
WO2019165900A1 (zh) 一种处理组播数据报文的方法及装置
WO2021063232A1 (zh) 建立bier转发表项的方法、装置和系统
US10693765B2 (en) Failure protection for traffic-engineered bit indexed explicit replication
US20200067722A1 (en) Bit indexed explicit replication
CN107204867B (zh) 一种信息传输方法、装置和系统
JP5760083B2 (ja) プライマリマルチキャストツリーからスタンバイマルチキャストツリーに高速に切り換えるための方法および装置
US9350646B2 (en) MPLS traffic engineering for point-to-multipoint label switched paths
WO2021258754A1 (zh) 报文指示方法、装置、设备和存储介质
US11258698B2 (en) Multicast forwarding method and related device
US11611509B2 (en) Communication method, communications device, and communications system
JP7053901B2 (ja) ループ回避通信方法、ループ回避通信デバイスおよびループ回避通信システム
WO2011103759A1 (zh) 关联的双向标签交换路径的创建方法及系统
WO2021093463A1 (zh) 报文转发的方法、第一网络设备以及第一设备组
EP3866391B1 (en) Controlling protocol independent multicast (pim) join/prune messages from a downstream pim neighbor using a pim join/prune response(s) from an upstream pim neighbor
WO2022117018A1 (zh) 报文传输的方法和装置
WO2022116615A1 (zh) 报文传输的方法、获取对应关系的方法、装置及系统
US10924395B2 (en) Seamless multipoint label distribution protocol (mLDP) transport over a bit index explicit replication (BIER) core
CN113132222A (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: 19760490

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

Country of ref document: EP

Effective date: 20200909