WO2023206165A1 - Procédé et appareil d'envoi de message de données de multidiffusion, et dispositif et support de stockage - Google Patents

Procédé et appareil d'envoi de message de données de multidiffusion, et dispositif et support de stockage Download PDF

Info

Publication number
WO2023206165A1
WO2023206165A1 PCT/CN2022/089652 CN2022089652W WO2023206165A1 WO 2023206165 A1 WO2023206165 A1 WO 2023206165A1 CN 2022089652 W CN2022089652 W CN 2022089652W WO 2023206165 A1 WO2023206165 A1 WO 2023206165A1
Authority
WO
WIPO (PCT)
Prior art keywords
multicast data
parameter
header
path
data message
Prior art date
Application number
PCT/CN2022/089652
Other languages
English (en)
Chinese (zh)
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 CN202280061234.XA priority Critical patent/CN117941333A/zh
Priority to PCT/CN2022/089652 priority patent/WO2023206165A1/fr
Publication of WO2023206165A1 publication Critical patent/WO2023206165A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing

Definitions

  • the present application relates to the field of multicast technology, and in particular to a method, device, equipment and storage medium for sending multicast data messages.
  • Bit-indexed explicit replication (BIER) technology is currently a widely used multicast technology.
  • BFR BIER forwarding router
  • Embodiments of the present application provide a method, device, equipment and storage medium for sending multicast data packets, which can meet the SLA of the multicast service without adjusting the router interface status.
  • the technical solutions are as follows:
  • the first aspect provides a method for sending multicast data packets, which is applied to leaf nodes in the BIER domain.
  • the method includes:
  • the leaf node receives the first multicast data packet through the first path.
  • the first multicast data message includes a first parameter, and the first parameter is used to detect performance indicators.
  • the leaf node obtains the first performance index according to the first parameter.
  • the leaf node determines that the first path does not meet the performance requirements based on the first performance index, and receives the second multicast data message through the second path.
  • the leaf node can receive the multicast data packet through the first path and the second path.
  • the multicast service data carried in the multicast data packet transmitted by the first path and the multicast service data carried in the multicast data packet transmitted by the second path are the same.
  • the leaf The node can only receive and send multicast data packets sent by the first path. In this way, when the leaf node detects that the first path does not meet the performance indicators, it can no longer receive and send multicast data packets sent by this path, but switch to receive and send multicast data packets sent by another path. It can be seen that this method is a method for multicast services.
  • This method can enable multicast services to avoid paths whose performance does not meet the requirements, so that the multicast service data received and sent by leaf nodes is transmitted by paths with better performance. In this way, the SLA of multicast services can be guaranteed without affecting the unicast services carried on the network.
  • This solution can meet the SLA requirements of the multicast service without changing the interface status. Therefore, the problem of excessive link load caused by setting the interface status down will not occur.
  • the first multicast data packet includes a BIER header and an In-situ Flow Information Telemetry (IFIT) header, and the IFIT header is used to carry the first parameter.
  • IFIT In-situ Flow Information Telemetry
  • the multicast data packet transmitted by the first path is a BIER packet.
  • the IFIT technology may be used to determine the performance index of the first path based on the first parameter carried in the IFIT header of the first multicast data message. In this way, the performance indicators are detected based on actual multicast data packets, with higher accuracy.
  • IFIT technology only requires the root node and leaf nodes to configure the IFIT function. There are few devices that need to be configured, and the configuration is relatively simple.
  • the first multicast data packet is a BIER packet encapsulated based on Internet Protocol Version 6 (IPv6), and the BIER header in the first multicast data packet is used to Carry the first parameter.
  • IPv6 Internet Protocol Version 6
  • the multicast data message is a BIER message encapsulated based on IPv6
  • the original field in the BIER header can be used to carry the first parameter, and there is no need to extend the BIER header.
  • the multicast data packet is a BIER packet encapsulated based on IPv6
  • the following field in the BIER header can be used to carry the first parameter:
  • the entropy field in the BIER header, or the BIER forwarding ingress router ID (BFIR ID) field in the BIER header, or the traffic level field in the BIER header, the field used to identify the bottom of the label stack, and survival The time field, or the field and lifetime field in the BIER header used to identify the bottom of the label stack.
  • the multicast data message is a BIER message based on MPLS encapsulation
  • the BIER header is extended and the extension field is used to carry the first parameter.
  • Performance metrics can be calculated by the controller and sent to leaf nodes.
  • the processing can be as follows:
  • the leaf node After receiving the first multicast data packet, the leaf node determines the reception timestamp of the first multicast data packet and obtains the sending timestamp carried in the IFIT header of the first multicast data packet. The leaf node then sends the send timestamp and receive timestamp to the controller. The controller can calculate at least one of the transmission delay and delay jitter based on the sending timestamp and receiving timestamp sent by the leaf node, and sends it to the leaf node.
  • the first parameter includes the first sequence number.
  • the process of determining the performance index can be as follows:
  • Performance metrics can be calculated by the controller and sent to leaf nodes.
  • the processing can be as follows:
  • the leaf node After receiving the first multicast data packet, the leaf node obtains the first sequence number carried in the RTP header or TS header of the first multicast data packet and sends the first sequence number to the controller. It can indicate the sending order of the first multicast data packet.
  • the controller calculates performance indicators such as packet loss rate and out-of-order based on the multiple sequence numbers received, and sends them to the leaf nodes.
  • the leaf node After receiving the first multicast data packet, the leaf node determines the reception timestamp of the first multicast data packet and obtains the sending timestamp carried in the IFIT header of the first multicast data packet. Then, the leaf node sending timestamp and receiving timestamp can calculate at least one of the transmission delay and delay jitter.
  • the performance index can be calculated by the leaf nodes themselves.
  • the process of determining the performance index may be as follows:
  • the leaf node After receiving the first multicast data packet, the leaf node obtains the first sequence number carried in the RTP header or TS header of the first multicast data packet. Then, the leaf node calculates performance indicators such as packet loss rate and reordering based on the multiple sequence numbers received.
  • the performance index of the second path in order to avoid switching to a path with worse performance, while detecting the performance index of the first path, the performance index of the second path can also be detected, and after determining the performance index indicated by the second path When the performance is better than the performance indicated by the performance index of the first path, if the first path does not meet the performance requirements, it can be switched to receive multicast data packets of the second path.
  • the first path and the second path may be non-overlapping paths obtained by planning of the controller.
  • the first path and the second path belong to different flexible algorithm (Flex Algo) slices and are non-overlapping paths. Non-overlapping means that they do not contain the same links.
  • a method for sending multicast data messages is provided.
  • the method is applied to the root node in the BIER domain.
  • the method includes:
  • the multicast data message includes a first parameter, and the first parameter is used to detect performance indicators;
  • the multicast data message includes a BIER header and an IFIT header, and the IFIT header is used to carry the first parameter.
  • the multicast data message includes a BIER header and an RTP header, and the RTP header is used to carry the first parameter;
  • the first multicast data message includes a BIER header and a TS header, and the TS header is used to carry the first parameter.
  • the multicast data packet is a BIER packet based on IPv6 encapsulation, and the BIER header in the multicast data packet is used to carry the first parameter.
  • the entropy field in the BIER header is used to carry the first parameter
  • the BFIR ID field in the BIER header is used to carry the first parameter
  • the TC field, S field and TTL field in the BIER header carry the first parameter
  • the S field and TTL field in the BIER header are used to carry the first parameter.
  • the multicast data packet is a BIER packet based on MPLS encapsulation, and the BIER header in the first multicast data packet is used to carry the first parameter.
  • the first parameter includes at least one of a sending timestamp and a first sequence number.
  • a third aspect provides a device for sending multicast data messages, which device is provided on a leaf node in the first aspect or any optional method of the first aspect.
  • the message forwarding device includes at least one module, and the at least one module is used to implement the method provided by the above-mentioned first aspect or any optional manner of the first aspect.
  • the multicast data message sending provided by the third aspect is implemented by a module in the device through software, and the unit in the message forwarding device is a program module.
  • the modules in the packet forwarding device provided in the third aspect are implemented by hardware or firmware.
  • a fourth aspect provides a device for sending multicast data messages, which device is provided on a leaf node in the second aspect or any optional mode of the second aspect.
  • the message forwarding device includes at least one module, and the at least one module is used to implement the method provided in the above second aspect or any optional manner of the second aspect.
  • the multicast data message sending provided in the fourth aspect is implemented by a module in the device through software, and the unit in the message forwarding device is a program module.
  • the modules in the message forwarding apparatus provided in the fourth aspect are implemented by hardware or firmware.
  • a network device in a fifth aspect, includes a processor and a memory. At least one instruction is stored in the memory. The at least one instruction is loaded and executed by the processor to implement the first step described above. method provided by the aspect or any optional method of the first aspect. The specific details of obtaining the network device provided in the fifth aspect can be found in the above-mentioned first aspect or any optional method of the first aspect, and will not be described again here.
  • a network device in a sixth aspect, includes a processor and a memory. At least one instruction is stored in the memory. The at least one instruction is loaded and executed by the processor to implement the second step described above.
  • the method provided by any optional method of the aspect or the second aspect. The specific details of obtaining the network equipment provided in the sixth aspect can be found in the above-mentioned second aspect or any optional method of the second aspect, and will not be described again here.
  • a computer program product includes one or more computer program instructions.
  • the network device causes the network device to execute the first aspect. Or the method provided by any optional method in the first aspect.
  • a computer program product includes one or more computer program instructions.
  • the network device causes the network device to execute the above second aspect. Or the method provided by any optional method in the second aspect.
  • a chip including a memory and a processor.
  • the memory is used to store computer instructions.
  • the processor is used to call and run the computer instructions from the memory to execute the above first aspect and any possibility of the first aspect. method in the implementation.
  • a chip including a memory and a processor.
  • the memory is used to store computer instructions.
  • the processor is used to call and run the computer instructions from the memory to execute the above second aspect or any one of the second aspects.
  • Optional methods provided.
  • a thirteenth aspect provides a communication system, which includes the network device described in the fifth aspect and the network device described in the sixth aspect.
  • Figure 1 is a schematic diagram of an implementation scenario provided by the embodiment of the present application.
  • Figure 2 is a schematic diagram of multicast data flow switching provided by an embodiment of the present application.
  • Figure 3 is a schematic flowchart of a method for sending multicast data messages provided by an embodiment of the present application
  • Figure 4 is a schematic diagram of the format of a multicast data message provided by an embodiment of the present application.
  • Figure 5 is a schematic diagram of the format of a multicast data message provided by an embodiment of the present application.
  • Figure 6 is a schematic flowchart of a method for sending multicast data messages provided by an embodiment of the present application.
  • Figure 7 is a schematic diagram of the format of a multicast data message provided by an embodiment of the present application.
  • Figure 8 is a schematic diagram of the format of a multicast data message provided by an embodiment of the present application.
  • Figure 9 is a schematic diagram of the format of a multicast data message provided by an embodiment of the present application.
  • Figure 10 is a schematic diagram of the format of a multicast data message provided by an embodiment of the present application.
  • Figure 11 is a schematic diagram of the format of a multicast data message provided by an embodiment of the present application.
  • Figure 12 is a schematic diagram of the format of a multicast data message provided by an embodiment of the present application.
  • Figure 13 is a schematic flowchart of a method for sending multicast data messages provided by an embodiment of the present application.
  • Figure 14 is a schematic diagram of the format of a multicast data message provided by an embodiment of the present application.
  • Figure 15 is a schematic diagram of the format of a BIERv6 message provided by an embodiment of the present application.
  • Figure 16 is a schematic diagram of a network topology provided by an embodiment of the present application.
  • Figure 17 is a schematic flowchart of a method for sending multicast data messages provided by an embodiment of the present application.
  • Figure 19 is a schematic structural diagram of a device for sending multicast data messages provided by an embodiment of the present application.
  • Figure 20 is a schematic structural diagram of a device for sending multicast data messages provided by an embodiment of the present application.
  • Figure 21 is a schematic structural diagram of a network device provided by an embodiment of the present application.
  • BIER/BIERv6 is a multicast forwarding technology that performs explicit replication based on bit indexing.
  • the edge router is assigned a unique identifier, that is, the BIER forwarding router identifier (BFR ID).
  • BFR ID is an integer ranging from 1 to 65535.
  • Edge routers include BIER forwarding ingress router (bit forwarding ingress router, BFIR) and BIER forwarding egress router (bit forwarding egress router, BFER). During the forwarding process, BFIR needs to know which BIER nodes to send multicast data packets to.
  • the BFER set to which multicast data packets are sent is represented by a set bit in a bit string.
  • the offset position of a certain bit in the bit string corresponds to the offset position in the bit string.
  • the BFR ID of an edge router. BFIR encapsulates the bit string corresponding to at least one BFER in the BIER header of the multicast data message.
  • the intermediate BFR between BFIR and BFER can copy and forward based on the bit string in the received multicast data message, so that Multicast data packets can be forwarded to the corresponding BFER.
  • BFIR sends the multicast data message encapsulated with bit string to the downstream BFR according to the bit index forwarding table (BIFT).
  • BIFT bit index forwarding table
  • the downstream BFR parses the bit string and copies the multicast data message according to the entries in BIFT. Send, so that the multicast data packet encapsulated with bit string is forwarded to the corresponding BFER.
  • BFER parses the bit string, checks the destination node that matches the multicast data message, then deletes the outer encapsulation including the BIER header, continues to search the user multicast forwarding table, and forwards the multicast data message to the requesting user based on the search results.
  • BIERv6 Traditional BIER is implemented based on multi-protocol label switching (MPLS).
  • MPLS multi-protocol label switching
  • BIERv6 no longer uses MPLS labels and is a multicast solution based on native IPv6 (native IPv6).
  • BIERv6 inherits the core design concept of BIER. It uses bit strings to copy multicast data messages to designated recipients.
  • the intermediate BFR does not need to establish a multicast forwarding tree to achieve stateless forwarding.
  • BIERv6 technology uses the IPv6 extension header to carry the information required for BIER forwarding, eliminating the need to use MPLS labels.
  • IPv6 extension headers also facilitates subsequent network evolution and overlay, such as fragmentation and reassembly of IPv6 packets, multicast network slicing, and flow detection, etc. Since the service is only deployed on the head node and the tail node, the intermediate nodes do not sense when the multicast service changes. Therefore, when the network topology changes, there is no need to perform undo and rebuild operations on a large number of multicast trees, which greatly simplifies operation and maintenance work.
  • BIERv6 uses IPv6 extension headers to implement its functions. BIERv6 uses the IPv6 extension header to carry BIER options (also called BIER headers), which together with the IPv6 header form the BIERv6 message header. The intermediate BFR reads the bit string in the BIER option, copies, forwards and updates the bit string according to BIFT.
  • any multicast service data of the multicast source can be copied and then entered into the BIER domain through two root nodes for forwarding.
  • the two root nodes here include a primary root node and a backup root node.
  • Leaf nodes can determine the primary root node and backup root node based on the routing priorities of the two root nodes. Specifically, a BGP neighbor is established between the root node and the leaf node, and the leaf node can select the root node with the highest routing priority as the primary root node, and the root node with the second highest routing priority as the backup root node.
  • Ethernet link aggregation (ethernet-trunk, ETH-trunk) bundled interface
  • Trunk is a bundling technology. Multiple physical interfaces are bundled into a logical interface. This logical interface is called a trunk bundled interface, and each physical interface bundled together is called a member interface. Using trunk bundling technology to bundle multiple physical interfaces together can meet the need to increase interface bandwidth at a lower cost. For example, bundling three 100Mbit/s full-duplex interfaces together can achieve a maximum bandwidth of 300Mbit/s.
  • ETH-trunk bundles multiple Ethernet interfaces into a logical interface. This logical interface is called an Eth-trunk bundled interface, and each Ethernet interface bundled together is called a member interface. Eth-trunk bundled interfaces can increase bandwidth, improve reliability and load sharing.
  • Figure 1 is a schematic diagram of an implementation scenario of BIER provided by an embodiment of the present application.
  • the implementation scenario shown in Figure 1 includes multicast source A, root node A, root node B, intermediate node A, intermediate node B, intermediate node C, Intermediate node D, leaf node A, leaf node B, leaf node C, leaf node D, multicast receiving device A, multicast receiving device B, multicast receiving device C and multicast receiving device D.
  • Multicast sources include but are not limited to servers, terminals, etc.
  • Multicast source A is used to generate and send multicast service data.
  • the multicast service data generated by multicast source A includes but is not limited to audio data, video data, etc.
  • Root node A, root node B, intermediate node A, intermediate node B, intermediate node C, intermediate node D, leaf node A, leaf node B, leaf node C, and leaf node D are deployed in the same BIER domain. These nodes can be network devices such as routers, switches, etc. Root node A and root node B are the BFIR of the BIER domain. Leaf node A, leaf node B, leaf node C, and leaf node D are BFERs of the BIER domain. For any leaf node among leaf node A, leaf node B, leaf node C, and leaf node D, one of root node A and root node B is the main root node, and the other is the backup root node.
  • Root node A and root node B receive the same multicast service data from multicast source A, and perform BIER MPLS encapsulation or BIERv6 encapsulation on the received multicast service data to obtain a multicast data packet, in which the multicast data packet Included is the BIER header. Then, root node A and root node B send the multicast data message encapsulated in the bit string to the next hop according to the bit index forwarding table (BIFT). The next hop can be an intermediate node or a leaf node.
  • BIFT bit index forwarding table
  • the intermediate node is used to forward multicast data packets to leaf nodes based on the saved BIFT.
  • leaf nodes can receive multicast data packets from the primary root node and multicast data packets from the backup root node.
  • the leaf node After the leaf node receives the multicast data message sent by the intermediate node or the root node, it determines that the bit corresponding to its own BFR ID in the bit string of the BIER header is 1. The leaf node determines whether the multicast data packet comes from the main root node or the backup root node.
  • the multicast data packet is stripped of the BIER MPLS encapsulation or BIERv6 encapsulation, and the multicast forwarding table is queried, and the multicast service data after the BIER MPLS encapsulation or BIERv6 encapsulation is stripped is forwarded to The corresponding multicast receiving device; if it is determined that the multicast data packet comes from the backup root node, the received multicast data packet can be discarded.
  • the following explains how leaf nodes determine which root node a multicast data packet comes from:
  • the BFIR-ID in the BIER header of the multicast data message is the BFR ID of the root node that sends the multicast data message;
  • the source address in the outer IPv6 header of the multicast data packet is the address of the root node that sends the multicast data packet.
  • the leaf node determines the performance index of the first path by obtaining the parameters carried in the multicast data packet transmitted by the first path. , where the first path is the path between the leaf node and the main root node.
  • the leaf node switches to receive and forward the multicast data packets from the second path, where the second path is the path between the leaf node and the backup root node.
  • leaf node B receives and forwards multicast data packets on the first path, while multicast data packets on the second path can be discarded.
  • Leaf node B can determine the performance index of the first path based on the parameters carried in the multicast data packet transmitted by the first path. When the performance index of the first path does not meet the performance requirements, leaf node B switches to receive and Forward multicast data packets on the second path.
  • the parameters based on which the performance index is determined may also be different.
  • the method for sending multicast data packets provided by the embodiments of this application will be described below in combination with different methods for determining performance indicators.
  • Method 1 for determining performance indicators Determine the performance indicators of the path based on in-situ flow information telemetry (IFIT) technology:
  • the processing flow of multicast data message sending in the embodiment of the present application may include the following steps. The following is combined with the implementation scenario shown in Figure 2, with root node A as leaf node B.
  • the main root node of , root node B is the backup root node of leaf node B as an example.
  • the steps shown in Figure 3 are explained:
  • Step 301 Enable the IFIT detection function on the main root node and leaf nodes.
  • the IFIT detection function can be configured on root node A and leaf node B in advance.
  • root node A receives an IFIT detection instruction to determine to perform IFIT detection.
  • the IFIT detection command may include multicast source information, and the multicast source information is used to instruct IFIT detection on the multicast service data of multicast source A.
  • root node A After receiving the multicast service data sent by multicast source A, root node A can encapsulate the IFIT header for the multicast service data, so that the generated multicast data packet includes an IFIT header.
  • Leaf node B receives the IFIT detection instruction and enables the IFIT detection function. After receiving the multicast data message including the IFIT header, leaf node B can perform IFIT detection based on the parameters carried in the IFIT header.
  • the above IFIT detection instructions can be implemented by the configuration issued by the controller or statically configured.
  • the controller can issue IFIT detection instructions based on network configuration protocol (NETCONF), simple network management protocol (simple network management protocol), etc.
  • NETCONF network configuration protocol
  • simple network management protocol simple network management protocol
  • YANG model a data modeling language
  • Step 302 The main root node forwards the multicast data packet through the first path.
  • root node A After receiving the multicast service data sent by multicast source A, root node A encapsulates the multicast service data to obtain a multicast data message. Specifically, root node A can perform BIER MPLS encapsulation or BIERv6 encapsulation on the received multicast service data. In addition, because the IFIT detection function is enabled on root node A, the multicast service data must be IFIT encapsulated. In this way, the encapsulated multicast data packet includes a BIER header and an IFIT header. After completing the encapsulation, root node A forwards the encapsulated multicast data message to intermediate node A through the first path according to the saved entry in BIFT.
  • the multicast data packet combined with BIER MPLS encapsulation and IFIT encapsulation includes an Ethernet header, a BIER header, an IFIT header and an Internet Protocol multicast payload (IP multicast payload).
  • IP multicast payload is from the multicast source.
  • Multicast service data is from the multicast source.
  • the IFIT header has multiple possible formats. In Figure 4, two of the possible formats are exemplarily shown. Referring to Table 1, the following fields can be included in Format 1 of the IFIT header:
  • FlowMonID(20bits) The identifier of the monitored business flow, unique within the device L(1bit) Packet loss detection dyeing mark D(1bit) Time delay detection dyeing mark HTI(8bits) Identifies the type of extension header NodeMonID(20bits) Device node ID for flow monitoring F(1bit) Business flow direction identifier P(3bits) Measurement period T(2bits) Identification detection type Ext FM Type(16bits) Extended flow detection type identification R(1bit)/Rsv(6bits)/Reversed(16bits) reserved text
  • format two of the IFIT header has an additional field timestamp: indicating the sending timestamp of the multicast data packet.
  • the multicast data message combining BIERv6 encapsulation and IFIT encapsulation can include an IPv6 header, an IPv6 extension header including a BIER header, an IPv6 extension header including an IFIT header, and an IP multicast payload.
  • the IPv6 extension header containing the IFIT header also has multiple possible formats. In Figure 5, two possible formats are exemplarily shown.
  • root node A When root node A performs IFIT encapsulation of multicast service data from multicast source A, it adds corresponding values to the L field and D field in the IFIT header to detect performance indicators such as transmission delay and packet loss rate.
  • root node A After receiving the multicast service data sent by multicast source A, root node A determines that the current packet loss detection period is the Eth packet loss detection period. If E is an odd number, the multicast service data is processed again. When performing IFIT encapsulation, add the value "1" to the L field; if E is an even number, add the value "0" to the L field when performing IFIT encapsulation of the multicast service data. In this way, the values of the L field in the multicast data packets sent in adjacent packet loss detection periods can be different, while the values of the L field in the multicast data packets sent in the same packet loss detection period can be the same.
  • root node A may also send the cycle identifier of the E-th packet loss detection cycle and the first number of messages corresponding to the E-th packet loss detection cycle to the controller.
  • the number of first packets represents the number of multicast data packets with payloads from multicast source A sent in the E-th packet loss detection cycle.
  • Solution 1 Set the delay detection period:
  • root node A forwards the encapsulated multicast data message, if the D field value of the IFIT header in the multicast data message is 1, it will add the cycle identifier of the current delay detection cycle and the The sending timestamp of the multicast data packet is sent to the controller.
  • the period identifier of the delay detection period is used to indicate which delay detection period the corresponding delay detection period is.
  • the added sending timestamp can be the current timestamp obtained when executing IFIT encapsulation, or it can be the sending timestamp obtained by adding the current timestamp obtained when executing IFIT encapsulation plus the preset delay time, and the preset delay time is preset Set the time elapsed from IFIT encapsulation to sending the corresponding multicast data message.
  • root node A since the IFIT header carries the sending timestamp of the multicast data message, root node A no longer needs to send the sending timestamp of the multicast data message to the controller.
  • Step 303 The leaf node receives the multicast data message through the first path between the leaf node and the main root node.
  • intermediate node B parses the bit string in the multicast data message and updates the bit string according to the entry in BIFT. The updated Only the bit corresponding to leaf node B in the bit string is 1. Then, the intermediate node B sends the updated multicast data message to the leaf node B through the first path. Furthermore, the leaf node B can receive the multicast data message sent by the intermediate node B through the first path.
  • Step 304 The leaf node determines the performance index of the first path based on the IFIT header in the multicast data packet received through the first path.
  • leaf node B determines that the multicast data packet comes from the root node based on the BFIR-ID in the BIER header or the source address in the IPv6 header in the multicast data packet. A. Then, packet loss detection and/or delay detection is performed based on the IFIT header in the multicast data message. The following describes packet loss detection and delay detection respectively:
  • leaf node B After confirming that the multicast data packet comes from root node A, leaf node B determines that the current packet loss detection period is the Qth packet loss detection period. If Q is an odd number, determine whether the value of the L field in the IFIT header of the multicast data packet is 1. If it is determined that the value of the L field is 1, then determine the number of packets corresponding to the Qth packet loss detection cycle recorded plus one. When Q is an odd number, the number of packets corresponding to the Q-th packet loss detection cycle indicates: the IP multicast payload carried from root node A and carried by the Q-th packet loss detection cycle is from multicast source A, The number of multicast data packets whose L field value is 1.
  • Q determines whether the value of the L field in the IFIT of the multicast data packet is 0. If it is determined that the value of the L field is 0, then add the number of packets corresponding to the recorded Qth packet loss detection period. one.
  • the number of packets corresponding to the Q-th packet loss detection cycle indicates: the IP multicast payload carried by root node A and carried from multicast source A has been received in the Q-th packet loss detection cycle. The number of multicast data packets whose L field value is 0.
  • leaf node B can send the currently counted cycle identifier of the Qth packet loss detection cycle and the second number of messages corresponding to the Qth packet loss detection cycle to the controller.
  • the controller After receiving the cycle identifier and the second message number of the Qth packet loss detection cycle sent by leaf node B, the controller queries the third message number corresponding to the Qth packet loss detection cycle sent by root node A. Then, the controller calculates the number of packet losses on the first path based on the number of second packets and the number of third packets. In addition, the controller can also calculate the packet loss rate based on the calculated number of lost packets and the number of third packets. Then, the controller can send the number of packets lost and/or the packet loss rate corresponding to the Qth packet loss detection cycle to leaf node B.
  • the delay detection method can also be different.
  • leaf node B After leaf node B determines that the multicast data packet comes from root node A, if it determines that the value of the D field in the IFIT header of the multicast data packet is 1, it obtains the reception timestamp of the multicast data packet. And determine that the current delay detection period is the W-th delay detection period. Then, leaf node B sends the obtained reception timestamp and the cycle identifier of the W-th delay detection cycle to the controller.
  • the controller After receiving the cycle identifier and reception timestamp of the W-th delay detection cycle sent by leaf node B, the controller queries the sending timestamp corresponding to the W-th delay detection cycle sent by root node A. Then, the controller calculates the time difference between the sending timestamp and the receiving timestamp as the first transmission delay of the first path in the W-th delay detection period. In addition, the controller can also obtain the second transmission delay of the first path in the W-1th delay detection period, and calculate the time difference between the first transmission delay and the second transmission delay as the first path's second transmission delay. Delay jitter. Then, the controller may send the calculated first transmission delay and/or delay jitter to the leaf node B.
  • leaf node B After leaf node B determines that the multicast data message comes from root node A, if it determines that the value of the D field in the IFIT header of the multicast data message is 1, it obtains the sending timestamp carried in the IFIT header and obtains The reception timestamp of this multicast data packet. Then, leaf node B calculates the time difference between the sending timestamp and the receiving timestamp as the third transmission delay of the first path. In addition, leaf node B can also obtain the last calculated fourth transmission delay of the first path, and calculate the time difference between the third transmission delay and the fourth transmission delay as the delay jitter of the first path.
  • the controller can also calculate the transmission delay and/or delay jitter of the first path.
  • the processing of leaf node B and the controller can be as follows:
  • leaf node B After leaf node B determines that the multicast data packet comes from the corresponding main root node (root node A), if it determines that the value of the D field in the IFIT header of the multicast data packet is 1, it obtains the value carried in the IFIT header. Send the timestamp and obtain the reception timestamp of the multicast data packet. Then, leaf node B sends the sending timestamp and receiving timestamp to the controller. After receiving the sending timestamp and receiving timestamp sent by leaf node B, the controller calculates the time difference between the sending timestamp and the receiving timestamp as the third transmission delay of the first path.
  • the controller can also obtain the last calculated fourth transmission delay of the first path, and calculate the time difference between the third transmission delay and the fourth transmission delay as the delay jitter of the first path. Then, the controller sends the calculated third transmission delay and/or delay jitter to leaf node B.
  • Step 305 If it is determined that the first path does not meet the performance requirements according to the performance index of the first path, the leaf node receives the multicast data message sent by the backup root node through the second path.
  • leaf node B determines that the first path does not meet the performance requirements based on the performance index of the first path, it can start receiving multicast data packets sent by the root node B through the second path. And strip the BIER MPLS encapsulation or BIERv6 encapsulation of the multicast data packets received through the second path to obtain the corresponding multicast service data. Then, the obtained multicast service data is forwarded to multicast receiving device B. In addition, leaf node B may discard multicast data packets received through the first path. There are many ways for leaf node B to determine whether the first path meets the performance requirements. Several of them are listed below for explanation:
  • Method 1 Determine whether the first path meets the performance requirements based on the currently obtained performance index of the first path.
  • the performance indicator includes the number of packet losses
  • the performance index includes the packet loss rate
  • the performance index includes transmission delay
  • leaf node B obtains the transmission delay of the first path, if it determines that the transmission delay is greater than the delay threshold, it determines that the first path does not meet the performance requirements.
  • the performance index includes delay jitter
  • leaf node B obtains the delay jitter of the first path, if it determines that the delay jitter is greater than the jitter threshold, it determines that the first path does not meet the performance requirements.
  • Method 2 Based on the performance indicators of the first path obtained multiple times in a row, comprehensively determine whether the first path meets the performance requirements.
  • Method 2 can be implemented in a variety of ways. Two of them are listed below for explanation:
  • the performance index includes the number of packet losses
  • leaf node B when the performance index includes the number of packet losses, after leaf node B obtains the number of packet losses of the first path, it can obtain the number of packet losses of the first path obtained K times consecutively before this time, and Based on the number of packet losses of the first path obtained this time and the number of packet losses of the first path obtained K times before this time, calculate the average number of packet losses. If the average number of packet losses is greater than the packet loss threshold, then determine The first path does not meet performance requirements. For another example, when the performance index includes the packet loss rate, after leaf node B obtains the packet loss rate of the first path, it can obtain the packet loss rate of the first path obtained K times consecutively before this time.
  • the average packet loss rate is calculated. If the average packet loss rate is greater than the packet loss rate threshold, the first path is determined Does not meet performance requirements. For another example, when the performance index includes transmission delay, after leaf node B obtains the transmission delay of the first path, it can obtain the transmission delay of the first path obtained K times consecutively before this time. And based on the transmission delay of the first path obtained this time and the transmission delay of the first path obtained K times before this time, the average transmission delay is calculated. If the average transmission delay is greater than the delay threshold, then determine The first path does not meet performance requirements.
  • the performance index includes delay jitter
  • leaf node B when leaf node B obtains the delay jitter of the first path, it can obtain the delay jitter of the first path obtained K times consecutively before this time. And based on the delay jitter of the first path and the delay jitter of the first path obtained K times before this time, the average delay jitter is calculated. If the average delay jitter is greater than the jitter threshold, it is determined that the first path does not meet the Performance requirements.
  • K is a positive integer greater than or equal to 1, which can be configured by technicians according to actual needs.
  • the performance index includes the number of packet losses
  • leaf node B obtains the number of packet losses of the first path
  • it can obtain the number of packet losses of the first path obtained K times consecutively before this time. If The packet loss number of the first path obtained K+1 consecutive times is greater than the packet loss threshold, and it is determined that the first path does not meet the performance requirements.
  • the performance index includes the packet loss rate
  • leaf node B obtains the packet loss rate of the first path, it can obtain the packet loss rate of the first path obtained K times consecutively before this time. If the packet loss rate of the first path obtained for K+1 consecutive times is greater than the packet loss rate threshold, it is determined that the first path does not meet the performance requirements.
  • the performance index when the performance index includes transmission delay, after leaf node B obtains the transmission delay of the first path, it can obtain the transmission delay of the first path obtained K times consecutively before this time. If the transmission delays of the first path obtained for K+1 consecutive times are greater than the delay threshold, it is determined that the first path does not meet the performance requirements.
  • the performance index when the performance index includes delay jitter, after leaf node B obtains the delay jitter of the first path, it can obtain the delay jitter of the first path obtained K times consecutively before this time. If the delay jitter of the first path obtained for K+1 consecutive times is greater than the jitter threshold, it is determined that the first path does not meet the performance requirements.
  • Method 3 Determine whether the first path meets the performance requirements based on the performance index of the first path obtained within a single flow switching detection cycle.
  • Leaf node B can be configured with a flow switching detection period, and the length of this single flow switching detection period can be longer than a single delay detection period and a single packet loss detection period.
  • Leaf node B can collect statistics on the performance indicators obtained during a single flow switching detection cycle. The statistical methods for different performance indicators can be different. For example, if the performance index includes the number of packet losses, then each time a flow switching detection is completed, leaf node B can accumulate the number of packet losses on the first path obtained during the flow switching detection period. For another example, if the performance index includes packet loss rate, then each time a flow switching detection is completed, leaf node B can average the packet loss rate of the first path obtained during the flow switching detection period.
  • leaf node B can average the transmission delay of the first path obtained during the flow switching detection period. For another example, if the performance index includes delay jitter, then, whenever a flow switching detection is completed, leaf node B can average the delay jitter obtained during the flow switching detection period.
  • leaf node B determines that at least one of the performance indicators of the first path obtained from the statistics of the flow switching detection cycle is greater than the corresponding threshold value of the item, it determines that the first path does not meet the performance requirements.
  • performance indicators include packet loss number, packet loss rate, transmission delay, delay jitter, etc.
  • Each of the packet loss number, packet loss rate, transmission delay, delay jitter, etc. has a corresponding threshold. Whenever a flow switching detection is completed, if leaf node B determines that at least one of the packet loss number, packet loss rate, transmission delay, and delay jitter of the first path counted during the flow switching detection period is greater than the corresponding threshold, Then it is determined that the first path does not meet the performance requirements.
  • leaf node B Whenever a flow switching detection is completed, leaf node B performs statistics on the performance indicators of the first path obtained during the flow switching detection period, and obtains the statistics of Y consecutive flow switching detection periods before the flow switching detection period. Performance indicators of the first path. If leaf node B determines that each of the Y+1 flow switching detection periods has at least one performance index greater than the corresponding threshold, it determines that the first path does not meet the performance requirements.
  • Y is a positive integer greater than or equal to 1, which can be configured by technical personnel according to actual needs.
  • leaf node B can make statistics on the performance indicators of the first path obtained during the flow switching detection period, and obtain the Y consecutive flow switching detection periods before the flow switching detection period, respectively. The performance indicators of the first path obtained by statistics. Then, leaf node B performs comprehensive statistics on the performance indicators obtained from the Y+1 flow switching detection cycles. If at least one of the performance indicators obtained by comprehensive statistics of Y+1 flow switching detection cycles is greater than the corresponding threshold of the item, it is determined that the first path does not meet the performance requirements.
  • the following is an example of the above “comprehensive statistics”.
  • leaf node B can accumulate the number of lost packets obtained from Y+1 flow switching detection cycles. For another example, if the performance index includes the packet loss rate, then leaf node B can average the packet loss rates obtained from Y+1 flow switching detection cycles. For another example, if the performance index includes transmission delay, then leaf node B can average the transmission delays obtained from Y+1 flow switching detection cycles. For another example, if the performance index includes delay jitter, then leaf node B can average the delay jitter obtained by counting Y+1 consecutive flow switching detection cycles.
  • the leaf node can also determine the performance index of the second path.
  • the specific determination method is the same as the method of determining the performance index of the first path in steps 301-304 above. are the same and will not be repeated here.
  • determining the performance index of the second path and determining the performance index of the first path may be performed simultaneously.
  • step 305 determines whether the performance indicated by the performance index of the second path is better than the performance indicated by the performance index of the first path. If the performance of the second path is better If the performance of the first path is insufficient, step 305 is continued.
  • leaf node B determines the performance index of the first path and determines the performance index of the second path. If it is determined that each item in the performance index of the second path is smaller than the performance index of the first path, it is determined that the performance of the second path is better than the performance of the first path.
  • the following steps can also be performed after performing step 305: Determine the second path Whether the performance indicators meet the performance requirements. If the performance indicators of the second path do not meet the performance requirements, after the first period of time, the multicast data packets received through the first path will be re-received, and the multicast data received through the first path will be processed.
  • the message strips off the BIER MPLS encapsulation or BIERv6 encapsulation, obtains the corresponding multicast service data, and forwards the obtained multicast service data to the corresponding multicast receiving device.
  • the first duration can be pre-configured in the leaf node by technicians according to actual needs.
  • the leaf node reports to the network management device.
  • Alarm information for example, the second duration is 1 hour and the alarm threshold is 5.
  • the alarm information is used to indicate that both the first path and the second path are faulty, so as to prompt relevant personnel to locate and repair the fault as soon as possible.
  • Both the second duration and the alarm threshold can be pre-configured in the leaf nodes by technicians based on actual needs.
  • the controller may also present a first path between the main root node and the leaf nodes, and a second path between the backup root node and the leaf nodes. After receiving the alarm signal reported by the leaf node, relevant personnel can quickly locate the fault and perform repairs through the overlap between the first path and the second path presented by the controller.
  • IFIT detection is based on the actual multicast data flow, and the performance indicators obtained by the detection are more accurate.
  • Method 2 for determining performance indicators Obtain the performance indicators of the path based on the enhanced media delivery quality index (EMDI) technology:
  • the processing flow of multicast data message sending in the embodiment of the present application may include the following steps. The following is combined with the implementation scenario shown in Figure 2, with root node A as leaf node B.
  • the main root node of , root node B is the backup root node of leaf node B as an example.
  • the steps shown in Figure 3 are explained:
  • Step 401 Enable the EMDI detection function on the main root node and leaf nodes.
  • the EMDI detection function can be configured on root node A and leaf node B in advance.
  • root node A receives an EMDI detection command.
  • the EMDI detection command may include multicast source information.
  • the multicast source information is used to instruct the primary root node to perform EMDI detection on the multicast service data of multicast source A.
  • root node A after root node A receives the multicast service data sent by multicast source A, when performing BIER MPLS encapsulation or BIERv6 encapsulation of the multicast service data, it can add the value "1" to the specified bit in the BIER header. To indicate that the corresponding multicast data packet can be used for EMDI detection.
  • the specified bit may be any unused bit in the Operation and Maintenance (OAM) field or the Reserved (RSV) field in the BIER header.
  • Leaf node B receives the EMDI detection command and enables the EMDI detection function. In this way, after leaf node B receives a multicast data packet with the specified bit in the BIER header being 1, it can perform EMDI detection based on the multicast data packet.
  • the above-mentioned EMDI detection instructions can be implemented by a configuration issued by a controller (controller) or configured statically. When the controller issues the configuration, the EMDI detection instructions can be issued based on the network configuration protocol (network configuration protocol, NETCONF), simple network management protocol (simple network management protocol), etc. In addition, when implemented based on NETCONF, NETCONF combined with the YANG model can be used to implement the issuance of EMDI detection instructions.
  • Step 402 The primary root node forwards the multicast data packet through the first path, where the multicast data packet includes a Real-time Transport Protocol (RTP) header and/or a transport stream (TS) head.
  • RTP Real-time Transport Protocol
  • TS transport stream
  • the multicast service data sent by multicast source A to root node A may be encapsulated based on the RTP protocol and/or TS protocol. Then, the data received by root node A and root node B includes the RTP header and/or TS. multicast service data in the header. Root node A receives multicast service data from multicast source A. Then, BIER MPLS encapsulation or BIERv6 encapsulation is performed on the received multicast service data to obtain the multicast data message. In this way, the obtained multicast data message includes a BIER header, an RTP header (and/or a TS header). After completing the encapsulation, root node A forwards the obtained multicast data message to intermediate node A through the first path according to the saved entry in BIFT.
  • a format of a multicast data message based on BIER MPLS encapsulation and including an RTP header but not a TS header is shown, including an Ethernet header, a BIER header and an IP multicast payload, where the IP multicast payload includes the Internet Protocol (internet protocol) header, user datagram protocol (UDP) header/transmission control protocol (TCP) header, payload and cyclic redundancy check (CRC) data.
  • the RTP header can include the following fields:
  • FIG 8 a format of a multicast data message based on BIERv6 encapsulation and including an RTP header but not a TS header is shown.
  • the format of the RTP header is the same as the format of the RTP header in Figure 7. Here No longer.
  • a format of a multicast data message based on BIER MPLS encapsulation that includes a TS header but does not include an RTP header is shown.
  • a multicast data message can include multiple TS packets (packets). Each TS packet includes a TS header and payload.
  • the TS header can include the following fields:
  • a format of a multicast data message based on BIERv6 encapsulation and including a TS header but not an RTP header is shown.
  • the format of the TS header is the same as the format of the TS header in Figure 9. Here No longer.
  • a format of a multicast data message based on BIER MPLS encapsulation and including an RTP header and a TS header is shown.
  • the format of the TS header is the same as the format of the TS header in Figure 9.
  • the RTP header The format is the same as the format of the RTP header shown in Figure 7, and will not be described again here.
  • a format of a multicast data message based on BIERv6 encapsulation and including an RTP header and a TS header is shown.
  • the format of the TS header is the same as the format of the TS header in Figure 9.
  • the RTP header The format is the same as the format of the RTP header shown in Figure 7, and will not be described again here.
  • Step 403 The leaf node receives the multicast data message through the first path between the leaf node and the main root node.
  • Step 404 The leaf node determines the performance index of the first path based on the RTP header or TS header in the multicast data packet received through the first path.
  • leaf node B After leaf node B receives the multicast data packet through the first path, it determines that the value of the specified bit in the BIER header is 1, indicating that EMDI detection is to be performed on the multicast data packet. Leaf node B obtains the first sequence number in the RTP header of the multicast data message, and obtains the second sequence number in the RTP header of the previous multicast data message received through the first path. Leaf node B calculates the absolute value of the difference between the first sequence number and the second sequence number, and then subtracts one from the calculated absolute value of the difference to obtain the number of lost packets between the two multicast data packets. Among them, the multicast data packet received through the first path refers to the multicast data packet sent by the main root node (root node A) and the IP multicast payload comes from multicast source A.
  • leaf node B can also be configured with a flow switching detection period. Whenever a flow switching detection period ends, leaf node B counts the total number of lost packets of multicast data packets received through the first path during the flow switching detection period, and obtains the actual number of packets lost through the first path during the flow switching detection period. The actual number of multicast data packets received. Then, the sum of the above total number of lost packets and the above actual number of packets is calculated as the expected number of multicast data packets expected to be received through the first path during the flow switching detection period. Then, by calculating the ratio of the total number of packets lost to the expected number of packets, the packet loss rate of the first path within the flow switching detection period can be obtained.
  • leaf node B After leaf node B obtains the first sequence number in the RTP header of the multicast data message, it obtains the multicast data received through the first path during the current flow switching detection period.
  • the maximum sequence number carried in the packet is compared with the size of the first sequence number and the maximum sequence number. If the first sequence number is smaller than the maximum sequence number, it is determined that there is disorder, and the flow is switched to detect the disorder of the first path in the cycle. Count plus one.
  • leaf node B After leaf node B receives the multicast data packet through the first path, it determines that the value of the specified bit in the BIER header is 1, indicating that EMDI detection is to be performed on the multicast data packet.
  • Leaf node B sequentially obtains and records the first count value of the continuity_counter field in the TS header of the multicast data packet (the count value may also be called the sequence number).
  • the order of acquisition can be: the order of TS headers in the multicast data packet from front to back. In the multicast data packet, the TS headers in the front are leafed out before the TS headers in the back. Node B receives it.
  • the previous TS packet received through the first path may belong to the same multicast data packet as the TS packet where the first count value is located, or may belong to different multicast data packets.
  • the TS packet received through the first path refers to the TS packet sent by multicast source A and entering the BIER domain with the main root node (root node A) as the BIER entry router.
  • leaf node B Whenever a flow switching detection period ends, leaf node B counts the total number of packet losses of TS packets received through the first path during the flow switching detection period, and obtains the actual number of TS packets received through the first path during the flow switching detection period. The actual number of packages. Then, the sum of the total number of lost packets and the actual number of packets is calculated as the expected number of TS packets expected to be received through the first path during the flow switching detection period. Then, by calculating the ratio of the total number of packets lost and the number of expected packets, the packet loss rate of the first path within the flow switching detection period can be obtained.
  • Leaf node B sequentially obtains and records the first count value of the continuity_counter field in the TS header of the multicast data packet. Whenever the first count value in a TS header is obtained and recorded, the maximum count value in the TS header received through the first path within the current stream switching detection period is obtained. Compare the first count value and the maximum count value. If the first count value is less than the maximum count value, it is determined that there is an out-of-order sequence, and the out-of-order number of the first path in the flow switching detection period is increased by one. When a flow switching detection period ends, the ratio of the number of out-of-order packets on the first path in the flow switching detection period and the number of expected packets is calculated to obtain the out-of-order rate of the first path in the flow switching detection period.
  • Step 405 If it is determined that the first path does not meet the performance requirements according to the performance index of the first path, the leaf node receives the multicast data message sent by the backup root node through the second path.
  • leaf node B determines that the first path does not meet the performance requirements based on the performance index of the first path, it can start receiving multicast data packets sent by the root node B through the second path. And strip the BIER MPLS encapsulation or BIERv6 encapsulation of the multicast data packets received through the second path to obtain the corresponding multicast service data. Then, the obtained multicast service data is forwarded to multicast receiving device B. In addition, leaf node B may discard multicast data packets received through the first path. There are many ways for leaf node B to determine whether the first path meets the performance requirements. Several of them are listed below for explanation:
  • Method 1 Whenever a flow switching detection period ends, if leaf node B determines that at least one of the performance indicators of the first path during the flow switching detection period is greater than the corresponding threshold, it determines that the first path does not meet the performance requirements. need.
  • performance indicators include packet loss number, packet loss rate, out-of-order number, out-of-order rate, etc.
  • Each of the number of packet loss, packet loss rate, out-of-order number, out-of-order rate, etc. has a corresponding threshold.
  • leaf node B calculates the performance index of the first path obtained during the flow switching detection period, and obtains the Y consecutive flow switching detection periods before the flow switching detection period, respectively. The calculated performance index of the first path. If leaf node B determines that each of the Y+1 flow switching detection periods has at least one performance index greater than the corresponding threshold, it determines that the first path does not meet the performance requirements.
  • leaf node B can calculate the performance index of the first path obtained during the flow switching detection period, and obtain the Y consecutive flow switching detection periods before the flow switching detection period, respectively. The calculated performance index of the first path. Then, leaf node B performs comprehensive statistics on the performance indicators obtained from the Y+1 flow switching detection cycles. If at least one of the performance indicators obtained by comprehensive statistics of Y+1 flow switching detection cycles is greater than the corresponding threshold of the item, it is determined that the first path does not meet the performance requirements. The following is an example of the above “comprehensive statistics”.
  • leaf node B can calculate the average of the number of packet losses obtained from Y+1 flow switching detection cycles. For another example, if the performance index includes the packet loss rate, then leaf node B can average the packet loss rates calculated separately in Y+1 flow switching detection cycles. For another example, if the performance index includes the out-of-order number, then leaf node B can accumulate the out-of-order numbers calculated separately in Y+1 flow switching detection cycles. For another example, if the performance index includes the out-of-order rate, then leaf node B can average the out-of-order rates calculated for Y+1 consecutive flow switching detection cycles.
  • the leaf node can also determine the performance index of the second path.
  • the specific determination method is the same as the method of determining the performance index of the first path in steps 401-404 above. are the same and will not be repeated here.
  • determining the performance index of the second path and determining the performance index of the first path may be performed simultaneously.
  • step 405 before performing the above-mentioned step 405, the following steps may be performed: determine whether the performance indicated by the performance index of the second path is better than the performance indicated by the performance index of the first path. If the performance of the second path is better, If the performance of the first path is insufficient, step 405 is continued.
  • leaf node B determines the performance index of the first path and determines the performance index of the second path. If it is determined that each item in the performance index of the second path is smaller than the performance index of the first path, it is determined that the performance of the second path is better than the performance of the first path.
  • the following steps can also be performed after performing step 405: Determine the second path Whether the performance indicators meet the performance requirements. If the performance indicators of the second path do not meet the performance requirements, after the first period of time, the multicast data packets received through the first path will be re-received, and the multicast data received through the first path will be processed.
  • the message strips off the BIER MPLS encapsulation or BIERv6 encapsulation, obtains the corresponding multicast service data, and forwards the obtained multicast service data to the corresponding multicast receiving device.
  • the first duration can be pre-configured in the leaf node by technicians according to actual needs.
  • the leaf node reports to the network management device.
  • Alarm information for example, the second duration is 1 hour and the alarm threshold is 5.
  • the alarm information is used to indicate that both the first path and the second path are faulty, so as to prompt relevant personnel to locate and repair the fault as soon as possible.
  • Both the second duration and the alarm threshold can be pre-configured in the leaf nodes by technicians based on actual needs.
  • the controller may also present a first path between the main root node and the leaf nodes, and a second path between the backup root node and the leaf nodes. After receiving the alarm signal reported by the leaf node, relevant personnel can quickly locate the fault and perform repairs through the overlap between the first path and the second path presented by the controller.
  • Method 3 for determining performance indicators Intermediate node statistics and the number of lost packets on the link between upstream nodes are carried by the multicast data packet to the leaf node.
  • the leaf node obtains the root node and the number of lost packets carried in the multicast data packet. The number of lost packets on the first path between leaf nodes.
  • the processing flow of multicast data message sending in the embodiment of the present application may include the following steps. The following is combined with the implementation scenario shown in Figure 2, with root node A as leaf node B.
  • the main root node of , root node B is the backup root node of leaf node B as an example.
  • the steps shown in Figure 13 are explained:
  • Step 501 The main root node sends the multicast data message through the first path.
  • root node A After receiving the multicast service data sent by multicast source A, root node A encapsulates the multicast service data to obtain the first multicast data message. Then, the root node A forwards the first multicast data message to the intermediate node A through the first path according to the saved entry in the BIFT.
  • root node A can perform BIER MPLS encapsulation or BIERv6 encapsulation on the received multicast service data to obtain the first multicast data message, which includes a BIER header.
  • root node A performs BIER MPLS encapsulation or BIERv6 encapsulation, it adds an initial value to the field used to carry the number of lost packets in the BIER header.
  • the initial value can also be different depending on the field used to carry the number of lost packets.
  • the initial values added to the different fields carrying the number of lost packets will be explained. The following describes the fields used to carry the number of lost packets in the BIER header under the two types of encapsulation.
  • the BIER header can include the following fields:
  • the BIER header needs to be extended to carry the number of lost packets in the extension field.
  • 4 bytes can be extended in front of the bit string field, and multiple bits can be selected from the extended 4 bytes to carry the number of packet loss.
  • the last one or two bytes among these four bytes can be selected to carry the packet loss number.
  • the actual number of lost packets can be divided by the specified coefficient and rounded, and then carried in this byte.
  • the specified coefficient can be configured by technicians according to actual needs. For example, the specified coefficient is 20.
  • the BIERv6 encapsulated multicast data message mainly consists of an IPv6 header, an IPv6 extension header including a BIER header, and an IP multicast payload.
  • IPv6 header mainly consists of an IPv6 header, an IPv6 extension header including a BIER header, and an IP multicast payload.
  • Table 5 the following fields can be included in the IPv6 header:
  • the IPv6 extension header can include the BIER header and the fields shown in Table 6 below:
  • a total of 12 bits of TS+S+TTL can be used to carry the actual number of lost packets.
  • S+TTL can be used to identify the number of lost packets.
  • the TTL value represents the actual number of packets lost; when S is 1, the TTL value multiplied by the specified coefficient represents the actual number of packets lost.
  • the specified coefficient may be 20.
  • 20 bits of Entropy can be used to carry the actual number of lost packets.
  • 16 bits of BFIR-ID are used to carry the actual number of lost packets.
  • the initial values of the other fields used to carry the number of lost packets can be 0.
  • the initial value of the S field if configured to carry the actual number of lost packets, , then set the initial value of the S field to 0. If configured not to carry the actual number of lost packets, set the initial value of the S field to 1.
  • Step 502 The intermediate node records the number of lost packets on the link between the intermediate node and the upstream node.
  • the upstream node may be an intermediate node or a root node.
  • the incoming interface of intermediate node A performs Cyclic Redundancy Check (CRC) on received packets (including multicast data packets, unicast packets, etc.), and counts the incoming interface based on the check results.
  • CRC Cyclic Redundancy Check
  • the number of packet losses counted for each incoming interface is always accumulated.
  • the multicast service module of intermediate node A obtains the current statistical first packet loss number from the incoming interface, and calculates the first packet loss number and the number obtained in the previous statistical period. The difference between the second number of lost packets counted by the incoming interface is obtained to obtain the new number of lost packets on the incoming interface.
  • the multicast service module sends the new packet loss number of the incoming interface to the forwarding chip of the intermediate node.
  • the forwarding chip records the number of new lost packets on the incoming interface.
  • the multicast service module is a software module that performs multicast services.
  • the incoming interface of intermediate node B also performs Cyclic Redundancy Check (CRC) on the received packets (including multicast data packets, unicast packets, etc.), and counts the incoming packets based on the check results.
  • CRC Cyclic Redundancy Check
  • the number of packet losses counted for each incoming interface is always accumulated.
  • the multicast service module of intermediate node B obtains the current third packet loss number from the incoming interface, and calculates the third packet loss number and the number obtained in the previous statistical period.
  • the difference between the fourth number of lost packets counted by the incoming interface is obtained, and the new number of lost packets on the incoming interface is obtained.
  • the multicast service module sends the new packet loss number of the incoming interface to the forwarding chip of the intermediate node.
  • the forwarding chip records the number of new lost packets on the incoming interface.
  • leaf node B also records the number of packet losses in the link with the upstream node (intermediate node B) according to the processing of step 502.
  • Step 503 The intermediate node receives the multicast data packet, and updates the value in the field used to carry the number of lost packets in the BIER header of the multicast data packet.
  • intermediate node A receives the first multicast data packet through the first incoming interface. Then, the forwarding chip of intermediate node A queries whether the number of new packet losses on the first incoming interface is recorded. If the number of new packet losses on the first incoming interface is recorded, the number of new lost packets on the first incoming interface is recorded. The number is accumulated into the field used to carry the packet loss number in the BIER header of the first multicast data packet to obtain the second multicast data packet. In addition, the forwarding chip pair deletes the recorded number of new packet losses on the first incoming interface. Then, the intermediate node A sends the second multicast data message to the intermediate node B according to the entry in the BIFT.
  • the intermediate node B receives the second multicast data message through the second incoming interface. Then, the forwarding chip of intermediate node B queries whether the number of new packet losses on the second incoming interface is recorded. If the number of new packet losses on the second incoming interface is recorded, the recorded number of new packet losses on the second incoming interface is recorded. The number is accumulated into the field used to carry the number of lost packets in the BIER header of the second multicast data packet to obtain the third multicast data packet. In addition, the forwarding chip pair deletes the recorded number of new packet losses on the first incoming interface. Then, the intermediate node A sends the third multicast data message to the leaf node B according to the entry in the BIFT.
  • the newly queried number of lost packets can be directly accumulated into the field used to carry the number of lost packets in the BIER header; if the BIER header carries the number of packets lost, divide by the specified For the number of lost packets after the coefficient, the newly queried number of lost packets must be divided by the specified coefficient and rounded up, and then accumulated into the field used to carry the number of lost packets in the BIER header.
  • Step 504 The leaf node receives the multicast data message through the first path, and determines the number of lost packets on the first path based on the number of lost packets carried in the BIER header of the multicast data message.
  • leaf node B receives the third multicast data packet through the third incoming interface. Obtain the number of lost packets carried in the BIER header of the third multicast data packet, and query the number of new lost packets on the third incoming interface. Based on the number of lost packets carried and the number of new lost packets queried, determine the first The number of packet losses on the path. In addition, after calculating the number of packet losses on the first path, the recorded number of new packet losses on the third incoming interface can be deleted.
  • the BIER header carries the actual number of lost packets
  • the carried number of lost packets and the newly queried number of lost packets can be directly added together as the number of lost packets on the first path;
  • the BIER header carries the number of lost packets divided by the specified For the number of lost packets after the coefficient, you can add the number of lost packets carried and the new number of lost packets queried, and then multiply them by the specified coefficient to obtain the number of lost packets on the first path.
  • leaf node B can be configured with a flow switching detection period, and accordingly, leaf node B can count the number of packet losses on the first path according to the flow switching detection period.
  • each time leaf node B receives a multicast data packet through the third incoming interface it obtains and records the first packet loss number carried in the BIER header of the multicast data packet.
  • the first number of packet losses recorded in the flow switching detection period and the new second number of packet losses recorded in the third reception period recorded in the flow switching detection period are added to obtain the Number of packets lost on the first path during the flow switching detection period.
  • the recorded number of newly added packet losses on the third incoming interface can be deleted.
  • Step 505 If the performance of the first path does not meet the performance requirements, the leaf node receives the multicast data packet sent by the backup root node through the second path.
  • the method for determining whether the performance of the first path meets the performance requirements can be as follows:
  • leaf node B After obtaining the packet loss number of the first path, leaf node B determines that the packet loss number is greater than the packet loss threshold, and then determines that the first path does not meet the performance requirements.
  • leaf node B after leaf node B obtains the number of packet losses of the first path, it can obtain the number of packet losses of the first path calculated K times consecutively before this time. And based on the number of packet losses of the first path calculated this time and the number of packet losses of the first path calculated K times before this time, the average number of packet losses is calculated. If the average number of packet losses is greater than the packet loss threshold, it is determined that the first path does not meet the performance requirements.
  • leaf node B When leaf node B is configured with a flow switching detection period, the method to determine whether the performance of a path meets the performance requirements can be as follows:
  • leaf node B calculates the number of packets lost on the first path during the flow switching detection period. If it is determined that the number of packets lost is greater than the packet loss threshold, it is determined that the first path does not meet the performance requirements.
  • leaf node B calculates the number of packet losses on the first path during the flow switching detection period, and obtains the calculated number of consecutive Y flow switching detection periods before the flow switching detection period. Number of lost packets on the first path. Then, leaf node B calculates the average number of packet losses based on the number of packet losses calculated during Y+1 flow switching detection cycles. If the average number of packet losses is greater than the packet loss threshold, it is determined that the first path does not meet the performance requirements.
  • leaf node B calculates the number of packet losses on the first path during the flow switching detection period, and obtains the Y consecutive flow switching detection periods before the flow switching detection period and calculates them respectively. The number of packet losses on the first path. If the number of packet losses calculated during these Y+1 flow switching detection cycles is greater than the packet loss threshold, it is determined that the first path does not meet the performance requirements.
  • the leaf node can also determine the performance index of the second path.
  • the specific determination method is the same as the method of determining the performance index of the first path in steps 401-404 above. are the same and will not be repeated here.
  • determining the performance index of the second path and determining the performance index of the first path may be performed simultaneously.
  • step 505 determine whether the performance of the second path is better than the performance of the first path, and if the performance of the second path is better than the performance of the first path, continue execution. Step 505.
  • leaf node B determines the number of packet losses on the first path and determines the number of packet losses on the second path. If it is determined that the number of packet losses of the second path is less than the number of packet losses of the first path, it is determined that the performance of the second path is better than the performance of the first path.
  • the following steps can also be performed after performing step 505: Determine the second path Whether the performance indicators meet the performance requirements. If the performance indicators of the second path do not meet the performance requirements, after the first period of time, the multicast data packets received through the first path will be re-received, and the multicast data received through the first path will be processed.
  • the message strips off the BIER MPLS encapsulation or BIERv6 encapsulation, obtains the corresponding multicast service data, and forwards the obtained multicast service data to the corresponding multicast receiving device.
  • the first duration can be pre-configured in the leaf node by technicians according to actual needs.
  • the controller may also present a first path between the main root node and the leaf nodes, and a second path between the backup root node and the leaf nodes. After receiving the alarm signal reported by the leaf node, relevant personnel can quickly locate the fault and perform repairs through the overlap between the first path and the second path presented by the controller.
  • multicast data packets are used as the carrier of performance indicators.
  • the performance indicators of the path between the root node and the leaf node are calculated from all the messages transmitted on the path.
  • These packets include not only multicast data packets but also unicast packets, which can detect path failures in a more timely manner and switch multicast data flows in a timely manner.
  • Method 1 When planning the first path between a leaf node and the main root node and the second path to the backup root node, you can configure it on each node in the BIER domain one by one. During the configuration, specify the destination node as the leaf node. The outbound interface and next hop destination address for forwarding multicast data packets. Through such hop-by-hop configuration, the first path and the second path can be strictly planned so that the two paths do not have the same link.
  • Method 2 You can specify a path between the main root node and leaf nodes and a second path between the backup root node and leaf nodes on the controller interface, and uniformly issue configurations to each node on the path through the controller.
  • the controller uniformly specifies paths and automatically delivers configurations, making it more operable and deployable for users.
  • Method 3 The network topology of the BIER domain can be collected by the controller.
  • the controller automatically calculates the path based on the network topology, the location of the main root node, the location of the backup root node, and the location of the leaf nodes.
  • the first path and the second path are constrained. The same link does not exist. Then, configure the calculated first path and the second path to each node that the path passes through through automatic configuration.
  • Method 4 Implemented through flexible algorithm (FlexAlgo).
  • One FlexAlgo slice carries multicast data packets from the main root node to the leaf nodes. That is, the first path between the main root node and the leaf nodes belongs to this FlexAlgo slice.
  • Another FlexAlgo slice carries multicast data packets from the backup root node to the leaf nodes. That is, the second path between the backup root node and the leaf nodes belongs to this FlexAlgo slice.
  • Metric-Type represents the metric value when calculating paths in FlexAlgo slices, such as delay, cost, etc.
  • Calc-Type represents the algorithm used when calculating paths in FlexAlgo slices, such as the Shortest Path First (SPF) algorithm.
  • Constraint can be a link constraint, which restricts the links included in FlexAlgo slices.
  • Constraint includes link 1, link 2, link 3, link 4, link 5, link 6, and link 7 in Figure 16;
  • constraint includes link 11, link 12, link 13, link 14, link 15, link 16, and link 17 in Figure 16;
  • the execution steps of this method may also be different.
  • Method 1 Use the upstream node as the execution subject to determine whether the performance indicators meet the performance requirements.
  • the upstream nodes can be other nodes in the BIER domain except leaf node A, leaf node B, leaf node C and leaf node D
  • the downstream nodes can be other nodes in the BIER domain except root node A and root node Nodes other than B.
  • the upstream node is root node A
  • the corresponding downstream node is intermediate node A
  • the upstream node is intermediate node A
  • the upstream node is intermediate node B
  • the upstream node is intermediate node B
  • the corresponding downstream node is leaf node B.
  • the method may include the following processing steps:
  • the downstream node can be an intermediate node or a leaf node
  • the upstream node can be a root node or an intermediate node.
  • the performance indicators may include at least one of packet loss rate, transmission delay, delay jitter, out-of-order, etc.
  • the downstream node when there are multiple equal-cost paths between the upstream node and the downstream node, the downstream node can use the Bidirectional Forwarding Detection (BFD) to periodically detect and detect the equal-cost paths between the upstream nodes. Performance. Then, the performance indicators of each detected equal-cost path are reported to the upstream node through the corresponding interface.
  • BFD Bidirectional Forwarding Detection
  • the downstream node can periodically detect the performance indicators of the links where each member interface of the ETH-Trunk bundled interface is located through BFD. Then, the detected performance indicators are reported to the upstream node through the corresponding member interface.
  • the performance indicators can be carried in BFD messages and reported to the upstream node.
  • Step 902 The upstream node determines whether the received performance indicators meet the performance requirements.
  • performance indicators include packet loss rate, transmission delay, delay jitter, out-of-order, etc. Each performance indicator corresponds to a threshold. If the performance indicator is greater than the corresponding threshold, it is determined that the performance indicator does not meet the performance requirements.
  • Step 903 When forwarding multicast data packets, the upstream node avoids links that do not meet performance requirements.
  • the upstream node when there are multiple equal-cost paths between the upstream node and the downstream node, can query multiple outbound interfaces when forwarding multicast data packets, and each outbound interface corresponds to an equal-cost path.
  • the upstream node determines whether among the multiple interfaces queried, there is an outbound interface whose link does not meet the performance requirements. If it is determined that there is an outbound interface whose link does not meet the performance requirements, then among the outbound interfaces other than the outbound interface, Select an outbound interface as the outbound interface for sending multicast data packets.
  • the upstream node forwards multicast data packets, if the outbound interface is queried to be an ETH-Trunk bundled interface, it will determine the ETH-Trunk bundled interface.
  • the member interfaces is there a member interface whose link does not meet the performance requirements? If it is determined that the link of a certain member interface does not meet the performance requirements, select a member interface among the member interfaces other than the member interface as The outbound interface for multicast data packets.
  • Method 2 Use the downstream node as the execution subject to determine whether the performance indicators meet the performance requirements.
  • the method may include the following processing steps:
  • Step 1001. Detect downstream nodes and perform performance indicators of links between upstream nodes.
  • Step 1002 The downstream node determines that the link does not meet the performance requirements, and sends link failure indication information to the upstream node through the link.
  • the link fault indication information is used to indicate that the link does not meet the performance requirements.
  • the downstream node determines whether the link meets the performance requirements based on the detected performance indicators.
  • link failure indication information is sent to the upstream node through the link.
  • the link failure indication information can be carried in the BFD message and reported to the upstream node.
  • Step 1003 When forwarding multicast data packets, the upstream node avoids links that do not meet performance requirements.
  • step 1001 is the same as the method of detecting performance indicators in step 901.
  • the method of judging whether the performance requirements are met in step 1002 is the same as the method of judging whether the performance requirements are met in step 902.
  • the processing of step 1003 is the same as that of step 903. The processing is the same and will not be described again here.
  • the receiving module 1910 is configured to receive the first multicast data message through the first path.
  • the first multicast data message includes a first parameter, and the first parameter is used to detect performance indicators; specifically, the above step 303 can be implemented. , the receiving function in 403, 504, and other implicit steps.
  • the acquisition module 1920 is used to obtain the first performance index according to the first parameter; specifically, the acquisition function in the above steps 304, 404, and 504 can be implemented, as well as other implicit steps.
  • the receiving module 1910 is also configured to determine that the first path does not meet the performance requirements based on the first performance index, and receive the second multicast data message through the second path.
  • the acquisition functions in the above steps 305, 405, and 505 can be implemented, as well as other implicit steps.
  • the first multicast data message includes a BIER header and an IFIT header, and the IFIT header is used to carry the first parameter.
  • the first multicast data message includes a BIER header and an RTP header, and the RTP header is used to carry the first parameter;
  • the first multicast data message includes a BIER header and a TS header, and the TS header is used to carry the first parameter.
  • the first multicast data packet is a BIER packet based on IPv6 encapsulation, and the BIER header in the first multicast data packet is used to carry the first parameter.
  • the entropy field in the BIER header is used to carry the first parameter
  • the BFIR ID field in the BIER header is used to carry the first parameter
  • the TC field, S field and TTL field in the BIER header carry the first parameter
  • the S field and TTL field in the BIER header are used to carry the first parameter.
  • the first multicast data packet is a BIER packet based on MPLS encapsulation, and the BIER header in the first multicast data packet is used to carry the first parameter.
  • the first parameter includes a first serial number
  • the obtaining module 1920 is used to:
  • the first parameter includes a sending timestamp
  • the obtaining module 1920 is used to:
  • the first performance index is generated based on the sending timestamp and the receiving timestamp, and the first performance index is used to represent at least one of transmission delay and delay jitter of the first path.
  • the first parameter includes a first serial number
  • the obtaining module 1920 is used to:
  • a first performance index is generated based on the first sequence number, and the first performance index is used to represent at least one of packet loss rate and disorder of the first path.
  • the second multicast data message further includes a second parameter
  • the obtaining module 1920 is also used to:
  • a second performance index is obtained based on the second parameter, and the performance indicated by the second performance index is better than the performance indicated by the first performance index.
  • the first path and the second path are non-overlapping paths obtained by planning of the controller.
  • the first path and the second path belong to different FlexAlgo slices and are not overlapping paths.
  • the device for sending multicast data packets provided in the above embodiments performs multicast data packet sending, only the division of the above functional modules is used as an example. In practical applications, the above mentioned functions can be used as needed. Function allocation is completed by different functional modules, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.
  • the device for sending multicast data packets provided in the above embodiments and the method embodiment for sending multicast data packets belong to the same concept. Please refer to the method embodiments for the specific implementation process, which will not be described again here.
  • the embodiment of the present application also provides a device for sending multicast data messages.
  • the device 2000 can be applied to the above-mentioned root node A and root node B as shown in Figure 2, as shown in Figure 20 As shown, the device 2000 includes:
  • the acquisition module 2010 is used to obtain a multicast data message.
  • the multicast data message includes a first parameter, and the first parameter is used to detect performance indicators; specifically, the acquisition functions in the above steps 302, 402, and 501 can be implemented. , and other implicit steps.
  • the sending module 2020 is configured to send the multicast data message to the leaf node through the first path.
  • the method functions in the above steps 302, 402, and 501 can be implemented, as well as other implicit steps.
  • the multicast data message includes a BIER header and a flow detection IFIT header, and the IFIT header is used to carry the first parameter.
  • the multicast data message includes a BIER header and an RTP header, and the RTP header is used to carry the first parameter;
  • the first multicast data message includes a BIER header and a transport stream TS header, and the TS header is used to carry the first parameter.
  • the multicast data message is a BIER message encapsulated based on Internet Protocol version 6, IPv6, and the BIER header in the multicast data message is used to carry the first parameter.
  • the entropy field in the BIER header is used to carry the first parameter
  • the BIER forwarding entry router identification BFIR ID field in the BIER header is used to carry the first parameter
  • the TC field, S field and TTL field in the BIER header carry the first parameter
  • the S field and TTL field in the BIER header are used to carry the first parameter.
  • the multicast data message is a BIER message encapsulated based on multi-protocol label switching, and the BIER header in the first multicast data message is used to carry the first parameter.
  • the first parameter includes at least one of a sending timestamp and a first sequence number.
  • the device for sending multicast data packets provided in the above embodiments performs multicast data packet sending, only the division of the above functional modules is used as an example. In practical applications, the above mentioned functions can be used as needed. Function allocation is completed by different functional modules, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.
  • the device for sending multicast data packets provided in the above embodiments and the method embodiment for sending multicast data packets belong to the same concept. Please refer to the method embodiments for the specific implementation process, which will not be described again here.
  • Figure 21 is a schematic structural diagram of a network device provided by an embodiment of the present application.
  • Network device 700 includes at least one processor 701, memory 702, and at least one network interface 703.
  • the processor 701 is, for example, a general central processing unit (CPU), a network processor (NP), a graphics processing unit (GPU), or a neural network processor (NPU). ), a data processing unit (DPU), a microprocessor or one or more integrated circuits used to implement the solution of the present application.
  • the processor 701 includes an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof.
  • ASIC application-specific integrated circuit
  • PLD programmable logic device
  • PLD is, for example, a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a general array logic (GAL), or any combination thereof.
  • the memory 702 is, for example, a read-only memory (ROM) or other type of static storage device that can store static information and instructions, or a random access memory (random access memory, RAM) or a device that can store information and instructions.
  • ROM read-only memory
  • RAM random access memory
  • Other types of dynamic storage devices such as electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disk storage, optical discs Storage (including compressed optical discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or can be used to carry or store desired program code in the form of instructions or data structures and can Any other media accessed by a computer, without limitation.
  • the memory 702 exists independently and is connected to the processor 701 through an internal connection 704 .
  • memory 702 and processor 701 may optionally be integrated together.
  • Network interface 703 uses any transceiver-like device for communicating with other devices or communications networks.
  • the network interface 703 includes, for example, at least one of a wired network interface or a wireless network interface.
  • the wired network interface is, for example, an Ethernet interface.
  • the Ethernet interface is, for example, an optical interface, an electrical interface or a combination thereof.
  • the wireless network interface is, for example, a wireless local area network (WLAN) interface, a cellular network network interface or a combination thereof.
  • WLAN wireless local area network
  • processor 701 includes one or more CPUs, such as CPU0 and CPU1 shown in Figure 21.
  • network device 700 optionally includes multiple processors, such as processor 701 and processor 705 shown in Figure 21.
  • processors are, for example, a single-core processor (single-CPU) or a multi-core processor (multi-CPU).
  • Processor here optionally refers to one or more devices, circuits, and/or processing cores for processing data (eg, computer program instructions).
  • network device 700 also includes internal connections 704.
  • the processor 701, the memory 702, and the at least one network interface 703 are connected via an internal connection 704.
  • Internal connections 704 include pathways that carry information between the components described above.
  • internal connection 704 is a single board or bus.
  • the internal connections 704 are divided into address bus, data bus, control bus, etc.
  • network device 700 also includes input and output interfaces 706. Input/output interface 706 is connected to internal connection 704 .
  • the processor 701 implements the method in the above embodiment by reading the program code 710 stored in the memory 702, or the processor 701 implements the method in the above embodiment by using the internally stored program code.
  • the processor 701 implements the method in the above embodiment by reading the program code 710 stored in the memory 702
  • the memory 702 stores the program code that implements the method provided by the embodiment of the present application.
  • processor 701 implements the above functions, please refer to the descriptions in the previous method embodiments, which will not be repeated here.
  • the above embodiments may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
  • software When implemented using software, it may be implemented in whole or in part in the form of a computer program product.
  • a computer program product includes one or more computer instructions.
  • Computer program instructions When computer program instructions are loaded and executed on a computer, the processes or functions described in accordance with the embodiments of the present application are generated in whole or in part.
  • the computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable device.
  • Computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, e.g., computer instructions may be transmitted from a website, computer, server or data center via a wired link (e.g.
  • Coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless means to transmit to another website site, computer, server or data center.
  • Computer-readable storage media can be any available media that can be accessed by a computer or a data storage device such as a server, data center, or other integrated media that contains one or more available media. Available media may be magnetic media (for example, floppy disks, hard disks, magnetic tapes), optical media (for example, DVD), or semiconductor media (for example, Solid State Disk SolID State Disk (SSD)), etc.

Landscapes

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

Abstract

Les modes de réalisation de la présente invention appartiennent au domaine technique de la multidiffusion. Sont divulgués un procédé et un appareil d'envoi de message de données de multidiffusion, ainsi qu'un dispositif et un support de stockage. Le procédé est appliqué à un nœud feuille dans un domaine BIER. Le procédé consiste à : recevoir un premier message de données de multidiffusion au moyen d'un premier chemin, le premier message de données de multidiffusion comprenant un premier paramètre, et le premier paramètre étant utilisé pour mesurer un indice de performance ; obtenir un premier indice de performance selon le premier paramètre ; et déterminer, sur la base du premier indice de performance, que le premier chemin ne satisfait pas une exigence de performance, et recevoir alors un second message de données de multidiffusion au moyen d'un second chemin. En utilisant la présente invention, une exigence de qualité SLA d'un service de multidiffusion peut être satisfaite sans affecter l'acheminement d'un message de service de monodiffusion.
PCT/CN2022/089652 2022-04-27 2022-04-27 Procédé et appareil d'envoi de message de données de multidiffusion, et dispositif et support de stockage WO2023206165A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202280061234.XA CN117941333A (zh) 2022-04-27 2022-04-27 组播数据报文发送的方法、装置、设备和存储介质
PCT/CN2022/089652 WO2023206165A1 (fr) 2022-04-27 2022-04-27 Procédé et appareil d'envoi de message de données de multidiffusion, et dispositif et support de stockage

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2022/089652 WO2023206165A1 (fr) 2022-04-27 2022-04-27 Procédé et appareil d'envoi de message de données de multidiffusion, et dispositif et support de stockage

Publications (1)

Publication Number Publication Date
WO2023206165A1 true WO2023206165A1 (fr) 2023-11-02

Family

ID=88516690

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/089652 WO2023206165A1 (fr) 2022-04-27 2022-04-27 Procédé et appareil d'envoi de message de données de multidiffusion, et dispositif et support de stockage

Country Status (2)

Country Link
CN (1) CN117941333A (fr)
WO (1) WO2023206165A1 (fr)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180287934A1 (en) * 2017-03-30 2018-10-04 Cisco Technology, Inc. Multicast traffic steering using tree identity in bit indexed explicit replication (bier)
CN112242932A (zh) * 2019-07-16 2021-01-19 中国电信股份有限公司 时延检测方法和系统
CN113162855A (zh) * 2020-01-22 2021-07-23 华为技术有限公司 组播报文检测方法、网络设备和系统
WO2021190009A1 (fr) * 2020-03-24 2021-09-30 中兴通讯股份有限公司 Procédé et appareil de mesure de performance, dispositif, et support de stockage
CN114172798A (zh) * 2021-11-08 2022-03-11 烽火通信科技股份有限公司 Bier网络故障检测方法、装置、设备及可读存储介质
WO2022078293A1 (fr) * 2020-10-14 2022-04-21 华为技术有限公司 Procédé permettant de détecter un flux de service de multidiffusion et appareil associé

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180287934A1 (en) * 2017-03-30 2018-10-04 Cisco Technology, Inc. Multicast traffic steering using tree identity in bit indexed explicit replication (bier)
CN112242932A (zh) * 2019-07-16 2021-01-19 中国电信股份有限公司 时延检测方法和系统
CN113162855A (zh) * 2020-01-22 2021-07-23 华为技术有限公司 组播报文检测方法、网络设备和系统
WO2021190009A1 (fr) * 2020-03-24 2021-09-30 中兴通讯股份有限公司 Procédé et appareil de mesure de performance, dispositif, et support de stockage
WO2022078293A1 (fr) * 2020-10-14 2022-04-21 华为技术有限公司 Procédé permettant de détecter un flux de service de multidiffusion et appareil associé
CN114172798A (zh) * 2021-11-08 2022-03-11 烽火通信科技股份有限公司 Bier网络故障检测方法、装置、设备及可读存储介质

Also Published As

Publication number Publication date
CN117941333A (zh) 2024-04-26

Similar Documents

Publication Publication Date Title
US11233720B2 (en) Hierarchical time stamping
US8085674B2 (en) Priority trace in data networks
US11811511B2 (en) Method, apparatus, and system for communication between controllers in TSN
US20220294722A1 (en) Transmission Quality Detection Method, Apparatus, and System, and Storage Medium
US8229705B1 (en) Performance monitoring in computer networks
CN113328902B (zh) 网络性能检测方法、装置及网络设备
CN113411834B (zh) 报文处理方法、装置、设备及存储介质
CN113196705B (zh) 组播流量的路径内遥测
US9479619B2 (en) Transmission apparatus, transmission system, and transmission method
CN107968751B (zh) 一种信息处理方法及装置
US20220294712A1 (en) Using fields in an encapsulation header to track a sampled packet as it traverses a network
WO2020135087A1 (fr) Procédé, appareil et système de communication
CN115037667A (zh) 一种细粒度网络态势感知与源路由智能优化方法与装置
EP4149065A1 (fr) Procédé de détermination de capacité de traitement, ainsi que noeud et système
US20230318970A1 (en) Packet Processing Method and Apparatus
JP2023511150A (ja) マルチキャストパケット検出方法、ネットワークデバイス、およびシステム
WO2023206165A1 (fr) Procédé et appareil d'envoi de message de données de multidiffusion, et dispositif et support de stockage
US11582156B2 (en) Traffic detection method, apparatus, and system
WO2022052800A1 (fr) Système de communication, procédé de traitement de données et dispositif associé
US20160315787A1 (en) Network system, control devices, control method, and program
CN116094987A (zh) 转发路径的确定方法及装置
EP4243368A1 (fr) Procédé et appareil d'obtention de données, dispositif et support de stockage
US11792092B2 (en) Network telemetry
WO2022253194A1 (fr) Procédé et appareil de renvoi de paquet, et réseau de communication
CN114338482A (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: 22939018

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 202280061234.X

Country of ref document: CN