CN114124790B - Data transmission method and device based on directed acyclic graph and electronic equipment - Google Patents
Data transmission method and device based on directed acyclic graph and electronic equipment Download PDFInfo
- Publication number
- CN114124790B CN114124790B CN202111435445.9A CN202111435445A CN114124790B CN 114124790 B CN114124790 B CN 114124790B CN 202111435445 A CN202111435445 A CN 202111435445A CN 114124790 B CN114124790 B CN 114124790B
- Authority
- CN
- China
- Prior art keywords
- node
- data transmission
- determining
- data
- directed acyclic
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
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/02—Topology update or discovery
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a data transmission method and device based on a directed acyclic graph and electronic equipment, wherein the method comprises the following steps: determining a starting node, a terminating node and a first arrival path in the directed acyclic graph according to the data transmission instruction; transmitting the data to be transmitted along the first arrival path; if feedback information of unreceived data sent by a problem node is received, determining a superior node for sending data to the problem node and deleting a data transmission channel between the superior node and the problem node; and repeatedly executing the steps until the termination node receives the data so as to complete the data transmission process indicated in the data transmission instruction. The method can form a complete set of abnormal detection, abnormal node determination and an abnormal solving complete mechanism by determining the first arrival path of data in the directed acyclic graph structure and adjusting the first arrival path in real time according to whether the data is transmitted to each node or not, thereby improving the data transmission efficiency.
Description
Technical Field
The invention discloses the technical field of LED data transmission, in particular to a data transmission method and device based on a directed acyclic graph and electronic equipment.
Background
The large screen in the LED system is composed of a plurality of LED boxes, each LED box is provided with a receiving card, the LED boxes are connected in cascade through network receiving and transmitting interfaces on the receiving cards, video data to be displayed are transmitted among the LED boxes through the network receiving and transmitting interfaces, and the video data are transmitted to the LED boxes and displayed, so that the large screen is realized to display the video data to be displayed.
However, the current cascade unit of the receiving card may further include a transmitting card, a terminal where the upper computer is located, a switch, and a control terminal, when a problem occurs in one terminal device and cannot work normally, the display of video data in a large screen will be directly affected, at this time, the most critical problem in this process is how to detect an abnormality, from which terminal device the abnormality originates, and how to solve the abnormality, which is particularly critical, however, the prior art does not establish a complete solution mechanism for all the above problems. Therefore, those skilled in the art need to find a new technical solution to solve the above problems.
Disclosure of Invention
In order to overcome the problems in the related art, the invention discloses a data transmission method and device based on a directed acyclic graph and electronic equipment.
According to a first aspect of the disclosed embodiments of the present invention, there is provided a data transmission method based on a directed acyclic graph, a node in the directed acyclic graph comprising: the method comprises the following steps of:
determining a starting node and a terminating node in the directed acyclic graph according to the received data transmission instruction;
determining a first arrival path between the start node and the end node;
starting the data to be transmitted from the initial node, and transmitting the data along the first arrival path;
if feedback information of unreceived data sent by a problem node in the first arrival path is received, determining an upper node which sends data to the problem node in the directed acyclic graph, and deleting a data transmission channel between the upper node and the problem node;
repeating the steps from the determining of the first arrival path between the starting node and the ending node to the determining of the upper node sending data to the problem node in the directed acyclic graph, and deleting the data transmission channel between the upper node and the problem node until the ending node receives the data to complete the data transmission process indicated in the data transmission instruction.
Optionally, the determining a start node and a stop node in the directed acyclic graph according to the received data transmission instruction includes:
acquiring the data transmission instruction, wherein the data transmission instruction comprises data to be transmitted;
determining a target control terminal node as an initial node in the directed acyclic graph according to the data transmission instruction;
and determining a target receiving card node as a termination node in the directed acyclic graph according to the data transmission instruction.
Optionally, the determining, according to the data transmission instruction, a target control terminal node as an originating node in the directed acyclic graph includes:
determining whether a control terminal node with the highest priority in the directed acyclic graph has a fault or not;
if the control terminal node with the highest priority has no fault, taking the control terminal node with the highest priority as a target control terminal node;
if the control terminal node with the highest priority fails, deleting the control terminal node with the highest priority in the directed acyclic graph;
repeating the steps from determining whether the control terminal node with the highest priority in the directed acyclic graph fails to determining that the control terminal node with the highest priority does not fail, taking the control terminal node with the highest priority as a target control terminal node or determining that the control terminal node with the highest priority fails, and deleting the control terminal node with the highest priority in the directed acyclic graph until the target control terminal node is determined;
and taking the target control terminal node as the starting node.
Optionally, the determining the first arrival path between the start node and the end node includes:
traversing all nodes in the directed acyclic graph structure through a depth optimization search algorithm, and determining all intermediate nodes between the starting node and the ending node and the preset priority of each intermediate node in a hierarchy to which the intermediate node belongs;
and determining a first arrival path between the starting node and the ending node, wherein the first arrival path comprises the starting node, the ending node and an intermediate node with the highest priority in each level.
Optionally, if feedback information of unreceived data sent by a problem node in the first arrival path is received, determining an upper node sending data to the problem node in the directed acyclic graph, and deleting a data transmission channel between the upper node and the problem node, including:
in the process of transmitting data along the first arrival path, if feedback information sent by a node in the first arrival path is received, determining the node sending the feedback information as a problem node;
determining a superior node which transmits data to the problem node;
and deleting the data transmission channel between the superior node and the problem node in the directed acyclic graph.
Optionally, the method further comprises:
the problem node is deleted in the directed acyclic graph.
According to a second aspect of the disclosed embodiments of the present invention, there is provided a data transmission device based on a directed acyclic graph, a node in the directed acyclic graph comprising: the device comprises a control terminal node, a switch node, an upper computer node, a sending card node and a receiving card node, and the device comprises:
the node determining module is used for determining a starting node and a termination node in the directed acyclic graph according to the received data transmission instruction;
the path determining module is connected with the node determining module and used for determining a first arrival path between the starting node and the ending node;
the data transmission module is connected with the path determination module and is used for transmitting the data to be transmitted along the first arrival path from the initial node;
the fault feedback module is connected with the data transmission module, and if receiving feedback information of unreceived data sent by a problem node in the first arrival path, the fault feedback module determines a superior node which sends data to the problem node in the directed acyclic graph, and deletes a data transmission channel between the superior node and the problem node;
and the loop execution module is connected with the fault feedback module and repeatedly executes the steps from the first arrival path between the initial node and the termination node to the upper node which determines that the directed acyclic graph sends data to the problem node, and deletes the data transmission channel between the upper node and the problem node until the termination node receives the data to complete the data transmission process indicated in the data transmission instruction.
Optionally, the path determining module includes:
an intermediate node determining unit, configured to traverse all nodes in the directed acyclic graph structure by using a depth optimization search algorithm, determine all intermediate nodes between the start node and the end node, and preset priorities of each intermediate node in a hierarchy to which the intermediate node belongs;
the first arrival path determining unit is connected with the intermediate node determining unit and is used for determining a first arrival path between the starting node and the ending node, wherein the first arrival path comprises the starting node, the ending node and the intermediate node with the highest priority in each level.
Optionally, the fault feedback module includes:
the problem node determining unit is used for determining a node for transmitting feedback information as a problem node if receiving the feedback information transmitted by the node in the first arrival path in the process of transmitting the data along the first arrival path;
the upper node determining unit is connected with the problem node determining unit and is used for determining an upper node for transmitting data to the problem node;
and the channel deleting unit is connected with the upper node determining unit and used for deleting the data transmission channel between the upper node and the problem node in the directed acyclic graph.
According to a third aspect of the disclosed embodiments of the present invention, there is provided an electronic device including a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory complete communication with each other through the communication bus;
a memory for storing instructions executable by the processor;
and a processor, configured to implement the steps of the method according to the first aspect of the disclosed embodiment of the invention when executing the instructions stored in the memory.
In summary, the present disclosure relates to a data transmission method and apparatus based on a directed acyclic graph, and an electronic device, where the method includes: determining a starting node, a terminating node and a first arrival path in the directed acyclic graph according to the data transmission instruction; transmitting the data to be transmitted along the first arrival path; if feedback information of unreceived data sent by a problem node is received, determining a superior node for sending data to the problem node and deleting a data transmission channel between the superior node and the problem node; and repeatedly executing the steps until the termination node receives the data so as to complete the data transmission process indicated in the data transmission instruction. The method can form a complete set of abnormal detection, abnormal node determination and an abnormal solving complete mechanism by determining the first arrival path of data in the directed acyclic graph structure and adjusting the first arrival path in real time according to whether the data is transmitted to each node or not, thereby improving the data transmission efficiency.
Additional features and advantages of the present disclosure will be set forth in the detailed description which follows.
Drawings
The accompanying drawings are included to provide a further understanding of the disclosure, and are incorporated in and constitute a part of this specification, illustrate the disclosure and together with the description serve to explain, but do not limit the disclosure. In the drawings:
FIG. 1 is a flow chart illustrating a method of directed acyclic graph-based data transmission according to an exemplary embodiment;
FIG. 2 is a schematic diagram of a directed acyclic graph structure according to an example embodiment;
FIG. 3 is a flow chart of a method of determining a shortest path according to the one shown in FIG. 1;
FIG. 4 is a flow chart diagram of a fault feedback method according to the one shown in FIG. 1;
FIG. 5 is a block diagram illustrating a data transmission apparatus based on a directed acyclic graph according to an exemplary embodiment;
FIG. 6 is a block diagram of a path determination module according to the one shown in FIG. 5;
FIG. 7 is a block diagram of a fault feedback module according to the one shown in FIG. 5;
fig. 8 is a schematic diagram of an electronic device according to an exemplary embodiment.
Detailed Description
The following describes in detail the embodiments of the present disclosure with reference to the drawings. It should be understood that the detailed description and specific examples, while indicating and illustrating the disclosure, are not intended to limit the disclosure.
Fig. 1 is a flowchart illustrating a data transmission method based on a directed acyclic graph according to an exemplary embodiment, where the directed acyclic graph includes a plurality of nodes, such as a control terminal node, a switch node, an upper computer node, a transmitting card node, and a receiving card node, which are arranged and connected according to a preset rule, so as to implement transmission of data to be transmitted along the nodes in the directed acyclic graph. Under the general condition, all control terminal nodes belong to the same level, all switch nodes belong to the same level, all upper computer nodes belong to the same level, all sending card nodes belong to the same level, all receiving card nodes belong to the same level, data to be transmitted starts from the control terminal nodes, and the path switch nodes, the upper computer nodes and the sending card nodes are finally transmitted to the receiving card nodes and displayed on the corresponding LED display modules. As shown in fig. 2, a schematic structural diagram of a directed acyclic graph is provided, each control terminal node is connected to each switch node, each switch node is connected to each upper computer node, each upper computer node is connected to each sending card node, each sending card node is connected to each receiving card node, priorities of each node in the same level node are different (the priority of each node is usually preset), when a path is determined to arrive first, a node with the highest priority in each level node is usually started first, when the node with the highest priority fails, the nodes with lower priority are started in turn, until data to be transmitted is sent to a termination node capable of receiving the data. As shown in fig. 1, the method includes:
in step 101, a start node and a stop node are determined in the directed acyclic graph according to received data transfer instructions.
For example, the data transmission instruction generally includes data to be transmitted, and a start position (start node) and an end position (end node) to which the data to be transmitted is to be transmitted in the directed acyclic graph. The control terminal node is usually used as a starting position, and the receiving card node is used as a terminating position, for example, in the directed acyclic graph shown in fig. 2, a target control terminal node is determined as a starting node according to the data transmission instruction, and a target receiving card node is determined as a terminating node. The data to be transmitted is transmitted from the starting node, along the first arrival path between the starting node and the ending node and through each node (generally including a switch node, an upper computer node and a sending card node).
In addition, in the disclosed embodiment of the present invention, when determining the start node according to the data transmission instruction, the control terminal node with the highest priority is generally selected from all the control terminal nodes in fig. 2, and if the control terminal node with the highest priority does not have a fault, the control terminal node with the highest priority is used as the target control terminal node (i.e., the start node). If the control terminal node with the highest priority fails, deleting the control terminal node, sequentially searching the control terminal nodes with lower priority, detecting whether the control terminal node fails, deleting each control terminal node with the detected failure, and selecting the control terminal node with the highest priority from all the remaining control terminal nodes without the failure as a target control terminal node (namely, a starting node).
It should be noted that, in the embodiment of the present disclosure, information interaction may be performed between each control terminal node. For example, the directed acyclic graph includes a control terminal node 1, a control terminal node 2, a control terminal node 3, … …, and a control terminal node n, where the priority of each control terminal node decreases sequentially from 1 to n (i.e., the priority of the control terminal node 1 is highest and the priority of the control terminal node n is lowest), after the control terminal node 1 with the highest priority is determined according to the data transmission instruction, it is found that the control terminal node 1 fails, other control terminal nodes receive failure information of the control terminal node 1 (normally, when the other control terminal nodes do not receive heartbeat time data sent by the control terminal node 1 at regular time, this indicates that the control terminal node 1 fails), and other nodes sequentially initiate an election to replace the control terminal node 1 to perform data transmission according to the priority. If the control terminal 2 fails, the control terminal 2 is regarded as a target control terminal node, if the control terminal node 2 fails, the control terminal node 2 is deleted, whether other control terminal nodes fail or not is checked according to priority in sequence, the failed control terminal node is deleted, and the control terminal node with the highest priority is determined as the target control terminal node (namely, the starting node) in the rest control terminal nodes.
In step 102, a first arrival path between the originating node and the terminating node is determined.
The first arrival path is an exemplary data transmission path with highest priority and no failure of all intermediate nodes of the start node and the end node, and the first arrival path is determined and the data to be transmitted is transmitted along the first arrival path. For example, in the schematic diagram of the directed acyclic graph shown in fig. 2, after a control terminal node is determined as a start node, a target switch node with the highest priority is selected from all switch nodes connected to the start node, a target upper computer node with the highest priority is selected from all upper computer nodes connected to the target switch node, a target sending card node with the highest priority is selected from all sending card nodes connected to the target upper computer node, and data to be transmitted is transmitted along the fastest transmission path of the start node-target switch node-target upper computer node-target sending card node-termination node. If a node fails in the data transmission process, the node with the same level and lower priority than the node replaces the failed node to perform data transmission work. For example, in the path of the first arrival of the start node, the target switch node, the target upper computer node, the target transmitting card node and the end node, if the target upper computer node fails and cannot work normally, another upper computer node with priority level next to that of the target upper computer node is selected from the upper computer nodes connected with the target switch node and the target transmitting card node, so that the data transmission work is performed instead of the failed target upper computer node (that is, the upper computer node performing the data transmission work is used as the new target upper computer node).
In step 103, data to be transmitted is transmitted along the first arrival path from the start node.
For example, after determining the first arrival path in step 102, the data to be transmitted starts to be transmitted along the first arrival path along the start node, if the data to be transmitted is transmitted to the end node, it is indicated that there is no problem node in the first arrival path, if the data to be transmitted fails to be transmitted to the end node, it is indicated that there is a problem node in the first arrival path, and at this time, the data transmission channel between the problem node and the upper node is deleted and the first arrival path is redetermined in steps 103-105, so as to ensure normal transmission of the data to be transmitted.
In step 104, if feedback information of unreceived data sent by the problem node in the first arrival path is received, determining an upper node sending data to the problem node in the directed acyclic graph, and deleting a data transmission channel between the upper node and the problem node.
By way of example, the starting node determined according to the data transmission instruction, that is, the server in the embodiment of the present invention, each node in the directed acyclic graph is connected to the server (i.e., the target control terminal node), so that whether data is received can be fed back to the server in real time, so that the server can determine whether a problem node exists in the first-arriving path according to the feedback of the node, and adjust the intermediate node in the first-arriving path at any time (i.e., enable the intermediate node with lower priority and no fault to replace the node with higher priority but fault). For example, as shown in the directed acyclic graph in fig. 2, if the server receives feedback information of the data which is not received and is fed back by the node of the sending card, it indicates that the node of the previous stage that sends the data to the sending card has a fault, that is, the node of the upper computer. At this time, the transmitting card node in the first arrival path is determined as a problem node and the data transmission channel between the host computer node and the transmitting card node is deleted.
As shown in fig. 2, in the directed acyclic graph, the host node and the sending card node are in communication connection through USB/HDMI/DVI, where the USB communication connection is used for the host node to issue a control command, and is a bidirectional channel, and the HDMI or DVI communication connection is used for the host node to issue image data, and is a unidirectional channel, and when the sending card node does not receive data through the HDMI or DVI communication connection, the host node and the server can be notified through the USB communication channel, and at this time, the problem that the channel break occurs in the data transmission channel can be confirmed. In addition, the control terminal node, the switch node, the transmitting card node and the receiving card node in fig. 2 are connected by a network cable.
In step 105, the steps from the determination of the first arrival path between the start node and the end node to the determination of the superior node in the directed acyclic graph that sent data to the problem node, and the deletion of the data transmission path between the superior node and the problem node are repeated until the end node receives the data to complete the data transmission process indicated in the data transmission instruction.
For example, after determining the first arrival path, transmitting the data to be transmitted along the first arrival path, monitoring whether a node in the first arrival path has a fault at any time in the transmission process, and after removing the fault, re-determining the first arrival path until the data to be transmitted is sent to the receiving card node.
Fig. 3 is a flowchart of a method for determining a shortest path according to the method shown in fig. 1, and as shown in fig. 3, the step 102 includes:
in step 1021, all nodes in the directed acyclic graph structure are traversed by a depth-optimized search algorithm, all intermediate nodes between the start node and the end node are determined, and a preset priority level of each intermediate node in a hierarchy to which the intermediate node belongs is determined.
In step 1022, a first arrival path between the start node and the end node is determined, where the first arrival path includes the start node, the end node, and an intermediate node with a highest priority in each hierarchy.
By way of example, the depth-optimized search algorithm is a method of traversing all nodes in the directed acyclic graph to determine a first-arrival path, by which all intermediate nodes between a start node and a stop node and all transmission paths can be determined to determine a first-arrival path composed of intermediate nodes having highest priorities among the above-described all transmission paths.
Fig. 4 is a flowchart of a fault feedback method according to the one shown in fig. 1, and as shown in fig. 4, the step 104 includes:
in step 1041, if feedback information sent by a node in the first arrival path is received during the process of transmitting data along the first arrival path, the node that sends the feedback information is determined as a problem node.
In step 1042, a superior node that sends data to the problem node is determined.
In step 1043, the data transmission path between the superordinate node and the problem node is deleted in the directed acyclic graph.
In the directed acyclic graph structure, a data transmission channel is formed between every two nodes, as shown in fig. 2, a data transmission channel is formed between a control terminal node and a switch node, a data transmission channel is formed between the switch node and an upper computer node, a data transmission channel is formed between the upper computer node and a transmitting card node, and a data transmission channel is formed between the transmitting card node and a receiving card node. After determining the failed problem node, the data transmission channel between the failed problem node and the upper node sending data to the failed problem node is the failed transmission channel, and the failed data transmission channel is deleted. For example, as shown in fig. 2, if a path from a start node (control terminal node), a switch node, an upper computer node, a sending card node, and a terminating node (receiving card node) arrives first, the upper computer node sends feedback information of unreceived data to the server, at this time, the upper computer node is a problem node, the switch node sending data to the upper computer node is an upper node, a data transmission channel between the switch node and the upper computer node is a failure data transmission channel, and the failure transmission channel between the switch node and the upper computer node is deleted. In addition, in another embodiment of the present disclosure, the failed transmission channel is deleted and the problem node (i.e., the upper computer node) is deleted.
Fig. 5 is a block diagram illustrating a structure of a directed acyclic graph-based data transmission apparatus according to an exemplary embodiment, as shown in fig. 5, a node in the directed acyclic graph includes: the apparatus 500 includes:
the node determining module 510 determines a start node and a stop node in the directed acyclic graph according to the received data transmission instruction;
a path determining module 520, connected to the node determining module 510, for determining a first arrival path between the start node and the end node;
the data transmission module 530 is connected to the path determining module 520, and transmits the data to be transmitted along the first arrival path from the start node;
the fault feedback module 540 is connected to the data transmission module 530, and if receiving the feedback information of the unreceived data sent by the problem node in the first arrival path, determines an upper node in the directed acyclic graph that sends data to the problem node, and deletes a data transmission channel between the upper node and the problem node;
and a loop execution module 550, coupled to the fault feedback module 540, for repeatedly executing steps from the determination of the first arrival path between the start node and the end node to the determination of the upper node in the directed acyclic graph that transmits data to the problem node, and deleting the data transmission path between the upper node and the problem node until the end node receives the data to complete the data transmission process indicated in the data transmission instruction.
Fig. 6 is a block diagram of a path determining module according to the one shown in fig. 5, and as shown in fig. 6, the path determining module 520 includes:
an intermediate node determining unit 521 that traverses all nodes in the directed acyclic graph structure by a depth optimization search algorithm, determines all intermediate nodes between the start node and the end node, and a priority preset in a hierarchy to which the intermediate node belongs for each intermediate node;
a first arrival path determining unit 522, connected to the intermediate node determining unit 521, determines a first arrival path between the start node and the end node, where the first arrival path includes the start node, the end node, and the intermediate node with the highest priority in each hierarchy.
Fig. 7 is a block diagram of a fault feedback module according to the one shown in fig. 5, and as shown in fig. 7, the fault feedback module 540 includes:
the problem node determining unit 541 determines, when feedback information sent by a node in the first arrival path is received during the transmission of data along the first arrival path, a node that sends the feedback information as a problem node;
a superior node determining unit 542 connected to the problem node determining unit 541, for determining a superior node that transmits data to the problem node;
and a channel deleting unit 543 connected to the upper node determining unit 542 and configured to delete the data transmission channel between the upper node and the problem node in the directed acyclic graph.
Fig. 8 is a schematic diagram of an electronic device according to an exemplary embodiment, as shown in fig. 8, including a processor 001, a communication interface 002, a memory 003, and a communication bus 004, wherein the processor 001, the communication interface 002, the memory 003 complete communication with each other through the communication bus 004,
a memory 003 for storing a computer program;
the processor 001 is configured to implement the above-mentioned data backup transmission method applied to the LED mesh loop backup system when executing the program stored in the memory 003, where the method includes:
monitoring the video data transmission condition of a current network receiving and transmitting interface used for transmitting video data in the LED box body, and obtaining the data transmission performance of the current network receiving and transmitting interface;
under the condition that the data transmission performance is not in the preset performance index range, monitoring the average data transmission performance of the current network transceiver interface in a preset duration;
selecting a target network receiving and transmitting interface from backup network receiving and transmitting interfaces under the condition that the average data transmission performance is not in the preset performance index range, wherein the backup network receiving and transmitting interfaces are network receiving and transmitting interfaces except the current network receiving and transmitting interface in the LED box body;
and switching the current network transceiving interface to the target network transceiving interface so that the LED box body transmits video data through the target network transceiving interface.
In summary, the present disclosure relates to a data transmission method and apparatus based on a directed acyclic graph, and an electronic device, where the method includes: determining a starting node, a terminating node and a first arrival path in the directed acyclic graph according to the data transmission instruction; transmitting the data to be transmitted along the first arrival path; if feedback information of unreceived data sent by a problem node is received, determining a superior node for sending data to the problem node and deleting a data transmission channel between the superior node and the problem node; and repeatedly executing the steps until the termination node receives the data so as to complete the data transmission process indicated in the data transmission instruction. The method can form a complete set of abnormal detection, abnormal node determination and an abnormal solving complete mechanism by determining the first arrival path of data in the directed acyclic graph structure and adjusting the first arrival path in real time according to whether the data is transmitted to each node or not, thereby improving the data transmission efficiency.
The preferred embodiments of the present disclosure have been described in detail above with reference to the accompanying drawings, but the present disclosure is not limited to the specific details of the above embodiments, and various simple modifications may be made to the technical solutions of the present disclosure within the scope of the technical concept of the present disclosure, and all the simple modifications belong to the protection scope of the present disclosure.
In addition, the specific features described in the foregoing embodiments may be combined in any suitable manner, and in order to avoid unnecessary repetition, the present disclosure does not further describe various possible combinations.
Moreover, any combination between the various embodiments of the present disclosure is possible as long as it does not depart from the spirit of the present disclosure, which should also be construed as the disclosure of the present disclosure.
Claims (8)
1. A data transmission method based on a directed acyclic graph, wherein nodes in the directed acyclic graph comprise: the method comprises the steps of controlling terminal nodes, exchanger nodes, upper computer nodes, sending card nodes and receiving card nodes, wherein the controlling terminal nodes belong to the same level, the exchanger nodes belong to the same level, the upper computer nodes belong to the same level, the sending card nodes belong to the same level, the receiving card nodes belong to the same level, the priorities of each node in the same level are different, data to be transmitted are triggered from the controlling terminal nodes, and are transmitted to the receiving card nodes by the exchanger nodes, the upper computer nodes and the sending card nodes, and the method comprises the following steps:
determining a starting node and a terminating node in the directed acyclic graph according to the received data transmission instruction;
determining a first arrival path between the start node and the end node;
transmitting data to be transmitted from the initial node along the first arrival path, wherein the first arrival path comprises the initial node, the termination node and the intermediate node with highest priority and no fault in each level;
if feedback information of unreceived data sent by a problem node in the first arrival path is received, determining an upper node which sends data to the problem node in the directed acyclic graph, and deleting a data transmission channel between the upper node and the problem node;
repeating the steps from the determining of the first arrival path between the starting node and the ending node to the determining of the upper node in the directed acyclic graph, which transmits data to the problem node, and deleting the data transmission channel between the upper node and the problem node until the ending node receives the data to complete the data transmission process indicated in the data transmission instruction;
if feedback information of unreceived data sent by a problem node in the first arrival path is received, determining an upper node sending data to the problem node in the directed acyclic graph, and deleting a data transmission channel between the upper node and the problem node, including: in the process of transmitting data along the first arrival path, if feedback information sent by a node in the first arrival path is received, determining the node sending the feedback information as a problem node; determining a superior node which transmits data to the problem node; and deleting the data transmission channel between the superior node and the problem node in the directed acyclic graph.
2. The data transmission method according to claim 1, wherein the determining the start node and the end node in the directed acyclic graph according to the received data transmission instruction comprises:
acquiring the data transmission instruction, wherein the data transmission instruction comprises data to be transmitted;
determining a target control terminal node as an initial node in the directed acyclic graph according to the data transmission instruction;
and determining a target receiving card node as a termination node in the directed acyclic graph according to the data transmission instruction.
3. The method according to claim 2, wherein the determining a target control terminal node as a start node in the directed acyclic graph according to the data transmission instruction includes:
determining whether a control terminal node with the highest priority in the directed acyclic graph has a fault or not;
if the control terminal node with the highest priority has no fault, taking the control terminal node with the highest priority as a target control terminal node;
if the control terminal node with the highest priority fails, deleting the control terminal node with the highest priority in the directed acyclic graph;
repeating the steps from determining whether the control terminal node with the highest priority in the directed acyclic graph fails to determining that the control terminal node with the highest priority does not fail, taking the control terminal node with the highest priority as a target control terminal node or determining that the control terminal node with the highest priority fails, and deleting the control terminal node with the highest priority in the directed acyclic graph until the target control terminal node is determined;
and taking the target control terminal node as the starting node.
4. The data transmission method according to claim 1, wherein the determining the first arrival path between the start node and the end node includes:
traversing all nodes in the directed acyclic graph structure through a depth optimization search algorithm, and determining all intermediate nodes between the starting node and the ending node and the preset priority of each intermediate node in a hierarchy to which the intermediate node belongs;
a first arrival path between the originating node and a terminating node is determined.
5. The data transmission method according to claim 1, characterized in that the method further comprises:
the problem node is deleted in the directed acyclic graph.
6. A directed acyclic graph-based data transmission device, wherein nodes in the directed acyclic graph comprise: the device comprises a control terminal node, a switch node, an upper computer node, a sending card node and a receiving card node, wherein the control terminal node belongs to the same level, the switch node belongs to the same level, the upper computer node belongs to the same level, the sending card node belongs to the same level, the receiving card node belongs to the same level, the priority of each node in the same level is different, data to be transmitted is triggered from the control terminal node, and the data is transmitted to the receiving card node by the switch node, the upper computer node and the sending card node, wherein the device comprises:
the node determining module is used for determining a starting node and a termination node in the directed acyclic graph according to the received data transmission instruction;
the path determining module is connected with the node determining module and is used for determining a first arrival path between the starting node and the ending node, wherein the first arrival path comprises the starting node, the ending node and an intermediate node which has highest priority and does not have faults in each level;
the data transmission module is connected with the path determination module and is used for transmitting the data to be transmitted along the first arrival path from the initial node;
the fault feedback module is connected with the data transmission module, and if receiving feedback information of unreceived data sent by a problem node in the first arrival path, the fault feedback module determines a superior node which sends data to the problem node in the directed acyclic graph, and deletes a data transmission channel between the superior node and the problem node;
the loop execution module is connected with the fault feedback module and repeatedly executes the steps from the first arrival path between the initial node and the termination node to the upper node which determines the data to be sent to the problem node in the directed acyclic graph, and deletes the data transmission channel between the upper node and the problem node until the termination node receives the data to complete the data transmission process indicated in the data transmission instruction;
the fault feedback module comprises: the problem node determining unit is used for determining a node for transmitting feedback information as a problem node if receiving the feedback information transmitted by the node in the first arrival path in the process of transmitting the data along the first arrival path; the upper node determining unit is connected with the problem node determining unit and is used for determining an upper node for transmitting data to the problem node; and the channel deleting unit is connected with the upper node determining unit and used for deleting the data transmission channel between the upper node and the problem node in the directed acyclic graph.
7. The data transmission apparatus of claim 6, wherein the path determination module comprises:
an intermediate node determining unit, configured to traverse all nodes in the directed acyclic graph structure by using a depth optimization search algorithm, determine all intermediate nodes between the start node and the end node, and preset priorities of each intermediate node in a hierarchy to which the intermediate node belongs;
and the first arrival path determining unit is connected with the intermediate node determining unit and is used for determining the first arrival path between the starting node and the ending node.
8. The electronic equipment is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus;
a memory for storing instructions executable by the processor;
a processor for implementing the steps of the method of any one of claims 1-5 when executing instructions stored on a memory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111435445.9A CN114124790B (en) | 2021-11-29 | 2021-11-29 | Data transmission method and device based on directed acyclic graph and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111435445.9A CN114124790B (en) | 2021-11-29 | 2021-11-29 | Data transmission method and device based on directed acyclic graph and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114124790A CN114124790A (en) | 2022-03-01 |
| CN114124790B true CN114124790B (en) | 2023-08-01 |
Family
ID=80371418
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111435445.9A Active CN114124790B (en) | 2021-11-29 | 2021-11-29 | Data transmission method and device based on directed acyclic graph and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114124790B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105515977A (en) * | 2015-12-21 | 2016-04-20 | 腾讯科技（深圳）有限公司 | Method, device and system for obtaining transmission path in network |
| CN113159457A (en) * | 2021-05-19 | 2021-07-23 | 北京邮电大学 | Intelligent path planning method and system and electronic equipment |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109347687B (en) * | 2018-11-23 | 2021-10-29 | 四川通信科研规划设计有限责任公司 | Communication system and method based on network node fault positioning |
| CN112511340A (en) * | 2020-11-11 | 2021-03-16 | 平安科技（深圳）有限公司 | Data transmission method and device, electronic equipment and storage medium |
-
2021
- 2021-11-29 CN CN202111435445.9A patent/CN114124790B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105515977A (en) * | 2015-12-21 | 2016-04-20 | 腾讯科技（深圳）有限公司 | Method, device and system for obtaining transmission path in network |
| CN113159457A (en) * | 2021-05-19 | 2021-07-23 | 北京邮电大学 | Intelligent path planning method and system and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114124790A (en) | 2022-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20210408817A1 (en) | Battery management system, and method and apparatus for transmitting information | |
| EP2701331B1 (en) | Method for processing packet when server fails and router thereof | |
| CN102006188B (en) | Path back switching method and device in transport network | |
| CN101951345B (en) | Message transmitting method and equipment | |
| CN106817301A (en) | Fault recovery method and device, controller, software defined network | |
| KR20150086649A (en) | Apparatus and method for distribution processing of data, storage server | |
| US10831630B2 (en) | Fault analysis method and apparatus based on data center | |
| CN112787960B (en) | Stack splitting processing method, device and equipment and storage medium | |
| CN110943878A (en) | Heartbeat packet transmission method, terminal and device with storage function | |
| CN106453074A (en) | Switching method and apparatus | |
| CN114124790B (en) | Data transmission method and device based on directed acyclic graph and electronic equipment | |
| CN110661599B (en) | HA implementation method, device and storage medium between main node and standby node | |
| CN112217718A (en) | Service processing method, device, equipment and storage medium | |
| CN102136936B (en) | Method, node and system for preventing control plane faults from influencing operation of forward data plane | |
| CN114567536B (en) | Abnormal data processing method, device, electronic equipment and storage medium | |
| CN114884767B (en) | Synchronous dual-redundancy CAN bus communication system, method, equipment and medium | |
| CN111224756A (en) | Method and device for determining data transmission abnormity, storage medium and electronic equipment | |
| CN113098709B (en) | Network recovery method and device based on distributed networking system and computer equipment | |
| CN115152192B (en) | PCE controlled network reliability | |
| CN113194498A (en) | Communication detection method and device | |
| CN112422428A (en) | Link state acquisition method and device, electronic equipment and readable storage medium | |
| CN114500157B (en) | Redundancy implementation system based on CAN gateway, electronic device and computer readable storage medium | |
| CN110690998B (en) | Master-slave equipment management method based on BMC | |
| EP3200403A1 (en) | Packet forwarding method and device, sdn and system | |
| CN117221090A (en) | Path fault isolation processing method and device for multipath software |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |