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

Abstract

The present application provides a transmission path fault location method, system, device, and storage medium, specifically relating to the field of transmission path fault location technology. The method includes: if a first node has been configured with a trace identifier TraceID, sending the TraceID to a collector; setting a preset bit of a first DDS bus data frame and writing the TraceID into the first DDS bus data frame to obtain a second DDS bus data frame; encapsulating the second DDS bus data frame to obtain a first target message; if the second node does not obtain the first target message, stopping sending the 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 helps to locate and analyze the faulty node when the first target message is lost, thereby improving the efficiency of fault location.

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 fields of Industrial Internet of Things and autonomous driving, subscription-based data bus systems are increasingly used. The DDS (Data Distribution Service) bus standard is a common bus standard. It uses a decentralized distributed architecture, where each node operates 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, a fault in the transmission path of the DDS bus data cannot be located when the DDS bus data is lost. Summary of the Invention

[0004] In view of this, the purpose of this application is to provide a transmission path fault location method, system, device and storage medium to solve the above problems 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 method for locating a transmission path fault, the method comprising:

[0006] The first node processes the first DDS bus data to obtain a first DDS bus data frame;

[0007] If the first node has been configured with a trace identifier TraceID, the first node sends the TraceID to the collector;

[0008] 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;

[0009] The first node encapsulates the second DDS bus data frame to obtain a first target message;

[0010] The first node sends the first target message to the second node;

[0011] If the second node does not obtain the first target message, the second node stops sending the TraceID to the collector;

[0012] If the collector fails to 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.

[0013] Preferably, the step of the first node processing the first DDS bus data to obtain the first DDS bus data frame includes:

[0014] The first node serializes the first DDS bus data to obtain a first DDS bus data sequence;

[0015] The first node processes the first DDS bus data sequence according to the DDS bus protocol to obtain the first DDS bus data frame.

[0016] Preferably, the method further comprises:

[0017] If the first node is not configured with the TraceID, encapsulating the first DDS bus data frame to obtain a second target message;

[0018] The first node sends the second target message to the second node.

[0019] Preferably, the method further comprises:

[0020] The second node decapsulates the first target message to obtain a third DDS bus data frame;

[0021] 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.

[0022] Preferably, the step of the second node processing the third DDS bus data to obtain the second DDS bus data includes:

[0023] The second node writes the TraceID into the third DDS bus data frame to obtain a fourth DDS bus data frame;

[0024] The second node parses the fourth DDS bus data frame according to the DDS bus protocol to obtain a fourth DDS bus data sequence;

[0025] The second node deserializes the fourth DDS bus data sequence to obtain the second DDS bus data.

[0026] Preferably, the method further comprises:

[0027] 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;

[0028] The second node deserializes the fifth DDS bus data sequence to obtain third DDS bus data.

[0029] Preferably, the method further comprises:

[0030] If the second node obtains the first target message, the second node sends the TraceID to the collector;

[0031] 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.

[0032] The transmission path fault location method provided by this application brings the following beneficial effects:

[0033] The present application provides a method for locating transmission path faults, in which a first node writes a TraceID into first DDS bus data, obtains second DDS bus data, sends the TraceID to a collector, encapsulates the second DDS bus data carrying the TraceID, and obtains a first target message. If the second node does not obtain the first target message, the second node stops sending the 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 has a fault. This method can monitor the status of the data transmission path between each node in real time. Once a fault occurs, it can immediately provide feedback to 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.

[0034] In a second aspect, the present application further provides a transmission path fault location system, the system comprising:

[0035] The first node is configured to process the first DDS bus data to obtain a first DDS bus data frame;

[0036] The first node is further configured to, if the first node has been configured with a trace identifier TraceID, send the TraceID to a collector; 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;

[0037] The second node is configured to stop sending the TraceID to the collector if the second node fails to obtain the first target message;

[0038] 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.

[0039] 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.

[0040] In a third aspect, the present application provides a computing device, including a memory and a processor;

[0041] 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.

[0042] 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.

[0043] In a fifth aspect, the present application provides a computer program product, which includes one or more computer instructions. When the computer instructions are executed by a computer, the computer executes the method as described in any one of the first aspects.

[0044] Other features and advantages of the present application will be described in the following description, and in part will 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.

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

[0046] In order to more clearly illustrate the specific implementation methods of the present application or the technical solutions in the prior art, the following is a brief introduction to the drawings required for use in the specific implementation methods or the description of the prior art. 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 any creative work.

[0047] Figure 1 A schematic diagram of a transmission path fault location method according to an embodiment of the present application;

[0048] Figure 2 A schematic diagram of the structure of a transmission path fault location system provided in an embodiment of the present application;

