CN114124790A - 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
- CN114124790A CN114124790A CN202111435445.9A CN202111435445A CN114124790A CN 114124790 A CN114124790 A CN 114124790A CN 202111435445 A CN202111435445 A CN 202111435445A CN 114124790 A CN114124790 A CN 114124790A
- Authority
- CN
- China
- Prior art keywords
- node
- data transmission
- determining
- directed acyclic
- acyclic graph
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/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, a device and electronic equipment based on a directed acyclic graph, 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 data to be transmitted along the first arrival path; if feedback information of unreceived data sent by the problem node is received, determining a superior node sending data to the problem node and deleting a data transmission channel between the superior node and the problem node; and repeating the steps until the termination node receives the data so as to complete the data transmission process indicated in the data transmission instruction. The first arriving path of the data can be determined in the directed acyclic graph structure, and the first arriving path can be adjusted in real time according to whether the data is transmitted to each node, so that a complete mechanism for complete anomaly detection, abnormal node determination and anomaly resolution is formed, and the data transmission efficiency is improved.
Description
Technical Field
The invention relates to 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 cascaded 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 and displayed on the LED boxes, so that the large screen can display the video data to be displayed.
However, the last-stage cascade unit of the current receiving card may further include a sending card, a terminal where an upper computer is located, a switch, and a control terminal, and when a terminal device fails to work normally, the display of video data in a large screen is directly affected. Therefore, a new technical solution to solve the above problems needs to be found by those skilled in the art.
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 embodiments disclosed in the present invention, there is provided a data transmission method based on a directed acyclic graph, where a node in the directed acyclic graph includes: the method comprises the following steps of controlling a terminal node, a switch node, an upper computer node, a sending card node and a receiving card node, wherein 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-to-reach path between the originating node and a terminating node;
transmitting data to be transmitted from the starting node along the first arrival path;
if feedback information of unreceived data sent by the problem node in the first arrival path is received, determining a superior node which sends data to the problem node in the directed acyclic graph, and deleting a data transmission channel between the superior node and the problem node;
and repeatedly executing the steps from the determined first arrival path between the starting node and the terminating node to the determined superior node which sends data to the problem node in the directed acyclic graph, and deleting the data transmission channel between the superior node and the problem node until the terminating 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 in the directed acyclic graph as an initial node includes:
determining whether the control terminal node with the highest priority in the directed acyclic graph fails;
if the control terminal node with the highest priority does not have a 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;
repeatedly executing the step of taking the control terminal node with the highest priority as a target control terminal node from the step of determining whether the control terminal node with the highest priority in the directed acyclic graph fails to the step of taking the control terminal node with the highest priority as the target control terminal node if the control terminal node with the highest priority does not fail, or the step of 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 a 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 terminating node and the priority preset by each intermediate node in the hierarchy to which the intermediate node belongs;
determining a first arrival path between the start node and the end node, the first arrival path including the start node, the end node and the intermediate node with the highest priority in each level.
Optionally, if feedback information of unreceived data sent by the problem node in the first-arrival path is received, determining a superior node in the directed acyclic graph that sends data to the problem node, and deleting a data transmission channel between the superior node and the problem node, includes:
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 sends data to the problem node;
and deleting a data transmission channel between the superior node and the problem node in the directed acyclic graph.
Optionally, the method further includes:
and deleting the problem node in the directed acyclic graph.
According to a second aspect of the disclosed embodiments of the present invention, there is provided a data transmission apparatus based on a directed acyclic graph, where a node in the directed acyclic graph includes: control terminal node, switch node, host computer node, sending card node and receiving card node, the device includes:
the node determining module is used for determining a starting node and a terminating 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 arriving path between the starting node and the terminating node;
the data transmission module is connected with the path determination module and transmits the data to be transmitted from the starting node along the first arrival path;
the fault feedback module is connected with the data transmission module, and if feedback information that data is not received and sent by the problem node in the first-arriving path is received, a superior node which sends data to the problem node in the directed acyclic graph is determined, and a data transmission channel between the superior node and the problem node is deleted;
and the cyclic execution module is connected with the fault feedback module, and is used for repeatedly executing the steps of determining the first arrival path between the starting node and the terminating node to the superior node which determines the directed acyclic graph and sends data to the problem node, and deleting the data transmission channel between the superior node and the problem node until the terminating node receives the data to complete the data transmission process indicated in the data transmission instruction.
Optionally, the path determining module includes:
the intermediate node determining unit is used for traversing all nodes in the directed acyclic graph structure through a depth optimization search algorithm, determining all intermediate nodes between the starting node and the ending node and the priority preset by each intermediate node in the hierarchy to which the intermediate node belongs;
and the first arriving path determining unit is connected with the intermediate node determining unit and is used for determining the first arriving path between the starting node and the terminating node, wherein the first arriving path comprises the starting node, the terminating 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 which sends feedback information as a problem node if the feedback information sent by the node in the first arrival path is received in the process of transmitting data along the first arrival path;
the superior node determining unit is connected with the problem node determining unit and determines superior nodes for sending data to the problem node;
and the channel deleting unit is connected with the superior node determining unit and deletes the data transmission channel between the superior 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, comprising 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 processor-executable instructions;
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 method, an apparatus, and an electronic device for data transmission based on a directed acyclic graph, 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 data to be transmitted along the first arrival path; if feedback information of unreceived data sent by the problem node is received, determining a superior node sending data to the problem node and deleting a data transmission channel between the superior node and the problem node; and repeating the steps until the termination node receives the data so as to complete the data transmission process indicated in the data transmission instruction. The first arriving path of the data can be determined in the directed acyclic graph structure, and the first arriving path can be adjusted in real time according to whether the data is transmitted to each node, so that a complete mechanism for complete anomaly detection, abnormal node determination and anomaly resolution is formed, and the data transmission efficiency is improved.
Additional features and advantages of the present disclosure will be set forth in the detailed description which follows.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain the disclosure without limiting the disclosure. In the drawings:
FIG. 1 is a flow diagram illustrating a method for data transmission based on a directed acyclic graph in accordance with an example embodiment;
FIG. 2 is a schematic diagram illustrating a directed acyclic graph structure, according to an example embodiment;
fig. 3 is a flow chart of a shortest path determination method according to fig. 1;
FIG. 4 is a flow chart of a fault feedback method according to that shown in FIG. 1;
FIG. 5 is a block diagram illustrating an architecture of a data transfer device based on a directed acyclic graph, according to an example 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 structural diagram of an electronic device according to an exemplary embodiment.
Detailed Description
The following detailed description of the disclosed embodiments will be made in conjunction with the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating the present disclosure, are given by way of illustration and explanation only, not limitation.
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 sending card node, and a receiving card node, and the nodes are arranged and connected according to a preset rule to implement transmission of data to be transmitted along the nodes in the directed acyclic graph. Under the normal 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 are transmitted to the receiving card nodes from the control terminal nodes and 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, where 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, each node in the same level of nodes has different priorities (the priority of each node is usually preset), a node with the highest priority in each level of nodes is usually started when a path that is reached first is determined, and when a node with the highest priority fails, nodes with lower priorities are started in sequence until data to be transmitted is sent to a terminating node capable of receiving 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 the received data transmission instruction.
For example, the data transmission instruction generally includes data to be transmitted, and a starting position (a starting node) and an ending position (a terminating node) to which the data to be transmitted needs to be transmitted when the data to be transmitted is transmitted in the directed acyclic graph. Generally, the control terminal node is used as a start position, and the card receiving node is used as an end position, for example, in the directed acyclic graph shown in fig. 2, a target control terminal node is determined as the start node according to the data transmission instruction, and a target card receiving node is determined as the end node. The data to be transmitted is transmitted from the starting node along the first arriving path between the starting node and the terminating node and through each node (generally comprising a switch node, an upper computer node and a sending card node).
In addition, in the embodiments of the present disclosure, when determining the start node according to the data transmission instruction, the control end node with the highest priority is generally selected first from all the control end nodes in fig. 2, and if the control end node with the highest priority has no fault, the control end node with the highest priority is taken as the target control end node (that is, the start node). If the control terminal node with the highest priority fails, deleting the control terminal node, sequentially searching for the control terminal nodes with lower priorities and detecting whether the control terminal node fails, and after deleting each control terminal node with the detected failure, 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, an initial node).
It should be noted that, in the embodiments disclosed in the present invention, 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 is sequentially reduced from 1 to n (that is, the priority of the control terminal node 1 is the highest, and the priority of the control terminal node n is the lowest), when 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, and other control terminal nodes receive failure information that the control terminal node 1 fails (in a general case, when other control terminal nodes do not receive heartbeat time data sent by the control terminal node 1 at regular time, it is indicated that the control terminal node 1 fails), and the other nodes sequentially initiate election to replace the control terminal node 1 to perform data transmission work according to the priority. If the control terminal 2 does not have a fault, the control terminal 2 is used as a target control terminal node, if the control terminal node 2 has a fault, the control terminal node 2 is deleted, whether other control terminal nodes have faults or not is sequentially checked according to the priority, the control terminal node with the fault is deleted, and the control terminal node with the highest priority is determined as the target control terminal node (namely, the initial node) in the rest of the control terminal nodes.
In step 102, the first-to-reach path between the originating node and the terminating node is determined.
Illustratively, the first-arriving path refers to a data transmission path with highest priority and no fault of all intermediate nodes of the starting node and the terminating node, and the first-arriving path is determined and data to be transmitted is transmitted along the first-arriving path. For example, as shown in the structural schematic diagram of the directed acyclic graph shown in fig. 2, after a control terminal node is determined as an initial node, a target switch node with the highest priority is selected from all switch nodes connected to the initial 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 initial node, the target switch node, the target upper computer node, the target sending card node, and the termination node. If a certain node fails in the data transmission process, the same-level node with the priority lower than that of the node replaces the failed node to perform data transmission. For example, in the first arrival path of the start node, the target switch node, the target upper computer node, the target sending card node and the end node, if the target upper computer node fails to work normally, another upper computer node with the priority next to the target upper computer node is selected from the upper computer nodes connected with the target switch node and the target sending card node, so that the another upper computer node replaces the failed target upper computer node to perform data transmission work (that is, the upper computer node performing the data transmission work is used as a new target upper computer node).
In step 103, data to be transmitted is transmitted along the first-to-reach path from the start node.
For example, after the first arrival path is determined 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 is not 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 re-determined in step 103 and 105, so as to ensure that the data to be transmitted is normally transmitted.
In step 104, if feedback information that data is not received and sent by the problem node in the first-arrival path is received, a superior node that sends data to the problem node in the directed acyclic graph is determined, and a data transmission channel between the superior node and the problem node is deleted.
Illustratively, each node in the directed acyclic graph is connected to the server (i.e., a target control terminal node), and whether data is received or not can be fed back to the server in real time, so that the server can determine whether a node in the path that is the first to arrive has a problem according to the feedback of the node, and adjust an intermediate node in the path that is the first to arrive at any time (i.e., start an intermediate node with a lower priority and without a fault to replace a node with a higher priority but with a fault). For example, as shown in fig. 2, if the server receives feedback information of unreceived data fed back by the sending card node, it indicates that the upper node that sends data to the sending card has a fault, that is, the upper node. At this time, the sending card node in the first arrival path is determined as a problem node, and a data transmission channel between the upper computer node and the sending card node is deleted.
For example, as shown in fig. 2, in the directed acyclic graph, the upper computer node and the sending card node are in communication connection through USB/HDMI/DVI, where the USB communication connection is used for the upper computer node to issue a control command and is a bidirectional channel, and the HDMI or DVI communication connection is used for the upper computer node to issue image data and is a unidirectional channel. In addition, the control terminal node, the switch node, the sending card node, and the receiving card node in fig. 2 are connected by a network cable.
In step 105, the steps from determining the first arrival path between the start node and the end node to determining the upper node in the directed acyclic graph that sends data to the problem node and deleting the data transmission channel between the upper node and the problem node are repeatedly executed until the end node receives the data to complete the data transmission process indicated in the data transmission instruction.
In an example, after determining that the first arrival path is reached, data to be transmitted is transmitted along the first arrival path, whether a node in the first arrival path fails or not is monitored at any time in the transmission process, and after the failure is eliminated, the first arrival path is determined again until the data to be transmitted is sent to the receiving card node.
Fig. 3 is a flowchart of a shortest path determining method according to fig. 1, and as shown in fig. 3, the step 102 includes:
in step 1021, traversing all nodes in the directed acyclic graph structure through a depth-optimized search algorithm, determining all intermediate nodes between the start node and the end node, and a priority preset by each intermediate node in a hierarchy to which the intermediate node belongs.
In step 1022, a first arrival path between the start node and the end node is determined, the first arrival path including the start node, the end node, and the intermediate node with the highest priority in each level.
Illustratively, the depth-optimized search algorithm is a method for traversing all nodes in the directed acyclic graph to determine a first-arriving path, and all intermediate nodes between the start node and the end node and all transmission paths can be determined through the depth-optimized search algorithm to determine the first-arriving path composed of the intermediate nodes with the highest priority among the above all transmission paths.
Fig. 4 is a flow chart of a fault feedback method according to fig. 1, wherein step 104 comprises, as shown in fig. 4:
in step 1041, 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, the node sending the feedback information is determined as a problem node.
In step 1042, the superior node that sends data to the problem node is determined.
In step 1043, the data transmission path between the upper node and the problem node is deleted in the directed acyclic graph.
Illustratively, in the directed acyclic graph structure, one data transmission channel is formed between every two nodes, as shown in fig. 2, a data transmission channel is formed between the control terminal node and the switch node, a data transmission channel is formed between the switch node and the upper computer node, a data transmission channel is formed between the upper computer node and the sending card node, and a data transmission channel is formed between the sending card node and the receiving card node. And after the problem node with the fault is determined, a data transmission channel between the problem node and a superior node which sends data to the problem node is a fault transmission channel, and the data transmission channel with the fault is deleted. For example, as shown in fig. 2, if a first arrival path is formed by a start node (control terminal node), a switch node, an upper computer node, a sending card node, and a termination node (receiving card node), the upper computer node sends feedback information that data is not received to a server, the upper computer node is a problem node, the switch node that sends 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 disclosed in the present invention, the problem node (i.e., the upper computer node) is deleted while the faulty transmission channel is deleted.
Fig. 5 is a block diagram illustrating a structure of a data transmission apparatus based on a directed acyclic graph according to an exemplary embodiment, where, as shown in fig. 5, nodes in the directed acyclic graph include: control terminal node, switch node, host computer node, sending card node and receiving card node, the device 500 includes:
a node determining module 510, configured to determine 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-arriving path between the start node and the end node;
a data transmission module 530, connected to the path determination module 520, for transmitting the data to be transmitted from the start node along the first arrival path;
a failure feedback module 540, connected to the data transmission module 530, for determining a superior node in the directed acyclic graph that sends data to the problem node and deleting a data transmission channel between the superior node and the problem node if receiving feedback information that the problem node in the first arrival path sends data that is not received;
and a loop execution module 550, connected to the fault feedback module 540, for repeatedly executing the 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 sends data to the problem node, and deleting the data transmission channel 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 illustrating a structure of a path determining module according to fig. 5, where, as shown in fig. 6, the path determining module 520 includes:
an intermediate node determining unit 521, which traverses all nodes in the directed acyclic graph structure through a depth optimization search algorithm, determines all intermediate nodes between the start node and the end node, and a priority preset by each intermediate node in a hierarchy to which the intermediate node belongs;
a first arriving path determining unit 522, connected to the intermediate node determining unit 521, determines a first arriving path between the start node and the end node, where the first arriving 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 illustrating a structure of a fault feedback module according to fig. 5, and as shown in fig. 7, the fault feedback module 540 includes:
a problem node determining unit 541, configured to determine, as a problem node, a node that sends feedback information, if the feedback information sent by the node in the first arrival path is received in a process of transmitting data along the first arrival path;
a superior node determining unit 542, connected to the problem node determining unit 541, that determines a superior node that transmits data to the problem node;
and a channel deleting unit 543 connected to the upper node determining unit 542, for deleting the data transmission channel between the upper node and the problem node in the directed acyclic graph.
Fig. 8 is a schematic structural 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 communicate with each other via the communication bus 004,
a memory 003 for storing a computer program;
the processor 001 is configured to implement the data backup transmission method applied to the LED mesh loop backup system when executing the program stored in the memory 003, and the method includes:
monitoring the video data transmission condition of a current network transceiving interface which is used for transmitting video data currently in the LED box body to obtain the data transmission performance of the current network transceiving interface;
monitoring the average data transmission performance of the current network transceiving interface within a preset time length under the condition that the data transmission performance is not within a preset performance index range;
under the condition that the average data transmission performance is not within the range of the preset performance index, selecting a target network transceiving interface from backup network transceiving interfaces, wherein the backup network transceiving interface is a network transceiving interface except the current network transceiving interface in the LED box body;
and switching the current network transceiving interface into 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 method, an apparatus, and an electronic device for data transmission based on a directed acyclic graph, 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 data to be transmitted along the first arrival path; if feedback information of unreceived data sent by the problem node is received, determining a superior node sending data to the problem node and deleting a data transmission channel between the superior node and the problem node; and repeating the steps until the termination node receives the data so as to complete the data transmission process indicated in the data transmission instruction. The first arriving path of the data can be determined in the directed acyclic graph structure, and the first arriving path can be adjusted in real time according to whether the data is transmitted to each node, so that a complete mechanism for complete anomaly detection, abnormal node determination and anomaly resolution is formed, and the data transmission efficiency is improved.
The preferred embodiments of the present disclosure are described in detail with reference to the accompanying drawings, however, the present disclosure is not limited to the specific details of the above embodiments, and various simple modifications may be made to the technical solution of the present disclosure within the technical idea of the present disclosure, and these simple modifications all belong to the protection scope of the present disclosure.
It should be noted that, in the foregoing embodiments, various features described in the above embodiments may be combined in any suitable manner, and in order to avoid unnecessary repetition, various combinations that are possible in the present disclosure are not described again.
In addition, any combination of various embodiments of the present disclosure may be made, and the same should be considered as the disclosure of the present disclosure, as long as it does not depart from the spirit of the present disclosure.
Claims (10)
1. A data transmission method based on a directed acyclic graph is characterized in that nodes in the directed acyclic graph comprise: the method comprises the following steps of controlling a terminal node, a switch node, an upper computer node, a sending card node and a receiving card node, wherein 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-to-reach path between the originating node and a terminating node;
transmitting data to be transmitted from the starting node along the first arrival path;
if feedback information of unreceived data sent by the problem node in the first arrival path is received, determining a superior node which sends data to the problem node in the directed acyclic graph, and deleting a data transmission channel between the superior node and the problem node;
and repeatedly executing the steps from the determined first arrival path between the starting node and the terminating node to the determined superior node which sends data to the problem node in the directed acyclic graph, and deleting the data transmission channel between the superior node and the problem node until the terminating node receives the data to complete the data transmission process indicated in the data transmission instruction.
2. The data transmission method according to claim 1, wherein the determining a start node and a stop 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 data transmission method according to claim 2, wherein the determining a target control terminal node as an originating node in the directed acyclic graph according to the data transmission instruction comprises:
determining whether the control terminal node with the highest priority in the directed acyclic graph fails;
if the control terminal node with the highest priority does not have a 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;
repeatedly executing the step of taking the control terminal node with the highest priority as a target control terminal node from the step of determining whether the control terminal node with the highest priority in the directed acyclic graph fails to the step of taking the control terminal node with the highest priority as the target control terminal node if the control terminal node with the highest priority does not fail, or the step of 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 of claim 1, wherein the determining a first-to-arrive path between the originating node and the terminating node comprises:
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 terminating node and the priority preset by each intermediate node in the hierarchy to which the intermediate node belongs;
determining a first arrival path between the start node and the end node, the first arrival path including the start node, the end node and the intermediate node with the highest priority in each level.
5. The data transmission method according to claim 1, wherein if feedback information that no data is received and sent by a problem node in the first arrival path, determining an upper node in the directed acyclic graph that sends data to the problem node, and deleting a data transmission channel between the upper node and the problem node, includes:
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 sends data to the problem node;
and deleting a data transmission channel between the superior node and the problem node in the directed acyclic graph.
6. The data transmission method of claim 5, further comprising:
and deleting the problem node in the directed acyclic graph.
7. A data transmission apparatus based on a directed acyclic graph, wherein a node in the directed acyclic graph comprises: control terminal node, switch node, host computer node, sending card node and receiving card node, the device includes:
the node determining module is used for determining a starting node and a terminating 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 arriving path between the starting node and the terminating node;
the data transmission module is connected with the path determination module and transmits the data to be transmitted from the starting node along the first arrival path;
the fault feedback module is connected with the data transmission module, and if feedback information that data is not received and sent by the problem node in the first-arriving path is received, a superior node which sends data to the problem node in the directed acyclic graph is determined, and a data transmission channel between the superior node and the problem node is deleted;
and the cyclic execution module is connected with the fault feedback module, and is used for repeatedly executing the steps of determining the first arrival path between the starting node and the terminating node to the superior node which determines the directed acyclic graph and sends data to the problem node, and deleting the data transmission channel between the superior node and the problem node until the terminating node receives the data to complete the data transmission process indicated in the data transmission instruction.
8. The data transmission apparatus according to claim 7, wherein the path determining module comprises:
the intermediate node determining unit is used for traversing all nodes in the directed acyclic graph structure through a depth optimization search algorithm, determining all intermediate nodes between the starting node and the ending node and the priority preset by each intermediate node in the hierarchy to which the intermediate node belongs;
and the first arriving path determining unit is connected with the intermediate node determining unit and is used for determining the first arriving path between the starting node and the terminating node, wherein the first arriving path comprises the starting node, the terminating node and the intermediate node with the highest priority in each level.
9. The data transmission apparatus of claim 7, wherein the fault feedback module comprises:
the problem node determining unit is used for determining a node which sends feedback information as a problem node if the feedback information sent by the node in the first arrival path is received in the process of transmitting data along the first arrival path;
the superior node determining unit is connected with the problem node determining unit and determines superior nodes for sending data to the problem node;
and the channel deleting unit is connected with the superior node determining unit and deletes the data transmission channel between the superior node and the problem node in the directed acyclic graph.
10. An electronic device is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing mutual communication by the memory through the communication bus;
a memory for storing processor-executable instructions;
a processor for implementing the steps of the method of any one of claims 1 to 6 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 true CN114124790A (en) | 2022-03-01 |
| CN114124790B 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 (4)
| 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 |
| CN109347687A (en) * | 2018-11-23 | 2019-02-15 | 四川通信科研规划设计有限责任公司 | A kind of communication system and method based on network node failure positioning |
| CN112511340A (en) * | 2020-11-11 | 2021-03-16 | 平安科技（深圳）有限公司 | Data transmission method and device, electronic equipment and storage medium |
| CN113159457A (en) * | 2021-05-19 | 2021-07-23 | 北京邮电大学 | Intelligent path planning method and system and electronic equipment |
-
2021
- 2021-11-29 CN CN202111435445.9A patent/CN114124790B/en active Active
Patent Citations (4)
| 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 |
| CN109347687A (en) * | 2018-11-23 | 2019-02-15 | 四川通信科研规划设计有限责任公司 | A kind of communication system and method based on network node failure positioning |
| CN112511340A (en) * | 2020-11-11 | 2021-03-16 | 平安科技（深圳）有限公司 | Data transmission method and device, electronic equipment and storage medium |
| CN113159457A (en) * | 2021-05-19 | 2021-07-23 | 北京邮电大学 | Intelligent path planning method and system and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114124790B (en) | 2023-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11637440B2 (en) | Battery management system, and method and apparatus for transmitting information | |
| CN102882704B (en) | Link protection method in the soft reboot escalation process of a kind of ISSU and equipment | |
| KR101697372B1 (en) | Protection switching apparatus and method for protection switching of multiple protection group | |
| CN101951345B (en) | Message transmitting method and equipment | |
| EP1622307A1 (en) | Communication system including a temporary save server | |
| CN112787960B (en) | Stack splitting processing method, device and equipment and storage medium | |
| JPH04242463A (en) | State-change informing mechanism and method in data processing input/output system | |
| US10831630B2 (en) | Fault analysis method and apparatus based on data center | |
| CN110943878A (en) | Heartbeat packet transmission method, terminal and device with storage function | |
| JP5112246B2 (en) | Storage system and communication method | |
| RU2383067C2 (en) | Method of storing data packets using pointer technique | |
| CN111679925A (en) | Database fault processing method and device, computing equipment and storage medium | |
| CN111224756B (en) | Method and device for determining data transmission abnormity, storage medium and electronic equipment | |
| CN114124790B (en) | Data transmission method and device based on directed acyclic graph and electronic equipment | |
| MXPA02006896A (en) | Method and apparatus for providing reliable communications in an intelligent network. | |
| CN114884767B (en) | Synchronous dual-redundancy CAN bus communication system, method, equipment and medium | |
| CN110661599B (en) | HA implementation method, device and storage medium between main node and standby node | |
| CN110677316A (en) | Distributed storage server network card detection method and system | |
| CN114567536B (en) | Abnormal data processing method, device, electronic equipment and storage medium | |
| EP1793626A1 (en) | System and method for implementing service switching | |
| CN112217718A (en) | Service processing method, device, equipment and storage medium | |
| CN112231142A (en) | System backup recovery method and device, computer equipment and 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 |
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 |