Transmission path fault positioning method, system and device and storage medium

Abstract

The invention provides a transmission path fault positioning method, system and device and a storage medium, and particularly relates to the technical field of transmission path fault positioning, the method comprises the following steps: if a first node is configured with a TraceID, sending the TraceID to a collector; setting a preset bit of the first DDS bus data frame, and writing the TraceID into the first DDS bus data frame to obtain a second DDS bus data frame; packaging the second DDS bus data frame to obtain a first target message; if the second node does not acquire the first target message, stopping sending the TraceID to the collector; and if the collector does not obtain the TraceID sent by the second node within the preset time, the collector determines that the transmission path between the first node and the second node has a fault. According to the method, when the first target message is lost, the fault node can be positioned and analyzed, and the fault positioning efficiency is improved.

Description

Technical Field

[0001] The present application relates to the technical field of transmission path fault location, and in particular to a transmission path fault location method, system, device and storage medium. Background Art

[0002] In the field of industrial Internet of Things and autonomous driving, subscription-based data bus systems are increasingly used. Among them, the DDS (Data Distribution Service) bus standard is a common bus standard that adopts a decentralized distributed architecture. Each node exists as an independent process, and multiple nodes together form a system.

[0003] However, in this system, the transmission path of the DDS bus data cannot be confirmed, and thus the transmission path of the DDS bus data cannot be fault-located when the DDS bus data is lost. Summary of the invention

[0004] In view of this, the purpose of the present application is to provide a transmission path fault location method, system, device and storage medium to solve the above-mentioned problem and realize fault location of the transmission path of DDS bus data when DDS bus data is lost.

[0005] In a first aspect, an embodiment of the present application provides a transmission path fault location method, the method comprising: The first node processes the first DDS bus data to obtain a first DDS bus data frame; If the first node has been configured with a trace identifier TraceID, the first node sends the TraceID to the collector; The first node sets a preset bit of the first DDS bus data frame and writes the TraceID into the first DDS bus data frame to obtain a second DDS bus data frame; The first node encapsulates the second DDS bus data frame to obtain a first target message; The first node sends the first target message to the second node; If the second node does not obtain the first target message, the second node stops sending the TraceID to the collector; If the collector fails to obtain the TraceID sent by the second node within a preset time, the collector determines that the transmission path from the first node to the second node is faulty.

[0006] Preferably, the step of the first node processing the first DDS bus data to obtain the first DDS bus data frame includes: The first node serializes the first DDS bus data to obtain a first DDS bus data sequence; The first node processes the first DDS bus data sequence according to the DDS bus protocol to obtain the first DDS bus data frame.

[0007] Preferably, the method further comprises: If the first node is not configured with the TraceID, encapsulating the first DDS bus data frame to obtain a second target message; The first node sends the second target message to the second node.

[0008] Preferably, the method further comprises: The second node decapsulates the first target message to obtain a third DDS bus data frame; If the preset bit of the third DDS bus data frame is set, the second node processes the third DDS bus data to obtain second DDS bus data.

[0009] Preferably, the step of the second node processing the third DDS bus data to obtain the second DDS bus data comprises: The second node writes the TraceID into the third DDS bus data frame to obtain a fourth DDS bus data frame; The second node parses the fourth DDS bus data frame according to the DDS bus protocol to obtain a fourth DDS bus data sequence; The second node deserializes the fourth DDS bus data sequence to obtain the second DDS bus data.

[0010] Preferably, the method further comprises: If the preset bit of the third DDS bus data frame is not set, the second node parses the third DDS bus data frame according to the DDS bus protocol to obtain a fifth DDS bus data sequence; The second node deserializes the fifth DDS bus data sequence to obtain third DDS bus data.

[0011] Preferably, the method further comprises: If the second node obtains the first target message, the second node sends the TraceID to the collector; If the collector obtains the TraceID sent by the second node within a preset time, the collector determines that the transmission path from the first node to the second node is normal.

[0012] The transmission path fault location method provided by this application brings the following beneficial effects: The present application provides a transmission path fault location method, in which the first node writes TraceID into the first DDS bus data, obtains the second DDS bus data, sends TraceID to the collector, encapsulates the second DDS bus data carrying TraceID, obtains the first target message, if the second node does not obtain the first target message, the second node stops sending TraceID to the collector, if the collector does not obtain the TraceID sent by the second node within a preset time, the collector determines that the transmission path between the first node and the second node is faulty. This method can monitor the status of the data transmission path between each node in real time, once a fault occurs, it can be immediately fed back to the relevant personnel for processing, which is helpful to locate and analyze the faulty node when the first target message is lost, and improve the efficiency of fault location.