[0049] Figure 3 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0050] To make the purpose, technical solutions, and advantages of the embodiments of this application more clear, the technical solutions of this application will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the embodiments described are part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

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

[0052] The present application embodiment provides a method for locating a transmission path fault, such as Figure 1 As shown, Figure 1 A flow chart of a transmission path fault location method provided in an embodiment of the present application. The method includes the following steps:

[0053] S101: A first node processes first DDS bus data to obtain a first DDS bus data frame.

[0054] Specifically, the first DDS bus data utilizes a publish-subscribe model to construct a virtual global data space, allowing distributed nodes (the first node or the second node) to interact without a master-slave relationship. During this interaction, the first DDS bus data (DDS bus data stream) must first be processed into a first DDS bus data frame (a DDS bus data stream with a frame format) to facilitate subsequent data interaction between the first and second nodes.

[0055] S102, the first node determines whether the first node has been configured with a trace identifier TraceID, if so, executes step S103, if not, executes step S113.

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

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

[0058] Specifically, the collector is a scalable and extensible component responsible for receiving, processing, and forwarding telemetry data (logs or TraceIDs). 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 and second nodes by recording the TraceID sent by the first node. If the first node is configured with a TraceID, the first node generates a TraceID and sends it to the collector.

[0059] With this 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.

[0060] 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.

[0061] Specifically, the preset bit is the fourth bit of the first DDS bus data frame. Setting the bit to 1 causes the fourth bit of the first DDS bus data frame to be written into the first DDS bus data frame. The first node writes the TraceID into the first DDS bus data frame to identify the data transmission path between the first node and the second node. The same TraceID represents a link between different nodes (the first node and the second node).

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

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

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

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

[0066] 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.

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

[0068] 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.

[0069] With this 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.

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

[0071] 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.

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

[0073] Specifically, if the second node fails to obtain the first target message, it indicates 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.

[0074] 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.

[0075] Specifically, the collector updates its acquisition status at a preset interval, recording whether it has received the TraceID sent by each node. During data transmission, each node (either the first or second node) along the same data transmission path (the link between the first and second nodes) uses the same TraceID. Therefore, the collector determines whether it has received the TraceID to locate the faulty data transmission path between nodes.

[0076] S111 , the collector determines that the transmission path between the first node and the second node is normal.

[0077] 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.

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

[0079] 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.

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

[0081] Specifically, if the first node is not configured with TraceID, it is impossible to generate TraceID and send TraceID 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.

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

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

[0084] The present application provides a method for locating a transmission path fault, wherein a first node writes a TraceID into first DDS bus data, obtains second DDS bus data, and sends the TraceID to a collector. The second DDS bus data carrying the TraceID is encapsulated to obtain a first target message. If the second node does not obtain the first target message, the second node stops sending the 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. In the prior art, each node in a 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, but cannot reflect the spatiotemporal relationship of the data information flowing between different nodes. In subsequent analysis, the data information needs to be reprocessed to locate the faulty data transmission path. Compared with the prior art, this method introduces the 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 when 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, representing the specific request path (data transmission path) of a series of decentralized services. By recording the transmission path and call relationships of the first target message in the decentralized distributed system, developers and operations personnel can understand the behavioral processes 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. If a failure occurs, it can provide immediate feedback to relevant personnel for resolution. This helps to locate and analyze the faulty node when the first target message is lost, improving fault location efficiency.

[0085] 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.

[0086] 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, and then the first DDS bus data processed into the byte stream (the first DDS bus data sequence) needs to be 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.

[0087] This method can ensure that the first DDS bus data maintains the integrity of its structure and content during transmission, avoiding the situation where the transmission form of the first DDS bus data is inconsistent with the transmission form specified by the DDS bus protocol, which may cause transmission failure. This method improves the stability and reliability of data transmission between various nodes in the decentralized distributed system.

[0088] In one embodiment, 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.

[0089] Specifically, to facilitate processing of the acquired first target message by the second node, the second node must first decapsulate the first target message and convert it into a complete data format, namely, a third DDS bus data frame. The second node then determines whether to subsequently add a TraceID to the third DDS bus data frame by determining whether a preset bit (the fourth bit) in the third DDS bus data frame is set.

[0090] 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.

[0091] The following describes how the second node processes 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 a fourth DDS bus data frame; parses the fourth DDS bus data frame according to the DDS bus protocol to obtain a fourth DDS bus data sequence; deserializes the fourth DDS bus data sequence to obtain the second DDS bus data; and 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; and deserializes the fifth DDS bus data sequence to obtain the third DDS bus data.

[0092] Specifically, to locate fault points in the data transmission path between nodes by real-time tracing the third DDS bus data frame, it is necessary to write the TraceID into the decapsulated first target message (the third DDS bus data frame) to obtain a fourth DDS bus data frame. To do this, it is necessary to first determine whether a preset bit (the fourth bit) of the third DDS bus data frame is set. If so, it indicates that the third DDS bus data frame allows the writing of the TraceID. The TraceID is then written into the third DDS bus data frame to obtain a fourth DDS bus data frame. The fourth DDS bus data frame is then deserialized, converting the byte stream of the fourth DDS bus data frame into a single data format, namely, the second DDS bus data, to facilitate subsequent processing. If the preset bit of the third DDS bus data frame is not set, it indicates that the writing of the TraceID is not allowed. The third DDS bus data frame is then directly deserialized to obtain the third DDS bus data.

[0093] In this approach, TraceID is a unique identifier for data transmitted between nodes, allowing the tracking of data frames' movement (data transmission path) throughout the 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, thus enabling full monitoring of the data transmission path and improving the accuracy, traceability, and efficiency of fault location along the data transmission path.

[0094] Based on the above method embodiment, the embodiment of the present application further 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;

[0095] The first node 21 is configured to process the first DDS bus data to obtain a first DDS bus data frame;

[0096] The first node 21 is further configured to, if the first node has been configured with a trace identifier TraceID, send the TraceID to the collector; 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;

[0097] The second node 22 is configured to stop sending the TraceID to the collector if the second node fails to obtain the first target message;

[0098] 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.

[0099] 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.

[0100] 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 a TraceID; and send the second target message to the second node.

[0101] Preferably, the second node is further configured 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, process the third DDS bus data to obtain the second DDS bus data.

[0102] Preferably, the second node is specifically configured 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 the second DDS bus data.

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

[0104] Preferably, the second node is further configured to send the TraceID to the collector if the second node obtains the first target message;

[0105] The collector is further configured to determine that the transmission path between the first node and the second node is normal if the collector obtains the TraceID sent by the second node within a preset time.

[0106] 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.

[0107] The present application also provides a computing device. Figure 3 As shown, this figure is a schematic diagram of a computing device provided by an embodiment of the present application, wherein 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 via the bus 401.

[0108] 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 one type of bus.

[0109] 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).

[0110] Communication interface 403 is used for external communication. Memory 404 may include volatile memory, such as random access memory (RAM). Memory 404 may also include non-volatile memory, such as read-only memory (ROM), flash memory, hard disk drive (HDD), or solid state drive (SSD).

[0111] The memory 404 stores executable codes, and the processor 402 executes the executable codes to perform the aforementioned transmission path fault location method.

[0112] Embodiments of the present application also provide a computer-readable storage medium. The computer-readable storage medium can be any available medium capable of storing data on a computing device, or a data storage device such as a data center that contains one or more available media. The available medium can be a magnetic medium (e.g., a floppy disk, hard disk, or magnetic tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state drive). The computer-readable storage medium includes instructions that instruct the computing device to execute the above method.

[0113] The present application also provides a computer program product comprising one or more computer instructions that, when loaded and executed on a computing device, fully or partially generate the process or function described in the present application.

[0114] The computer instructions can 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 can 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.

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

[0116] The descriptions of the processes or structures corresponding to the above 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.

[0117] The above description is only a specific implementation method of the present application, but the protection scope of the present application is not limited thereto. Any changes or replacements 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 serializes the first DDS bus data to obtain a first DDS bus data sequence; wherein the first DDS bus data is in the form of a publish-subscribe model to construct a virtual global data space; The first node processes the first DDS bus data sequence according to the DDS bus protocol to obtain the first DDS bus data frame; If the first node has been configured with a trace identifier TraceID, the first node sends the TraceID to a collector; wherein the collector is responsible for receiving, processing and forwarding telemetry data; 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 between the first node and the second node is faulty; After the first node sends the first target message to the second node, the method further includes: 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 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.

2. 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.

3. The transmission path fault location method according to claim 1, 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.

4. 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.

5. A transmission path fault location system, characterized in that: The system comprises: The first node is configured to serialize 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 a first DDS bus data frame; wherein the first DDS bus data is in the form of a publish-subscribe model to construct a virtual global data space; The first node is further configured to, if the first node has been configured with a trace identifier TraceID, send the TraceID to the collector; 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; wherein the collector is responsible for receiving, processing and forwarding telemetry data; 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 being 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; The second node is further configured 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, 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 the second DDS bus data.

6. 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 according to any one of claims 1 to 4.

7. 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 4.

Images