[0013] In a second aspect, the present application also provides a transmission path fault location system, the system comprising: A first node, used for processing the first DDS bus data to obtain a first DDS bus data frame; The first node is further configured to send a trace identifier TraceID to a collector if the first node has been configured with the trace ID; set a preset bit of the first DDS bus data frame and write the TraceID into the first DDS bus data frame to obtain a second DDS bus data frame; encapsulate the second DDS bus data frame to obtain a first target message; and send the first target message to the second node; The second node is configured to stop sending the TraceID to the collector if the second node fails to obtain the first target message; The collector is configured to determine that a transmission path between the first node and the second node is faulty if the collector fails to obtain the TraceID sent by the second node within a preset time.

[0014] The transmission path fault locating system provided in the embodiment of the present application has the same technical features as the transmission path fault locating method provided in the above embodiment, and therefore can also solve the same technical problems and achieve the same technical effects.

[0015] In a third aspect, the present application provides a computing device, including a memory and a processor; One or more computer programs are stored in the memory, and the one or more computer programs include instructions; when the instructions are executed by the processor, the computing device executes the method as described in any one of the first aspects.

[0016] In a fourth aspect, the present application provides a computer-readable storage medium, wherein the computer-readable storage medium is used to store a computer program, and the computer program is used to execute the method as described in any one of the first aspects.

[0017] In a fifth aspect, the present application provides a computer program product, wherein the computer program product comprises one or more computer instructions, and when the computer instructions are executed by a computer, the computer executes the method as described in any one of the first aspects.

[0018] Other features and advantages of the present application will be described in the following description, and partly become apparent from the description, or understood by practicing the present application. The purpose and other advantages of the present application are realized and obtained by the structures particularly pointed out in the description and the drawings.

[0019] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, preferred embodiments are specifically cited below and described in detail with reference to the attached drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] In order to more clearly illustrate the specific implementation methods of the present application or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0021] Figure 1 A schematic diagram of a transmission path fault location method flow provided in an embodiment of the present application; Figure 2 A schematic diagram of the structure of a transmission path fault location system provided in an embodiment of the present application; Figure 3 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0022] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution of the present application will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present application.

[0023] To facilitate understanding of this embodiment, the embodiments of the present application are described in detail below.

[0024] The present application embodiment provides a transmission path fault location method, such as Figure 1 As shown, Figure 1 A schematic diagram of a transmission path fault location method provided in an embodiment of the present application. The method comprises the following steps: S101: A first node processes first DDS bus data to obtain a first DDS bus data frame.

[0025] Specifically, the first DDS bus data adopts the form of a publish-subscribe model to construct a virtual global data space, allowing distributed nodes (first nodes or second nodes) to interact without a master-slave relationship. During the interaction process, the first DDS bus data (DDS bus data stream) needs to be processed into the form of a first DDS bus data frame (DDS bus data stream with a frame format) to facilitate the smooth progress of the subsequent data interaction process between the first node and the second node.

[0026] S102, the first node determines whether the first node has been configured with a tracing identifier TraceID, if so, execute step S103, if not, execute step S113.

[0027] Specifically, TraceID (Tracking Identifier) ​​is used to identify the entire tracking process of a single user (first node or second node) request or transaction in a distributed system, that is, the data interaction process.

[0028] S103: The first node sends the TraceID to the collector.

[0029] Specifically, the collector is a scalable and extensible component that receives, processes, and forwards telemetry data (logs or TraceID). Both the collector and TraceID can be edited using an open source observability framework that provides link tracing capabilities. In a decentralized distributed system, the collector can determine the data transmission path between the first node and the second node by recording the TraceID sent by the first node. If the first node is configured with TraceID, the first node generates a TraceID and sends the TraceID to the collector.

[0030] With such a configuration, the collector can track the data transmitted between the first node and the second node through TraceID, thereby monitoring the status of data transmission between the first node and the second node and improving the traceability of transmission path failures between the first node and the second node.

[0031] S104 , the first node sets a preset bit of the first DDS bus data frame and writes the TraceID into the first DDS bus data frame to obtain a second DDS bus data frame.

[0032] Specifically, the preset bit is the 4th bit of the first DDS bus data frame. Setting is to make the 4th bit of the first DDS bus data frame 1, so as to write the TraceID into the first DDS bus data frame. The first node writes the TraceID into the first DDS bus data frame to mark the data transmission path between the first node and the second node, and the same TraceID represents the link between different nodes (the first node and the second node).

[0033] With this configuration, the data transmission path between the first node and the second node can be accurately tracked through TraceID to avoid loss during data transmission and inability to trace the faulty path, thereby improving the accuracy and efficiency of locating the faulty transmission path.

[0034] S105: The first node encapsulates the second DDS bus data frame to obtain a first target message.

[0035] Specifically, the second DDS bus data frame is the first DDS bus data frame carrying TraceID. To facilitate transmission of the second DDS bus data frame, the second DDS bus data frame needs to be converted into a message form, so the second DDS bus data frame is encapsulated to obtain the first target message.

[0036] S106: The first node sends the first target message to the second node.

[0037] Specifically, the first node sends the first target message to the second node to perform a data interaction process, so that the second node can further determine whether to generate a TraceID by determining whether the second node obtains the first target message, and send the TraceID to the collector.

[0038] S107, the second node determines whether the second node obtains the first target message, if so, executes step S108, if not, executes step S109.

[0039] Specifically, the second node may determine whether to send the TraceID to the collector by judging whether the first target message sent by the first node is obtained.

[0040] With such configuration, the collector can record the node that sends the TranceID, so as to promptly determine the faulty transmission path when the first target message is lost.

[0041] S108: The second node sends the TraceID to the collector.

[0042] Specifically, if the second node obtains the first target message, it means that the first target message is not lost. At this time, the second node generates a TraceID and sends the TraceID to the collector.

[0043] S109: The second node stops sending the TraceID to the collector.

[0044] Specifically, if the second node fails to obtain the first target message, it means that the first target message has been lost. At this time, the second node stops generating the TraceID and does not send the TraceID to the collector.

[0045] S110, the collector determines whether the TraceID sent by the second node is obtained within a preset time, if so, executes step S111, if not, executes step S112.

[0046] Specifically, the collector updates the acquisition status every preset time, and records whether the TraceID sent by each node is obtained in each update. During data transmission, each node (first node or second node) of the same data transmission path (the link between the first node and the second node) uses the same TraceID. Therefore, the collector locates the data transmission path between the faulty nodes by determining whether the TraceID is obtained.

[0047] S111, the collector determines that the transmission path from the first node to the second node is normal.

[0048] Specifically, if the collector obtains the TraceID sent by the second node within the preset time, it means that the first target message is not lost during transmission between the first node and the second node. The second node generates a TraceID and sends the TraceID to the collector. The collector obtains the TraceID sent by the second node and records it, thereby determining that the transmission path between the first node and the second node is normal.

[0049] S112: The collector determines that a transmission path between the first node and the second node is faulty.

[0050] Specifically, if the collector fails to obtain the TraceID sent by the second node within the preset time, it means that the first target message is lost during transmission between the first node and the second node, the second node stops generating TraceID, and the collector fails to obtain the TraceID sent by the second node, thereby determining that the transmission path between the first node and the second node is faulty.

[0051] S113, the first node encapsulates the first DDS bus data frame to obtain a second target message.

[0052] Specifically, if the first node is not configured with TraceID, it is impossible to generate TraceID and send it to the collector, nor is it possible to write TraceID into the first DDS bus data frame. The first DDS bus data frame can only be converted into a message form, so the first DDS bus data frame is encapsulated to obtain the second target message.

[0053] S114: The first node sends the second target message to the second node.

[0054] Specifically, the first node sends the second target message to the second node to perform a data interaction process.

[0055] The embodiment of the present application provides a transmission path fault location method, in which the first node writes TraceID into the first DDS bus data, obtains the second DDS bus data, sends TraceID to the collector, encapsulates the second DDS bus data carrying TraceID, obtains the first target message, if the second node does not obtain the first target message, the second node stops sending TraceID to the collector, if the collector does not obtain the TraceID sent by the second node within the preset time, the collector determines that the transmission path between the first node and the second node is faulty. In the prior art, each node of the decentralized distributed system exists as an independent process, and it is impossible to locate the fault of the data transmission path between each node. It can only record the data information of the current node, and it is impossible to reflect the spatiotemporal relationship of the data information flowing between different nodes. In the subsequent analysis, the data information needs to be reprocessed to locate the faulty data transmission path. Compared with the prior art, the method introduces TraceID, so that the transmission of the first target message can be traced, which enhances the traceability of the decentralized distributed system and avoids the inability to locate the data transmission path where the lost first target message is located after the first target message is lost. In this method, the end-to-end (from the first node to the second node) request process can be encoded as a complete call chain, which represents a series of specific request paths (data transmission paths) of decentralized services. By recording the transmission path and call relationship of the first target message in the decentralized distributed system, it helps developers and operation and maintenance personnel understand the behavior process and performance bottlenecks of the decentralized distributed system. This method can monitor the status of the data transmission path between each node in real time. Once a fault occurs, it can be immediately fed back to the relevant personnel for processing, which helps to locate and analyze the faulty node when the first target message is lost, thereby improving the efficiency of fault location.

[0056] The following describes how the first node processes the first DDS bus data to obtain a first DDS bus data frame: The first node serializes the first DDS bus data to obtain a first DDS bus data sequence, and processes the first DDS bus data sequence according to the DDS bus protocol to obtain a first DDS bus data frame.

[0057] Specifically, since the first DDS bus data needs to be transmitted between the first node and the second node, the first DDS bus data needs to be serialized, that is, the first DDS bus data needs to be processed into a byte stream form, and then the first DDS bus data processed into a byte stream form (first DDS bus data sequence) is converted into data in a frame format that complies with the DDS bus protocol, that is, a first DDS bus data frame, to facilitate the transmission of the first DDS bus data between the first node and the second node.

[0058] This method can ensure that the first DDS bus data maintains the integrity of its structure and content during transmission, avoiding the transmission failure caused by the transmission form of the first DDS bus data being inconsistent with the transmission form specified by the DDS bus protocol. This method improves the stability and reliability of data transmission between nodes in a decentralized distributed system.

[0059] In one implementation, the second node decapsulates the first target message to obtain a third DDS bus data frame; if a preset bit of the third DDS bus data frame is set, the second node processes the third DDS bus data to obtain second DDS bus data.

[0060] Specifically, in order to facilitate the second node to process the acquired first target message, the second node needs to first decapsulate the first target message and convert the first target message into the form of overall data, that is, the third DDS bus data frame. The second node determines whether to add TraceID to the third DDS bus data frame by determining whether the preset bit (the fourth bit) of the third DDS bus data frame is set.

[0061] In this manner, the second node quickly identifies and processes the third DDS bus data frame by determining whether a preset bit (the fourth bit) of the third DDS bus data frame is set, thereby improving the efficiency and accuracy of data processing by nodes in a decentralized distributed system.

[0062] The following introduces the second node processing the third DDS bus data to obtain the second DDS bus data. The second node writes the TraceID into the third DDS bus data frame to obtain the fourth DDS bus data frame; parses the fourth DDS bus data frame according to the DDS bus protocol to obtain the fourth DDS bus data sequence; deserializes the fourth DDS bus data sequence to obtain the second DDS bus data; if the preset bit of the third DDS bus data frame is not set, the second node parses the third DDS bus data frame according to the DDS bus protocol to obtain the fifth DDS bus data sequence; deserializes the fifth DDS bus data sequence to obtain the third DDS bus data.

[0063] Specifically, in order to locate the fault point of the data transmission path between each node by real-time tracking of the third DDS bus data frame, it is necessary to write TraceID in the first target message (third DDS bus data frame) after decapsulation to obtain the fourth DDS bus data frame. In this case, it is necessary to first determine whether the preset bit (the fourth bit) of the third DDS bus data frame has been set. If the preset bit of the third DDS bus data frame has been set, it means that the third DDS bus data frame allows the writing of TraceID. At this time, TraceID is written into the third DDS bus data frame to obtain the fourth DDS bus data frame. The fourth DDS bus data frame is deserialized, that is, the byte stream form of the fourth DDS bus data frame is converted into the form of overall data, that is, the second DDS bus data, to facilitate subsequent processing. If the preset bit of the third DDS bus data frame is not set, it means that the third DDS bus data frame does not allow the writing of TraceID. At this time, the third DDS bus data frame is directly deserialized to obtain the third DDS bus data.

[0064] In this method, TraceID is a unique identifier for data transmission between nodes, which can track the flow path (data transmission path) of data frames in the entire decentralized distributed system. By adding TraceID to the third DDS bus data frame, the second node can easily track the source, destination and processing of the third DDS bus data frame, thereby achieving full monitoring of the data transmission path and improving the accuracy, traceability and efficiency of fault location of the data transmission path.

[0065] Based on the above method embodiment, the present application embodiment also provides a transmission path fault location system, such as Figure 2 As shown, Figure 2 A schematic diagram of a transmission path fault location system provided in an embodiment of the present application. The system includes: a first node 21, a second node 22 and a collector 23; The first node 21 is used to process the first DDS bus data to obtain a first DDS bus data frame; The first node 21 is further configured to send the TraceID to the collector if the first node has been configured with a trace identifier TraceID; set a preset bit of the first DDS bus data frame and write the TraceID into the first DDS bus data frame to obtain a second DDS bus data frame; encapsulate the second DDS bus data frame to obtain a first target message; and send the first target message to the second node; The second node 22 is used to stop sending the TraceID to the collector if the second node fails to obtain the first target message; The collector 23 is configured to determine that a transmission path between the first node and the second node is faulty if the collector fails to obtain the TraceID sent by the second node within a preset time.

[0066] Preferably, the first node is specifically configured to serialize the first DDS bus data to obtain a first DDS bus data sequence; and process the first DDS bus data sequence according to the DDS bus protocol to obtain a first DDS bus data frame.

[0067] Preferably, the first node is further configured to encapsulate the first DDS bus data frame to obtain a second target message if the first node is not configured with TraceID; and send the second target message to the second node.

[0068] Preferably, the second node is further used to decapsulate the first target message to obtain a third DDS bus data frame; if a preset bit of the third DDS bus data frame is set, the third DDS bus data is processed to obtain the second DDS bus data.

[0069] Preferably, the second node is specifically used to write the TraceID into the third DDS bus data frame to obtain a fourth DDS bus data frame; parse the fourth DDS bus data frame according to the DDS bus protocol to obtain a fourth DDS bus data sequence; and deserialize the fourth DDS bus data sequence to obtain second DDS bus data.

[0070] Preferably, the second node is further used to parse the third DDS bus data frame according to the DDS bus protocol to obtain a fifth DDS bus data sequence if the preset bit of the third DDS bus data frame is not set; and deserialize the fifth DDS bus data sequence to obtain the third DDS bus data.

[0071] Preferably, the second node is further configured to send the TraceID to the collector if the second node obtains the first target message; The collector is further configured to determine that the transmission path from the first node to the second node is normal if the collector obtains the TraceID sent by the second node within a preset time.

[0072] The transmission path fault locating system provided in the embodiment of the present application has the same technical features as the transmission path fault locating method provided in the above embodiment, and therefore can also solve the same technical problems and achieve the same technical effects.

[0073] The present application also provides a computing device. Figure 3As shown, this figure is a schematic diagram of a computing device provided in an embodiment of the present application, and the computing device 400 includes a bus 401, a processor 402, a communication interface 403 and a memory 404. The processor 402, the memory 404 and the communication interface 403 communicate with each other through the bus 401.

[0074] The bus 401 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 3 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0075] The processor 402 may be any one or more of a central processing unit (CPU), a graphics processing unit (GPU), a microprocessor (MP), or a digital signal processor (DSP).

[0076] The communication interface 403 is used for communicating with the outside. The memory 404 may include a volatile memory, such as a random access memory (RAM). The memory 404 may also include a non-volatile memory, such as a read-only memory (ROM), a flash memory, a hard disk drive (HDD) or a solid state drive (SSD).

[0077] The memory 404 stores executable codes, and the processor 402 executes the executable codes to perform the above-mentioned transmission path fault location method.

[0078] The embodiment of the present application also provides a computer-readable storage medium. The computer-readable storage medium can be any available medium that can be stored by a computing device or a data storage device such as a data center containing one or more available media. The available medium can be a magnetic medium (such as a floppy disk, a hard disk, a tape), an optical medium (such as a DVD), or a semiconductor medium (such as a solid-state hard disk). The computer-readable storage medium includes instructions that instruct the computing device to execute the above method.

[0079] The embodiment of the present application further provides a computer program product, which includes one or more computer instructions. When the computer instructions are loaded and executed on a computing device, the process or function described in the embodiment of the present application is generated in whole or in part.

[0080] The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from one website, computer or data center to another website, computer or data center via wired (e.g., coaxial cable, optical fiber) or wireless (e.g., infrared, wireless, microwave, etc.) means.

[0081] When the computer program product is executed by a computer, the computer executes any of the aforementioned transmission path fault location methods. The computer program product may be a software installation package, and when any of the aforementioned transmission path fault location methods is needed, the computer program product may be downloaded and executed on a computer.

[0082] The descriptions of the processes or structures corresponding to the above-mentioned figures have different emphases. For parts that are not described in detail in a certain process or structure, please refer to the relevant descriptions of other processes or structures.

[0083] The above description is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present application should be included in the protection scope of the present application.

Claims

1. A transmission path fault location method, characterized in that: The method comprises: The first node processes the first DDS bus data to obtain a first DDS bus data frame; If the first node has been configured with a trace identifier TraceID, the first node sends the TraceID to the collector; The first node sets a preset bit of the first DDS bus data frame and writes the TraceID into the first DDS bus data frame to obtain a second DDS bus data frame; The first node encapsulates the second DDS bus data frame to obtain a first target message; The first node sends the first target message to the second node; If the second node does not obtain the first target message, the second node stops sending the TraceID to the collector; If the collector fails to obtain the TraceID sent by the second node within a preset time, the collector determines that the transmission path from the first node to the second node is faulty.

2. The transmission path fault location method according to claim 1, characterized in that: The step of the first node processing the first DDS bus data to obtain the first DDS bus data frame includes: The first node serializes the first DDS bus data to obtain a first DDS bus data sequence; The first node processes the first DDS bus data sequence according to the DDS bus protocol to obtain the first DDS bus data frame.

3. The transmission path fault location method according to claim 1, characterized in that: The method further comprises: If the first node is not configured with the TraceID, encapsulating the first DDS bus data frame to obtain a second target message; The first node sends the second target message to the second node.

4. The transmission path fault location method according to claim 1, characterized in that: The method further comprises: The second node decapsulates the first target message to obtain a third DDS bus data frame; If the preset bit of the third DDS bus data frame is set, the second node processes the third DDS bus data to obtain second DDS bus data.

5. The transmission path fault location method according to claim 4, characterized in that: The step of the second node processing the third DDS bus data to obtain second DDS bus data includes: The second node writes the TraceID into the third DDS bus data frame to obtain a fourth DDS bus data frame; The second node parses the fourth DDS bus data frame according to the DDS bus protocol to obtain a fourth DDS bus data sequence; The second node deserializes the fourth DDS bus data sequence to obtain the second DDS bus data.

6. The transmission path fault location method according to claim 4, characterized in that: The method further comprises: If the preset bit of the third DDS bus data frame is not set, the second node parses the third DDS bus data frame according to the DDS bus protocol to obtain a fifth DDS bus data sequence; The second node deserializes the fifth DDS bus data sequence to obtain third DDS bus data.

7. The transmission path fault location method according to claim 1, characterized in that: The method further comprises: If the second node obtains the first target message, the second node sends the TraceID to the collector; If the collector obtains the TraceID sent by the second node within a preset time, the collector determines that the transmission path from the first node to the second node is normal.

8. A transmission path fault location system, characterized in that: The system comprises: A first node, used for processing the first DDS bus data to obtain a first DDS bus data frame; The first node is further configured to send a trace identifier TraceID to a collector if the first node has been configured with the trace ID; set a preset bit of the first DDS bus data frame and write the TraceID into the first DDS bus data frame to obtain a second DDS bus data frame; encapsulate the second DDS bus data frame to obtain a first target message; and send the first target message to the second node; The second node is used to stop sending the TraceID to the collector if the second node fails to obtain the first target message; The collector is configured to determine that a transmission path between the first node and the second node is faulty if the collector fails to obtain the TraceID sent by the second node within a preset time.

9. A computing device, characterized in that including memory and processor; One or more computer programs are stored in the memory, and the one or more computer programs include instructions; when the instructions are executed by the processor, the computing device executes the method as claimed in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium is used to store a computer program, and the computer program is used to execute the method according to any one of claims 1 to 7.

Images