WO2023287357A2 - Data transmission method, node and system - Google Patents

Data transmission method, node and system Download PDF

Info

Publication number
WO2023287357A2
WO2023287357A2 PCT/SG2022/050490 SG2022050490W WO2023287357A2 WO 2023287357 A2 WO2023287357 A2 WO 2023287357A2 SG 2022050490 W SG2022050490 W SG 2022050490W WO 2023287357 A2 WO2023287357 A2 WO 2023287357A2
Authority
WO
WIPO (PCT)
Prior art keywords
data
node
directory
file
management node
Prior art date
Application number
PCT/SG2022/050490
Other languages
French (fr)
Other versions
WO2023287357A8 (en
WO2023287357A3 (en
Inventor
Renbin WANG
Changdong CUI
Original Assignee
Envision Digital International Pte. Ltd.
Spic Envision Digital (Jiangsu) Co. Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Envision Digital International Pte. Ltd., Spic Envision Digital (Jiangsu) Co. Ltd. filed Critical Envision Digital International Pte. Ltd.
Publication of WO2023287357A2 publication Critical patent/WO2023287357A2/en
Publication of WO2023287357A3 publication Critical patent/WO2023287357A3/en
Publication of WO2023287357A8 publication Critical patent/WO2023287357A8/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/302Route determination based on requested QoS
    • H04L45/304Route determination for signalling traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416Real-time traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/14Session management
    • H04L67/141Setup of application sessions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/56Provisioning of proxy services
    • H04L67/568Storing data temporarily at an intermediate stage, e.g. caching
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00Energy efficient computing, e.g. low power processors, power management or thermal management

Definitions

  • the present disclosure relates to the field of computer communication, and particularly relates to a data transmission method, node and system.
  • a management node may send acquired data to an analysis node in real time, and the analysis node, after receiving a plurality of data sent by the management node, may analyze the plurality of data.
  • the analysis node may analyze the plurality of active powers and the plurality of pitch angles received to predict the generated power of the wind turbine generator set in a future period of time.
  • the management node detects interruption of communication with the analysis node, the management node discards the acquired data, and such a data transmission method may affect the integrity of the data received by the analysis node.
  • the embodiment of the present disclosure provides a data transmission method, node and system, which may solve the related art problem that when a management node detects interruption of communication with an analysis node, the management node discards the acquired data, thereby affecting the integrity of the data received by the analysis node.
  • the technical solution is as follows.
  • a data transmission method is provided.
  • the method is applicable to a management node and includes:
  • acquiring the real-time data from the stored data includes:
  • a plurality of files exist in the first directory; and acquiring the real-time data from the first directory includes:
  • acquiring the history data from the stored data includes:
  • acquiring the history data from the file in the second directory includes:
  • the circular queue configured to read data in the management node reads data from a corresponding file in the following manner:
  • the method further includes: [0025] in the case that the circular queue configured to read data in the management node is in an empty state, releasing a memory block corresponding to the circular queue; and [0026] deleting a file read by the circular queue.
  • a management node includes: [0028] a storage module, configured to store data acquired in real time in response to detecting interruption of communication with an analysis node;
  • an establishment module configured to establish a first channel and a second channel with the analysis node in response to detecting restoration of the communication with the analysis node;
  • a first acquisition module configured to acquire real-time data from stored data and send the real-time data to the analysis node over the first channel
  • a second acquisition module configured to acquire history data from the stored data and send the history data to the analysis node over the second channel
  • storage duration of the real-time data in the management node is less than a duration threshold, and storage duration of the history data in the management node is greater than or equal to the duration threshold.
  • a data transmission system includes: the management node as described in the second aspect and an analysis node configured to receive data transmitted by the management node.
  • a computer device in a fourth aspect, includes a processor and a memory storing therein at least one instruction, at least one program, a code set or an instruction set, wherein the at least one instruction, the at least one program, the code set or the instruction set, when loaded and executed by the processor, causes the processor to implement the data transmission method as described in the first aspect.
  • a computer-readable storage medium stores therein at least one program code, wherein the at least one program code, when loaded and executed by a processor, causes the processor to implement the data transmission method as described in the first aspect.
  • the embodiments of the present disclosure provide a data transmission method, node, and system.
  • data acquired in real time may be stored in response to detecting interruption in communication with an analysis node.
  • the real-time data whose storage duration is less than the duration threshold is sent over the first channel, and history data whose storage duration is greater than or equal to the duration threshold is sent over the second channel.
  • the integrity of the data received by the analysis node is not affected.
  • FIG. 1 is a schematic diagram of a data transmission system involved in a data transmission method according to an embodiment of the present disclosure
  • FIG. 2 is a flowchart of a data transmission method according to an embodiment of the present disclosure
  • FIG. 3 is a flowchart of another data transmission method according to an embodiment of the present disclosure.
  • Fig. 4 is a schematic diagram of a first circular queue storing data in a file form according to an embodiment of the present disclosure
  • FIG. 5 is a schematic diagram of acquiring real-time data according to an embodiment of the present disclosure.
  • Fig. 6 is a schematic diagram of acquiring history data according to an embodiment of the present disclosure.
  • Fig. 7 is a block diagram of a management node according to an embodiment of the present disclosure.
  • Fig. 8 is a block diagram of another management node according to an embodiment of the present disclosure.
  • Fig. 1 is a schematic diagram of a data transmission system involved in a data transmission method according to an embodiment of the present disclosure.
  • the data transmission system may comprise: at least one data acquisition node 10, a management node 20, and an analysis node 30.
  • Fig. 1 takes the data transmission system comprising two data acquisition nodes 10 as an example.
  • connection between the at least one data acquisition node 10 and the management node 20 and the connection between the management node 20 and the analysis node 30 may be established through a wired network or a wireless network.
  • the data acquisition node 10 may be a device capable of acquiring data, for example, a sensor provided on a wind turbine generator set.
  • the data acquisition node 10 is configured to transmit data acquired in real time to the management node 20.
  • the management node 20 may be a terminal for management personnel to operate.
  • the management node 20 may be a computer.
  • the management node 20 may uniformly manage the data acquired by the at least one data acquisition node 10, and send the data acquired by the at least one data acquisition node 10 to the analysis node 30 in the case that the analysis node 30 needs to analyze data.
  • the analysis node 30 may be a device capable of analyzing data.
  • the analysis node 30 may be a server, or a server cluster composed of several servers, or a cloud computing service center.
  • the analysis node 30 is configured to analyze the received data.
  • the analysis node 30 may analyze the plurality of active powers and the plurality of pitch angles received to predict the generated power of the wind turbine generator set in a future period of time.
  • the management node 20 may store data acquired in real time after detecting interruption of communication with the analysis node 30, and the management node 20 may establish a first channel 001 and a second channel 002 with the analysis node 30 after detecting restoration of communication with the analysis node 30. The management node 20 may then transmit the stored data to the analysis node 30 simultaneously over the first channel 001 and the second channel 002.
  • management node 20 does not discard the data acquired in real time after detecting interruption of communication with the analysis node 30, the integrity of the data ultimately received by the analysis node 30 is not affected. In addition, since the stored data is transmitted over different channels, the efficiency of transmitting data to the analysis node is improved.
  • Fig. 2 is a flowchart of a data transmission method according to an embodiment of the present disclosure. The method may be applied to the management node 20 shown in Fig. 1. As shown in Fig. 2, the method may comprise the following steps.
  • step 201 data acquired in real time is stored in response to detecting interruption of communication with an analysis node.
  • the management node may periodically detect the communication state with the analysis node.
  • the management node detects interruption of communication with the analysis node
  • the management node stores data acquired in real time.
  • the data acquired in real time is data sent by the data acquisition node to the management node in real time.
  • the management node may periodically send a heartbeat packet to the analysis node. It may be determined that communication with the analysis node is interrupted if no heartbeat response is received from the analysis node within target duration, and it may be determined that the communication with the analysis node is not interrupted if the heartbeat response is received from the analysis node within the target duration.
  • the target duration may be a fixed duration stored in advance in the management node.
  • step 202 a first channel and a second channel are established with the analysis node in response to detecting restoration of the communication with the analysis node.
  • the management node may also periodically detect whether the communication with the analysis node is restored after detecting that communication with the analysis node is interrupted.
  • the management node may establish a first channel and a second channel with the analysis node in response to detecting restoration of the communication with the analysis node.
  • the management node may periodically send a heartbeat packet to the analysis node after detecting interruption of communication with the analysis node. If the heartbeat response is received from the analysis node within the target duration, it may be determined that the communication with the analysis node is restored. The management node may then send a first channel establishment request and a second channel establishment request to the analysis node. After receiving the first channel establishment request and the second channel establishment request, the analysis node may establish a first channel and a second channel with the management node, thereby establishing the first channel and the second channel between the management node and the analysis node. If no heartbeat response is received from the analysis node within the target duration, it may be determined that the communication with the analysis node is not restored. [0062] In step 203, real-time data is acquired from stored data and the real-time data is sent to the analysis node over the first channel.
  • the management node may acquire real-time data from the stored data and send the real-time data to the analysis node over the first channel.
  • the storage duration of the real-time data in the management node is less than a duration threshold.
  • the duration threshold may be a fixed duration stored in advance in the management node.
  • the storage duration may be a duration counted from the start of storing the data, or the storage duration may be the duration from the start of storing the data to a current time, and the current time may be a time when the management node acquires the data.
  • step 204 history data is acquired from the stored data and the history data is sent to the analysis node over the second channel.
  • the management node may also acquire history data from the stored data after establishing the second channel with the analysis node and may send the history data to the analysis node over the second channel.
  • the storage duration of the history data in the management node is greater than or equal to the duration threshold.
  • the embodiment of the present disclosure provides a data transmission method.
  • data acquired in real time may be stored after detecting interruption of communication with an analysis node.
  • the real-time data whose storage duration is less than the duration threshold is sent over the first channel, and history data whose storage duration is greater than or equal to the duration threshold is sent over the second channel.
  • the integrity of the data received by the analysis node is not affected.
  • Fig. 3 is a flowchart of another data transmission method according to an embodiment of the present disclosure.
  • the method may be applied in the management node 20 and the analysis node 30 shown in Fig. 1.
  • the following embodiments are illustrated by taking an example in which data is read and written in the manner of a circular queue.
  • Each circular queue has an enqueuing end for inputting data and a dequeuing end for outputting data.
  • the enqueuing end and the dequeuing end are located at two ends of a circular queue, respectively.
  • the method may include the following steps.
  • the management node stores the data acquired in real time in response to detecting interruption of communication with the analysis node.
  • the management node may periodically detect the communication state with the analysis node. In the case that the management node detects interruption of communication with an analysis node, the management node stores data acquired in real time. The data acquired in real time is data sent by the data acquisition node to the management node in real time.
  • the management node may periodically send a heartbeat packet to the analysis node.
  • the management node may determine that the communication with the analysis node is interrupted in response to receiving no heartbeat response from the analysis node within the target duration; and may determine that communication with the analysis node is not interrupted in response to receiving the heartbeat response from the analysis node within the target duration.
  • the target duration may be a fixed duration stored in advance in the management node.
  • the management node may create a first directory configured to store files whose storage duration in the management node is less than the duration threshold.
  • the data stored in the files in the first directory may be referred to as real time data.
  • the management node may create a first circular queue upon receiving a queue creation operation.
  • a first circular queue is configured to store data acquired in real time, and store the real-time data in a file form to the first directory of the management node when the queue in a full state .
  • the queue creation operation may be a startup operation for the management node.
  • the process of storing real-time data in a file form to the first directory based on the first circular queue by the management node may comprise the following steps.
  • the management node stores a memory address corresponding to the acquired data in the first circular queue.
  • the management node may first apply for a dynamic memory (also referred to as a temporary memory) for the data and store the data in the dynamic memory. Thereafter, the management node may detect whether the first circular queue is in a full state. In the case that the first circular queue is not in a full state, the management node may store the memory address corresponding to the acquired data in the first circular queue from the enqueuing end of the first circular queue. In the case that the circular queue is in a full state, the management node may suspend the storage of memory address in the first circular queue. [0076] In A2, in the case that the management node detects that the first circular queue is in a full state, the management node may write data corresponding to the memory address stored in the first circular queue into a file in the first directory.
  • a dynamic memory also referred to as a temporary memory
  • the management node may sequentially acquire the plurality of memory addresses from the dequeuing end of the first circular queue in a first order, and acquire a plurality of data based on the plurality of memory addresses, and may sequentially store the plurality of data in the files in the first directory in the first order.
  • the first order is the order in which the plurality of memory addresses are stored in the first circular queue.
  • the file in the first directory may be a file created by the management node when data storage is required (i.e., when the first circular queue is in a full state), and may also be an empty file (i.e., a file with empty content) created in the first directory in advance.
  • the management node may compress the file to reduce the storage space, occupied by the file, of the management node.
  • the management node may empty the first circular queue.
  • the management node may repeatedly perform the aforementioned steps A 1 to A3 to continuously store data into a file based on the first circular queue.
  • step 302 the management node establishes a first channel and a second channel with the analysis node in response to detecting the restoration of communication with the analysis node.
  • the management node may also periodically detect whether the communication with the analysis node is restored after detecting that communication with the analysis node is interrupted.
  • the management node may establish a first channel and a second channel with the analysis node in response to detecting the restoration of communication with the analysis node.
  • the first channel is configured to transmit real-time data with the analysis node
  • the second channel is configured to transmit history data with the analysis node.
  • the management node may periodically send a heartbeat packet to the analysis node after detecting interruption of communication with the analysis node.
  • the management node may determine that the communication with the analysis node is restored in response to receiving the heartbeat response from the analysis node within the target duration, such that the management node may send a first channel establishment request and a second channel establishment request to the analysis node.
  • the analysis node may establish the first channel and the second channel with the management node, thereby establishing the first channel and the second channel between the management node and the analysis node.
  • the management node determines that the communication with the analysis node is not restored in response to receiving no heartbeat response from the analysis node within the target duration.
  • step 303 the management node acquires real-time data.
  • the management node may first detect whether a non-empty file exists in the first directory, and acquire the real-time data from the file in the first directory in the case that a non-empty file exists in the first directory; or acquire the real-time data based on the first circular queue in the case that no non-empty file exists in the first directory.
  • the process includes the following steps. [0088] In B 1, whether a non-empty file exists in the first directory is detected.
  • the management node may detect whether the number of files in the first directory is equal to 0. If the number of files in the first directory is not equal to 0, the management node may determine that a non-empty file exists in the first directory. If the number of files in the first directory is equal to 0, the management node may determine that no non-empty file exists in the first directory.
  • the management node may, after detecting that a non-empty file exists in the first director, acquire real-time data from the file in the first directory.
  • the management node may read the data based on the second circular queue. For example, the management node may create a second circular queue while creating the first circular queue. The length of the second circular queue is equal to the length of the first circular queue.
  • the management node may detect the number of files in the first directory after detecting that the non-empty file exists in the first directory.
  • the management node may acquire real-time data from the file based on a second circular queue.
  • the second circular queue may be configured to read the data in the file.
  • the management node may acquire real-time data from the first file in the first directory based on the second circular queue.
  • the second circular queue may be configured to read data in the first file, and the storage duration of the first file is greater than the storage duration of other files in the first directory. In this way, data in the file with longer storage duration in the first directory may be read preferentially, so as to reduce the influence of data reading on other files.
  • the second circular queue reads real-time data from a corresponding file in the following manner.
  • the management node may map the data in the file into the first memory block by using a memory mapping technique. Thereafter, the management node may sequentially store the memory addresses of the first memory block in the second circular queue in a second order, thereby acquiring the real-time data from the first memory block based on the memory address at the dequeuing end of the second circular queue.
  • the second order is the aforementioned order of mapping the data in the file into the first memory block, and the second order is the same as the first order in step 301 above.
  • the management node may directly map data in the file in the first directory to the first memory block, and acquire real-time data from the first memory block based on the memory addresses in the second circular queue, without performing an I/O operation (i.e., input/output operation) on the file to acquire the real-time data, the efficiency of acquiring the real-time data is effectively improved.
  • I/O operation i.e., input/output operation
  • the management node in the case that the management node compresses the file in the first directory, the management node, after acquiring the file in the first directory, may first decompress the file, and then read the real-time data from the file based on the second circular queue.
  • the management node may delete the memory address from the dequeuing end of the second circular queue, and move the adjacent memory address located after the memory address to the dequeuing end of the second circular queue, and repeat in this way until the number of memory addresses in the second circular queue is 0.
  • the second circular queue is in an empty state, and all the data in the first memory block corresponding to the second circular queue has been acquired.
  • the management node may, after acquiring the real-time data each time, detect whether the second circular queue is in an empty state. In the case that the second circular queue is in an empty state, the management node may release the first memory block corresponding to the second circular queue, and may delete or empty the file read by the second circular queue. In this way, occupation of the memory of the management node is effectively reduced, and the amount of data stored in the management node is reduced, thereby ensuring the running speed of the management node.
  • the management node acquires the real-time data based on the first circular queue after detecting that no non-empty file exists in the first directory.
  • the case that no non-empty file exists in the first directory includes the following two circumstances.
  • a non-empty file originally exists in the first directory, but the second circular queue has completed reading the data in the first directory, and the file read by the second circular queue is deleted or emptied.
  • the management node stores the memory address corresponding to the acquired data into the first circular queue, but the first circular queue is not in a full state, and thus no non empty file exists in the first directory.
  • the memory address corresponding to real time data may be stored in the first circular queue.
  • the management node may acquire the real-time data based on the first circular queue.
  • the management node may acquire the real-time data in the dynamic memory based on the memory address at the dequeuing end of the first circular queue.
  • step 304 the management node sends the real-time data to the analysis node over the first channel.
  • the management node may send the real-time data to the analysis node over the first channel.
  • step 305 the analysis node analyzes the acquired real-time data.
  • the analysis node may analyze the acquired real-time data after receiving the real-time data sent by the management node.
  • the analysis node can know the content of the data acquired by the data acquisition node in time, so as to know the object monitored by the data acquisition node in time.
  • the object monitored by the data acquisition node is a wind turbine generator set, and the analysis node can quickly know whether the wind turbine generator set is operating abnormally by analyzing the real-time data, and/or predict the generated power in a future period of time.
  • step 306 the management node acquires history data.
  • the management node may create a second directory configured to store files whose storage duration in the management node is greater than or equal to a duration threshold.
  • the data stored in the files in the second directory may be referred to as history data.
  • the management node may periodically detect whether the storage duration of the file is greater than or equal to the duration threshold.
  • the management node may move the file to the second directory such that the storage duration of the files stored in the first directory is all less than the duration threshold, and the storage duration of the files stored in the second directory is greater than or equal to the duration threshold.
  • the management node may first detect whether a non-empty file exist in the second directory. In the case that a non-empty file exists in the second directory, the management node may acquire history data from the file in the second directory. In the case that no non-empty file exists in the second directory, the management node may continue to store the data acquired in real time. The process includes the following steps. [00108] In Cl, the management node detects whether a non-empty file exists in the second directory.
  • the management node may detect whether the number of files in the second directory is equal to 0. If the number of files in the second directory is not equal to 0, it may be determined that a non-empty file exists in the second directory. If the number of files in the second directory is equal to 0, it may be determined that no non-empty file exists in the second directory.
  • the management node may acquire the history data from the file in the second directory.
  • the management node may read the data based on the third circular queue. For example, the management node may create the third circular queue while creating the first circular queue. The length of the third circular queue is equal to the length of the first circular queue
  • the management node may detect the number of files in the second directory after detecting that a non-empty file exists in the second directory.
  • the management node may acquire history data from the file based on the third circular queue.
  • the third circular queue may be configured to read the data in the file.
  • the management node may acquire history data from the second file in the second directory based on the third circular queue.
  • the third circular queue may be configured to read data in a second file, and the storage duration of the second file is greater than the storage duration of other files in the second directory.
  • the third circular queue may read history data from the corresponding file in the following manner.
  • the management node may map the data in the file into a second memory block by using a memory mapping technique. Thereafter, the management node may sequentially store the memory addresses of the second memory block in the third circular queue in a second order, such that the management node may acquire history data from the second memory block based on the memory address at the dequeuing end of the third circular queue.
  • the management node may directly map the data in the file in the second directory into the second memory block and acquire the history data from the second memory block based on the third circular queue without performing an I/O operation on the file in the second directory to acquire the history data, the efficiency of acquiring the history data is effectively improved.
  • step 301 in the case that the management node compresses the file in the first directory, since the file in the second directory is a file moved from the first directory to the second directory, the file in the second directory is also compressed. After acquiring the files in the second directory, the management node may first decompress the file, and then read history data from the file based on the third circular queue.
  • the management node may delete the memory address from the dequeuing end of the third circular queue, and may move an adjacent memory address located after the memory address to the dequeuing end of the third circular queue, and repeat in this way until the number of memory addresses in the third circular queue is 0.
  • the third circular queue is in an empty state, and all the data in the second memory block corresponding to the third circular queue has been acquired.
  • the management node may detect whether the third circular queue is in an empty state after the history data is acquired each time. If the third circular queue is in an empty state, the management node may release the second memory block corresponding to the third circular queue, and may delete or empty the file read by the third circular queue. Therefore, occupation of the memory of the management node is effectively reduced and the data stored in the management node is reduced, thereby ensuring the running speed of the management node. [00118] In C3, the management node may continue to store the data acquired in real time after detecting that no non-empty file exists in the second directory.
  • no non-empty file exists in the second directory it indicates that no history data is available for reading in the second directory.
  • the case that no non-empty file exists in the second directory includes the following two circumstances. In one circumstance, referring to C2, a non-empty file originally exists in the second directory, but the third circular queue has completed reading the data in the second directory, and the file read by the third circular queue is deleted or emptied. In the other circumstance, before the management node detects whether a non-empty file exists in the second directory, no file whose storage duration is greater than or equal to the duration threshold exists in the first directory. Therefore, no non empty file exists in the second directory, and the management node may continue to store the data acquired in real time.
  • step 307 the management node sends the history data over the second channel.
  • the management node may send the history data to the analysis node over the second channel.
  • step 308 the analysis node analyzes the acquired history data.
  • the analysis node may analyze the acquired history data.
  • the analysis node can know the content of the data acquired by the data acquisition node in a past period of time, so as to know the history state of the object monitored by the data acquisition node.
  • the object monitored by the data acquisition node is a wind turbine generator set
  • the analysis node may, by analyzing the history data, know whether the operation of the wind turbine generator set was abnormal over a past period of time, and/or whether the interruption of communication has affected the operation state of the wind turbine generator set, and/or predict the generated power of the wind turbine generator set in a future period of time.
  • the management node may also create a first thread and a second thread, and perform steps 301 and 302 by using the first thread and perform steps 303 to 308 by using the second thread.
  • the management node may perform asynchronously by using the first thread and the second thread, i.e., the management node may perform steps 303 to 308 by using the second thread while performing steps 301 and 302 by using the first thread, thereby increasing the efficiency of sending data to the analysis node.
  • the analysis node may analyze the real-time data first, and then analyze the history data so as to understand the operation state of the object monitored by the data acquisition node in time.
  • steps 304 and 308 may be performed simultaneously, that is, the analysis node may analyze the received real-time data and history data simultaneously.
  • steps 306 to 308 may be performed prior to step 303.
  • the embodiment of the present disclosure provides a data transmission method.
  • the data acquired in real time can be stored after interruption of communication with an analysis node is detected.
  • the real-time data whose storage duration is less than the duration threshold is sent over the first channel, and the history data whose storage duration is greater than or equal to the duration threshold is sent over the second channel.
  • the integrity of the data received by the analysis node is not affected.
  • the analysis node can analyze the situation that needs to be known in time by analyzing the real-time data, and analyze the situation that does not have a high requirement on time limit by analyzing the history data, thereby knowing the history state of the object monitored by the data acquisition node.
  • Fig. 7 is a block diagram of a management node according to an embodiment of the present disclosure. As shown in Fig. 7, the management node 20 includes:
  • a storage module 701 configured to store data acquired in real time in response to detecting interruption of communication with the analysis node;
  • an establishment module 702 configured to establish a first channel and a second channel with the analysis node in response to detecting the restoration of communication with the analysis node;
  • a first acquisition module 703 configured to acquire real-time data from the stored data and send the real-time data to the analysis node over the first channel; and [00134] a second acquisition module 704, configured to acquire history data from the stored data and send the history data to the analysis node over the second channel.
  • the storage duration of the real-time data in the management node is less than a duration threshold, and the storage duration of the history data in the management node is greater than or equal to the duration threshold.
  • the embodiment of the present disclosure provides a management node.
  • the management node may store data acquired in real time after detecting interruption of communication with an analysis node. After detecting the restoration of communication with the analysis node, the management node sends real-time data whose storage duration is less than the duration threshold over the first channel, and send history data whose storage duration is greater than or equal to the duration threshold over the second channel. Since the management node provided by the embodiment of the present disclosure does not lose the data acquired in real time data after the management node detects interruption of communication with the analysis node, the integrity of the data received by the analysis node is not affected.
  • the first acquisition module 703 is configured to:
  • a plurality of files exist in the first directory, and the first acquisition module 703 is configured to:
  • the second acquisition module 704 is configured to:
  • the second acquisition module 704 is configured to: [00146] acquire history data from a second fde in the second directory based on a third circular queue, wherein the storage duration of the second fde is greater than the storage duration of other fdes in the second directory, and the third circular queue is configured to read data in the second file.
  • the circular queue reads data from a corresponding file in the following manner:
  • the management node may further include:
  • a releasing module 705, configured to release a memory block corresponding to the circular queue if the circular queue configured to read data in the management node is in an empty state
  • a deletion module 706, configured to delete the file read by the circular queue.
  • the embodiment of the present disclosure provides a management node.
  • the management node may store data acquired in real time after detecting interruption of communication with an analysis node. After detecting the restoration of communication with the analysis node, the management node sends real-time data whose storage duration is less than the duration threshold over the first channel, and send history data whose storage duration is greater than or equal to the duration threshold over the second channel. Since the management node provided by the embodiment of the present disclosure does not lose the data acquired in real time data after the management node detects interruption of communication with the analysis node, the integrity of the data received by the analysis node is not affected.
  • the embodiments of the present disclosure further provide a data transmission system.
  • the data transmission system may include at least one data acquisition node 10 (e.g. the data acquisition node 10 shown in Fig. 1), a management node 20 (e.g. the management node 20 shown in Fig. 1, Fig. 7, or Fig. 8), and an analysis node 30 (e.g. the analysis node 30 shown in Fig. 1) receiving date transmitted by the management node 20.
  • the embodiments of the present disclosure further provide a computer device.
  • the computer device may include a processor and a memory storing therein at least one instruction, at least one program, a code set, or an instruction set.
  • the at least one instruction, the at least one program, the code set, or the instruction set when loaded and executed by the processor, causes the processor to implement the data transmission method shown in the above embodiments, for example, the data transmission method shown in Fig. 2 or Fig. 3.
  • the embodiments of the present disclosure further provide a computer-readable storage medium storing therein at least one program code that, when loaded and executed by a processor, causes the processor to implement the data transmission method as shown the above embodiments, for example, the data transmission method shown in Fig. 2 or Fig. 3.
  • the terms "first”, “second”, and “third” are used for descriptive purpose only and are not to be construed as indicating or implying any relative importance.
  • the term "a plurality of in the embodiments of the present disclosure refers to two or more.
  • the term “and/or” merely describes an association relationship between associated objects, and indicates that three relationships may exist. For example, A and/or B, may indicate: A exists alone, A and B exist concurrently, and B exists alone.
  • the character "/" used herein generally indicates that the associated objects are of an "OR" relationship.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Maintenance And Management Of Digital Transmission (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The present disclosure provides a data transmission method, node and system, which belong to the field of computer communication. According to this method, data acquired in real time may be stored in response to detecting interruption of communication with an analysis node. In response to detecting restoration of the communication with the analysis node, real-time data whose storage duration is less than a duration threshold is sent over a first channel, and history data whose storage duration is greater than or equal to the duration threshold is sent over a second channel. The integrity of the data received by the analysis node will not be affected since the data acquired in real time is not lost after detecting interruption of communication with the analysis node. Moreover, since the stored data is simultaneously transmitted to the analysis node over different channels, the efficiency of transmitting data to the analysis node is improved, and the real-time and continuity of the data received by the analysis node is ensured.

Description

DATA TRANSMISSION METHOD, NODE AND SYSTEM
TECHNICAL FIELD
[0001] The present disclosure relates to the field of computer communication, and particularly relates to a data transmission method, node and system.
BACKGROUND
[0002] In the field of Internet of Things, a management node may send acquired data to an analysis node in real time, and the analysis node, after receiving a plurality of data sent by the management node, may analyze the plurality of data. For example, in the case that the data received by the analysis node is pitch angles and active powers of a wind turbine generator set, the analysis node may analyze the plurality of active powers and the plurality of pitch angles received to predict the generated power of the wind turbine generator set in a future period of time.
[0003] However, in the case that the management node detects interruption of communication with the analysis node, the management node discards the acquired data, and such a data transmission method may affect the integrity of the data received by the analysis node.
SUMMARY
[0004] The embodiment of the present disclosure provides a data transmission method, node and system, which may solve the related art problem that when a management node detects interruption of communication with an analysis node, the management node discards the acquired data, thereby affecting the integrity of the data received by the analysis node. The technical solution is as follows.
[0005] In one aspect, a data transmission method is provided. The method is applicable to a management node and includes:
[0006] storing data acquired in real time in response to detecting interruption of communication with an analysis node;
[0007] establishing a first channel and a second channel with the analysis node in response to detecting restoration of the communication with the analysis node;
[0008] acquiring real-time data from stored data, and sending the real-time data to the analysis node over the first channel; and
[0009] acquiring history data from the stored data, and sending the history data to the analysis node over the second channel; [0010] wherein storage duration of the real-time data in the management node is less than a duration threshold, and storage duration of the history data in the management node is greater than or equal to the duration threshold.
[0011] Optionally, acquiring the real-time data from the stored data includes:
[0012] in the case that a non-empty fde exists in a first directory, acquiring real-time data from the file in the first directory, wherein the first directory is configured to store a file whose storage duration in the management node is less than the duration threshold;
[0013] in the case that no non-empty file exists in the first directory, acquiring real-time data based on a first circular queue, wherein the first circular queue is configured to store the data acquired in real time, and store the real-time data in a file form to the first directory when the first circular queue is in a full state.
[0014] Optionally, a plurality of files exist in the first directory; and acquiring the real-time data from the first directory includes:
[0015] acquiring the real-time data from a first file in the first directory based on a second circular queue, wherein storage duration of the first file is greater than storage duration of other files in the first directory, and the second circular queue is configured to read data in the first file. [0016] Optionally, acquiring the history data from the stored data includes:
[0017] in the case that a non-empty file exists in a second directory, acquiring the history data from the file in the second directory, wherein the second directory is configured to store a file whose storage duration in the management node is greater than or equal to the duration threshold. [0018] Optionally, a plurality of files exist in the second directory; and acquiring the history data from the second directory includes:
[0019] acquiring the history data from a second file in the second directory based on a third circular queue, wherein storage duration of the second file is greater than storage duration of other files in the second directory, and the third circular queue is configured to read data in the second file.
[0020] Optionally, the circular queue configured to read data in the management node reads data from a corresponding file in the following manner:
[0021] mapping data in the file to a memory block;
[0022] sequentially storing memory addresses of the memory block in the circular queue according to an order in which the data is mapped to the memory block;
[0023] acquiring data from the memory block based on the memory address at a dequeuing end of the circular queue.
[0024] Optionally, the method further includes: [0025] in the case that the circular queue configured to read data in the management node is in an empty state, releasing a memory block corresponding to the circular queue; and [0026] deleting a file read by the circular queue.
[0027] In a second aspect, a management node is provided. The management node includes: [0028] a storage module, configured to store data acquired in real time in response to detecting interruption of communication with an analysis node;
[0029] an establishment module, configured to establish a first channel and a second channel with the analysis node in response to detecting restoration of the communication with the analysis node;
[0030] a first acquisition module, configured to acquire real-time data from stored data and send the real-time data to the analysis node over the first channel; and
[0031] a second acquisition module, configured to acquire history data from the stored data and send the history data to the analysis node over the second channel;
[0032] wherein storage duration of the real-time data in the management node is less than a duration threshold, and storage duration of the history data in the management node is greater than or equal to the duration threshold.
[0033] In a third aspect, a data transmission system is provided. The data transmission system includes: the management node as described in the second aspect and an analysis node configured to receive data transmitted by the management node.
[0034] In a fourth aspect, a computer device is provided. The computer device includes a processor and a memory storing therein at least one instruction, at least one program, a code set or an instruction set, wherein the at least one instruction, the at least one program, the code set or the instruction set, when loaded and executed by the processor, causes the processor to implement the data transmission method as described in the first aspect.
[0035] In a fifth aspect, a computer-readable storage medium is provided. The computer- readable storage medium stores therein at least one program code, wherein the at least one program code, when loaded and executed by a processor, causes the processor to implement the data transmission method as described in the first aspect.
[0036] The technical solutions provided by the embodiments of the present disclosure may at least have the following advantageous effects.
[0037] The embodiments of the present disclosure provide a data transmission method, node, and system. According to this method, data acquired in real time may be stored in response to detecting interruption in communication with an analysis node. In response to detecting that the communication with the analysis node is restored, the real-time data whose storage duration is less than the duration threshold is sent over the first channel, and history data whose storage duration is greater than or equal to the duration threshold is sent over the second channel. In the method provided by the embodiments of the present disclosure, since the data acquired in real time is not lost after detecting the interruption of communication with the analysis node, the integrity of the data received by the analysis node is not affected.
[0038] Moreover, since the stored data is simultaneously transmitted to the analysis node over different channels, the efficiency of transmitting data to the analysis node is improved, and the real-time and continuity of the data received by the analysis node is ensured.
BRIEF DESCRIPTION OF THE DRAWINGS [0039] To describe the technical solutions in the embodiments of the present disclosure more clearly, the following briefly introduces the accompanying drawings required for describing the embodiments. Apparently, the accompanying drawings in the following description show merely some embodiments of the present disclosure, and a person of ordinary skill in the art may still derive other drawings from these accompanying drawings without creative efforts.
[0040] Fig. 1 is a schematic diagram of a data transmission system involved in a data transmission method according to an embodiment of the present disclosure;
[0041] Fig. 2 is a flowchart of a data transmission method according to an embodiment of the present disclosure;
[0042] Fig. 3 is a flowchart of another data transmission method according to an embodiment of the present disclosure;
[0043] Fig. 4 is a schematic diagram of a first circular queue storing data in a file form according to an embodiment of the present disclosure;
[0044] Fig. 5 is a schematic diagram of acquiring real-time data according to an embodiment of the present disclosure;
[0045] Fig. 6 is a schematic diagram of acquiring history data according to an embodiment of the present disclosure;
[0046] Fig. 7 is a block diagram of a management node according to an embodiment of the present disclosure; and
[0047] Fig. 8 is a block diagram of another management node according to an embodiment of the present disclosure.
DETAILED DESCRIPTION
[0048] For clearer descriptions of the objectives, technical solutions, and advantages of the present disclosure, the embodiments of the present disclosure are described in detail hereinafter with reference to the accompanying drawings. [0049] Fig. 1 is a schematic diagram of a data transmission system involved in a data transmission method according to an embodiment of the present disclosure. As shown in Fig. 1, the data transmission system may comprise: at least one data acquisition node 10, a management node 20, and an analysis node 30. Fig. 1 takes the data transmission system comprising two data acquisition nodes 10 as an example.
[0050] The connection between the at least one data acquisition node 10 and the management node 20 and the connection between the management node 20 and the analysis node 30 may be established through a wired network or a wireless network.
[0051] The data acquisition node 10 may be a device capable of acquiring data, for example, a sensor provided on a wind turbine generator set. The data acquisition node 10 is configured to transmit data acquired in real time to the management node 20.
[0052] The management node 20 may be a terminal for management personnel to operate. For example, the management node 20 may be a computer. The management node 20 may uniformly manage the data acquired by the at least one data acquisition node 10, and send the data acquired by the at least one data acquisition node 10 to the analysis node 30 in the case that the analysis node 30 needs to analyze data.
[0053] The analysis node 30 may be a device capable of analyzing data. For example, the analysis node 30 may be a server, or a server cluster composed of several servers, or a cloud computing service center. The analysis node 30 is configured to analyze the received data. For example, in the case that the data received by the analysis node 30 is the pitch angles and the active powers of the wind turbine generator set, the analysis node 30 may analyze the plurality of active powers and the plurality of pitch angles received to predict the generated power of the wind turbine generator set in a future period of time.
[0054] In the related art, in the case that the management node detects interruption of communication with the analysis node, the management node discards the acquired data, and such a data transmission method may affect the integrity of the data received by the analysis node. However, in the data transmission method provided by the embodiment of the present disclosure, the management node 20 may store data acquired in real time after detecting interruption of communication with the analysis node 30, and the management node 20 may establish a first channel 001 and a second channel 002 with the analysis node 30 after detecting restoration of communication with the analysis node 30. The management node 20 may then transmit the stored data to the analysis node 30 simultaneously over the first channel 001 and the second channel 002. Since management node 20 does not discard the data acquired in real time after detecting interruption of communication with the analysis node 30, the integrity of the data ultimately received by the analysis node 30 is not affected. In addition, since the stored data is transmitted over different channels, the efficiency of transmitting data to the analysis node is improved.
[0055] Fig. 2 is a flowchart of a data transmission method according to an embodiment of the present disclosure. The method may be applied to the management node 20 shown in Fig. 1. As shown in Fig. 2, the method may comprise the following steps.
[0056] In step 201, data acquired in real time is stored in response to detecting interruption of communication with an analysis node.
[0057] In the embodiment of the present disclosure, the management node may periodically detect the communication state with the analysis node. In the case that the management node detects interruption of communication with the analysis node, the management node stores data acquired in real time. The data acquired in real time is data sent by the data acquisition node to the management node in real time.
[0058] Optionally, the management node may periodically send a heartbeat packet to the analysis node. It may be determined that communication with the analysis node is interrupted if no heartbeat response is received from the analysis node within target duration, and it may be determined that the communication with the analysis node is not interrupted if the heartbeat response is received from the analysis node within the target duration. Here, the target duration may be a fixed duration stored in advance in the management node.
[0059] In step 202, a first channel and a second channel are established with the analysis node in response to detecting restoration of the communication with the analysis node.
[0060] The management node may also periodically detect whether the communication with the analysis node is restored after detecting that communication with the analysis node is interrupted. The management node may establish a first channel and a second channel with the analysis node in response to detecting restoration of the communication with the analysis node.
[0061] Optionally, the management node may periodically send a heartbeat packet to the analysis node after detecting interruption of communication with the analysis node. If the heartbeat response is received from the analysis node within the target duration, it may be determined that the communication with the analysis node is restored. The management node may then send a first channel establishment request and a second channel establishment request to the analysis node. After receiving the first channel establishment request and the second channel establishment request, the analysis node may establish a first channel and a second channel with the management node, thereby establishing the first channel and the second channel between the management node and the analysis node. If no heartbeat response is received from the analysis node within the target duration, it may be determined that the communication with the analysis node is not restored. [0062] In step 203, real-time data is acquired from stored data and the real-time data is sent to the analysis node over the first channel.
[0063] After establishing the first channel with the analysis node, the management node may acquire real-time data from the stored data and send the real-time data to the analysis node over the first channel. The storage duration of the real-time data in the management node is less than a duration threshold. The duration threshold may be a fixed duration stored in advance in the management node. Optionally, the storage duration may be a duration counted from the start of storing the data, or the storage duration may be the duration from the start of storing the data to a current time, and the current time may be a time when the management node acquires the data. [0064] In step 204, history data is acquired from the stored data and the history data is sent to the analysis node over the second channel.
[0065] The management node may also acquire history data from the stored data after establishing the second channel with the analysis node and may send the history data to the analysis node over the second channel. The storage duration of the history data in the management node is greater than or equal to the duration threshold.
[0066] In summary, the embodiment of the present disclosure provides a data transmission method. According to this method, data acquired in real time may be stored after detecting interruption of communication with an analysis node. After detecting the restoration of communication with the analysis node, the real-time data whose storage duration is less than the duration threshold is sent over the first channel, and history data whose storage duration is greater than or equal to the duration threshold is sent over the second channel. According to this method provided by the embodiment of the present disclosure, since the data acquired in real time is not lost after detecting interruption of communication with the analysis node, the integrity of the data received by the analysis node is not affected.
[0067] Moreover, since the stored data is simultaneously transmitted to the analysis node over different channels, the efficiency of transmitting data to the analysis node is improved, and the real-time and continuity of the data received by the analysis node is ensured.
[0068] Fig. 3 is a flowchart of another data transmission method according to an embodiment of the present disclosure. The method may be applied in the management node 20 and the analysis node 30 shown in Fig. 1. The following embodiments are illustrated by taking an example in which data is read and written in the manner of a circular queue. Each circular queue has an enqueuing end for inputting data and a dequeuing end for outputting data. The enqueuing end and the dequeuing end are located at two ends of a circular queue, respectively. As shown in Fig. 3, the method may include the following steps. [0069] In step 301, the management node stores the data acquired in real time in response to detecting interruption of communication with the analysis node.
[0070] The management node may periodically detect the communication state with the analysis node. In the case that the management node detects interruption of communication with an analysis node, the management node stores data acquired in real time. The data acquired in real time is data sent by the data acquisition node to the management node in real time.
[0071] Optionally, the management node may periodically send a heartbeat packet to the analysis node. The management node may determine that the communication with the analysis node is interrupted in response to receiving no heartbeat response from the analysis node within the target duration; and may determine that communication with the analysis node is not interrupted in response to receiving the heartbeat response from the analysis node within the target duration. The target duration may be a fixed duration stored in advance in the management node.
[0072] In the embodiments of the present disclosure, the management node may create a first directory configured to store files whose storage duration in the management node is less than the duration threshold. The data stored in the files in the first directory may be referred to as real time data.
[0073] For example, the management node may create a first circular queue upon receiving a queue creation operation. Referring to Fig. 4, a first circular queue is configured to store data acquired in real time, and store the real-time data in a file form to the first directory of the management node when the queue in a full state . Optionally, the queue creation operation may be a startup operation for the management node. After detecting interruption of communication with the analysis node, the process of storing real-time data in a file form to the first directory based on the first circular queue by the management node may comprise the following steps. [0074] In Al, the management node stores a memory address corresponding to the acquired data in the first circular queue.
[0075] After detecting interruption of communication with the analysis node, for each data acquired in real time, the management node may first apply for a dynamic memory (also referred to as a temporary memory) for the data and store the data in the dynamic memory. Thereafter, the management node may detect whether the first circular queue is in a full state. In the case that the first circular queue is not in a full state, the management node may store the memory address corresponding to the acquired data in the first circular queue from the enqueuing end of the first circular queue. In the case that the circular queue is in a full state, the management node may suspend the storage of memory address in the first circular queue. [0076] In A2, in the case that the management node detects that the first circular queue is in a full state, the management node may write data corresponding to the memory address stored in the first circular queue into a file in the first directory.
[0077] In the case that the management node detects that the first circular queue is in a full state, the management node may sequentially acquire the plurality of memory addresses from the dequeuing end of the first circular queue in a first order, and acquire a plurality of data based on the plurality of memory addresses, and may sequentially store the plurality of data in the files in the first directory in the first order. The first order is the order in which the plurality of memory addresses are stored in the first circular queue.
[0078] The file in the first directory may be a file created by the management node when data storage is required (i.e., when the first circular queue is in a full state), and may also be an empty file (i.e., a file with empty content) created in the first directory in advance.
[0079] Optionally, after the management node writes the data corresponding to the memory address stored in the first circular queue into the file in the first directory, the management node may compress the file to reduce the storage space, occupied by the file, of the management node. [0080] In A3, the management node may empty the first circular queue.
[0081] It should be noted that the management node may repeatedly perform the aforementioned steps A 1 to A3 to continuously store data into a file based on the first circular queue.
[0082] In the embodiments of the present disclosure, by migrating the plurality of data as a whole into the file based on the first circular queue, the efficiency of moving the plurality of data is improved.
[0083] In step 302, the management node establishes a first channel and a second channel with the analysis node in response to detecting the restoration of communication with the analysis node.
[0084] The management node may also periodically detect whether the communication with the analysis node is restored after detecting that communication with the analysis node is interrupted. The management node may establish a first channel and a second channel with the analysis node in response to detecting the restoration of communication with the analysis node. The first channel is configured to transmit real-time data with the analysis node, and the second channel is configured to transmit history data with the analysis node.
[0085] Optionally, the management node may periodically send a heartbeat packet to the analysis node after detecting interruption of communication with the analysis node. The management node may determine that the communication with the analysis node is restored in response to receiving the heartbeat response from the analysis node within the target duration, such that the management node may send a first channel establishment request and a second channel establishment request to the analysis node. After receiving the first establishment request and the second channel establishment request, the analysis node may establish the first channel and the second channel with the management node, thereby establishing the first channel and the second channel between the management node and the analysis node. The management node determines that the communication with the analysis node is not restored in response to receiving no heartbeat response from the analysis node within the target duration.
[0086] In step 303, the management node acquires real-time data.
[0087] As described in step 301, the real-time data acquired by the management node is stored in the file in the first directory after the first circular queue is in a full state. Therefore, the management node may first detect whether a non-empty file exists in the first directory, and acquire the real-time data from the file in the first directory in the case that a non-empty file exists in the first directory; or acquire the real-time data based on the first circular queue in the case that no non-empty file exists in the first directory. The process includes the following steps. [0088] In B 1, whether a non-empty file exists in the first directory is detected.
[0089] In A2, if the file in the first directory is created only when the management node needs to store data, the management node may detect whether the number of files in the first directory is equal to 0. If the number of files in the first directory is not equal to 0, the management node may determine that a non-empty file exists in the first directory. If the number of files in the first directory is equal to 0, the management node may determine that no non-empty file exists in the first directory.
[0090] In B2, the management node may, after detecting that a non-empty file exists in the first director, acquire real-time data from the file in the first directory.
[0091] In the case that a non-empty file exists in the first directory, it indicates that real-time data is available for reading in the first directory. The management node may read the data based on the second circular queue. For example, the management node may create a second circular queue while creating the first circular queue. The length of the second circular queue is equal to the length of the first circular queue.
[0092] For example, the management node may detect the number of files in the first directory after detecting that the non-empty file exists in the first directory. Referring to Fig. 5, in the case that the management node detects that one file exists in the first directory, the management node may acquire real-time data from the file based on a second circular queue. The second circular queue may be configured to read the data in the file. In the case that a plurality of files exist in the first directory, the management node may acquire real-time data from the first file in the first directory based on the second circular queue. The second circular queue may be configured to read data in the first file, and the storage duration of the first file is greater than the storage duration of other files in the first directory. In this way, data in the file with longer storage duration in the first directory may be read preferentially, so as to reduce the influence of data reading on other files.
[0093] In the embodiments of the present disclosure, after the management node acquires a file in the first directory, the second circular queue reads real-time data from a corresponding file in the following manner.
[0094] The management node may map the data in the file into the first memory block by using a memory mapping technique. Thereafter, the management node may sequentially store the memory addresses of the first memory block in the second circular queue in a second order, thereby acquiring the real-time data from the first memory block based on the memory address at the dequeuing end of the second circular queue. The second order is the aforementioned order of mapping the data in the file into the first memory block, and the second order is the same as the first order in step 301 above.
[0095] Since the management node may directly map data in the file in the first directory to the first memory block, and acquire real-time data from the first memory block based on the memory addresses in the second circular queue, without performing an I/O operation (i.e., input/output operation) on the file to acquire the real-time data, the efficiency of acquiring the real-time data is effectively improved.
[0096] Optionally, in step 301, in the case that the management node compresses the file in the first directory, the management node, after acquiring the file in the first directory, may first decompress the file, and then read the real-time data from the file based on the second circular queue.
[0097] It should be noted that, after acquiring the real-time data from the first memory block based on the memory address at the dequeuing end of the second circular queue each time, the management node may delete the memory address from the dequeuing end of the second circular queue, and move the adjacent memory address located after the memory address to the dequeuing end of the second circular queue, and repeat in this way until the number of memory addresses in the second circular queue is 0. At this point, the second circular queue is in an empty state, and all the data in the first memory block corresponding to the second circular queue has been acquired. In order to avoid the first memory block from still occupying the memory of the management node after the data in the first memory block is acquired, the management node may, after acquiring the real-time data each time, detect whether the second circular queue is in an empty state. In the case that the second circular queue is in an empty state, the management node may release the first memory block corresponding to the second circular queue, and may delete or empty the file read by the second circular queue. In this way, occupation of the memory of the management node is effectively reduced, and the amount of data stored in the management node is reduced, thereby ensuring the running speed of the management node.
[0098] In B3, the management node acquires the real-time data based on the first circular queue after detecting that no non-empty file exists in the first directory.
[0099] The case that no non-empty file exists in the first directory includes the following two circumstances. In one circumstance, referring to B2, a non-empty file originally exists in the first directory, but the second circular queue has completed reading the data in the first directory, and the file read by the second circular queue is deleted or emptied. In the other circumstance, referring to Al, the management node stores the memory address corresponding to the acquired data into the first circular queue, but the first circular queue is not in a full state, and thus no non empty file exists in the first directory.
[00100] In the aforementioned two circumstances, the memory address corresponding to real time data may be stored in the first circular queue. Referring to Fig. 5, the management node may acquire the real-time data based on the first circular queue. Optionally, referring to A 1, the management node may acquire the real-time data in the dynamic memory based on the memory address at the dequeuing end of the first circular queue.
[00101] In step 304, the management node sends the real-time data to the analysis node over the first channel.
[00102] After acquiring the real-time data, the management node may send the real-time data to the analysis node over the first channel.
[00103] In step 305, the analysis node analyzes the acquired real-time data.
[00104] The analysis node may analyze the acquired real-time data after receiving the real-time data sent by the management node. By analyzing the real-time data, the analysis node can know the content of the data acquired by the data acquisition node in time, so as to know the object monitored by the data acquisition node in time. For example, the object monitored by the data acquisition node is a wind turbine generator set, and the analysis node can quickly know whether the wind turbine generator set is operating abnormally by analyzing the real-time data, and/or predict the generated power in a future period of time.
[00105] In step 306, the management node acquires history data.
[00106] In the embodiments of the present disclosure, the management node may create a second directory configured to store files whose storage duration in the management node is greater than or equal to a duration threshold. The data stored in the files in the second directory may be referred to as history data. After the communication between the management node and the analysis node is restored, in the case that a plurality of non-empty files exist in the first directory, for each file, the management node may periodically detect whether the storage duration of the file is greater than or equal to the duration threshold. If the storage duration of the file is greater than or equal to the duration threshold, the management node may move the file to the second directory such that the storage duration of the files stored in the first directory is all less than the duration threshold, and the storage duration of the files stored in the second directory is greater than or equal to the duration threshold.
[00107] In the process of acquiring the history data, the management node may first detect whether a non-empty file exist in the second directory. In the case that a non-empty file exists in the second directory, the management node may acquire history data from the file in the second directory. In the case that no non-empty file exists in the second directory, the management node may continue to store the data acquired in real time. The process includes the following steps. [00108] In Cl, the management node detects whether a non-empty file exists in the second directory.
[00109] For example, the management node may detect whether the number of files in the second directory is equal to 0. If the number of files in the second directory is not equal to 0, it may be determined that a non-empty file exists in the second directory. If the number of files in the second directory is equal to 0, it may be determined that no non-empty file exists in the second directory.
[00110] In C2, after detecting that a non-empty file exists in the second directory, the management node may acquire the history data from the file in the second directory.
[00111] In the case that a non-empty file exists in the second directory, it indicates that there is history data available for reading in the second directory. The management node may read the data based on the third circular queue. For example, the management node may create the third circular queue while creating the first circular queue. The length of the third circular queue is equal to the length of the first circular queue
[00112] For example, the management node may detect the number of files in the second directory after detecting that a non-empty file exists in the second directory. Referring to Fig. 6, in the case that one file exist in the second directory, the management node may acquire history data from the file based on the third circular queue. The third circular queue may be configured to read the data in the file. In the case that a plurality of files exist in the second directory, the management node may acquire history data from the second file in the second directory based on the third circular queue. Here, the third circular queue may be configured to read data in a second file, and the storage duration of the second file is greater than the storage duration of other files in the second directory. In this way, data in the file with longer storage duration in the second directory may be read preferentially, so as to reduce the influence of data reading on other files. [00113] In the embodiments of the present disclosure, after the management node acquires the file in the second directory, the third circular queue may read history data from the corresponding file in the following manner.
[00114] The management node may map the data in the file into a second memory block by using a memory mapping technique. Thereafter, the management node may sequentially store the memory addresses of the second memory block in the third circular queue in a second order, such that the management node may acquire history data from the second memory block based on the memory address at the dequeuing end of the third circular queue.
[00115] Since the management node may directly map the data in the file in the second directory into the second memory block and acquire the history data from the second memory block based on the third circular queue without performing an I/O operation on the file in the second directory to acquire the history data, the efficiency of acquiring the history data is effectively improved.
[00116] Optionally, in step 301, in the case that the management node compresses the file in the first directory, since the file in the second directory is a file moved from the first directory to the second directory, the file in the second directory is also compressed. After acquiring the files in the second directory, the management node may first decompress the file, and then read history data from the file based on the third circular queue.
[00117] It should be noted that, after the management node acquires the history data from the second memory block based on the memory address at the dequeuing end of the third circular queue each time, the management node may delete the memory address from the dequeuing end of the third circular queue, and may move an adjacent memory address located after the memory address to the dequeuing end of the third circular queue, and repeat in this way until the number of memory addresses in the third circular queue is 0. At this point, the third circular queue is in an empty state, and all the data in the second memory block corresponding to the third circular queue has been acquired. In order to avoid the second memory block from still occupying the memory of the management node in the case that the data in the second memory block is acquired, the management node may detect whether the third circular queue is in an empty state after the history data is acquired each time. If the third circular queue is in an empty state, the management node may release the second memory block corresponding to the third circular queue, and may delete or empty the file read by the third circular queue. Therefore, occupation of the memory of the management node is effectively reduced and the data stored in the management node is reduced, thereby ensuring the running speed of the management node. [00118] In C3, the management node may continue to store the data acquired in real time after detecting that no non-empty file exists in the second directory. [00119] In the case that no non-empty file exists in the second directory, it indicates that no history data is available for reading in the second directory. The case that no non-empty file exists in the second directory includes the following two circumstances. In one circumstance, referring to C2, a non-empty file originally exists in the second directory, but the third circular queue has completed reading the data in the second directory, and the file read by the third circular queue is deleted or emptied. In the other circumstance, before the management node detects whether a non-empty file exists in the second directory, no file whose storage duration is greater than or equal to the duration threshold exists in the first directory. Therefore, no non empty file exists in the second directory, and the management node may continue to store the data acquired in real time.
[00120] In step 307, the management node sends the history data over the second channel.
[00121] After acquiring the history data, the management node may send the history data to the analysis node over the second channel.
[00122] In step 308, the analysis node analyzes the acquired history data.
[00123] After receiving the history data sent by the management node, the analysis node may analyze the acquired history data. By analyzing the history data, the analysis node can know the content of the data acquired by the data acquisition node in a past period of time, so as to know the history state of the object monitored by the data acquisition node. For example, the object monitored by the data acquisition node is a wind turbine generator set, and the analysis node may, by analyzing the history data, know whether the operation of the wind turbine generator set was abnormal over a past period of time, and/or whether the interruption of communication has affected the operation state of the wind turbine generator set, and/or predict the generated power of the wind turbine generator set in a future period of time.
[00124] In the embodiments of the present disclosure, the management node may also create a first thread and a second thread, and perform steps 301 and 302 by using the first thread and perform steps 303 to 308 by using the second thread. The management node may perform asynchronously by using the first thread and the second thread, i.e., the management node may perform steps 303 to 308 by using the second thread while performing steps 301 and 302 by using the first thread, thereby increasing the efficiency of sending data to the analysis node. [00125] It should be noted that, when the analysis resources of the analysis node are insufficient, the analysis node may analyze the real-time data first, and then analyze the history data so as to understand the operation state of the object monitored by the data acquisition node in time. [00126] It should be noted that the order of the steps of the data transmission method provided by the embodiments of the present application may be adjusted appropriately, and the steps may also be deleted according to the situation. For example, steps 304 and 308 may be performed simultaneously, that is, the analysis node may analyze the received real-time data and history data simultaneously. Alternatively, steps 306 to 308 may be performed prior to step 303. Any variations of the method easily derived by persons skilled in the art shall be included in the protection scope of the present application, and details are not repeated herein.
[00127] In summary, the embodiment of the present disclosure provides a data transmission method. According to this method, the data acquired in real time can be stored after interruption of communication with an analysis node is detected. After the restoration of communication with the analysis node is detected, the real-time data whose storage duration is less than the duration threshold is sent over the first channel, and the history data whose storage duration is greater than or equal to the duration threshold is sent over the second channel. According to the method provided by the embodiment of the present disclosure, since the data acquired in real time is not lost after the management node detects interruption of communication with the analysis node, the integrity of the data received by the analysis node is not affected.
[00128] In addition, since the stored data is simultaneously transmitted to the analysis node over different channels, the efficiency of transmitting data to the analysis node is improved, and the real-time and continuity of the data received by the analysis node is ensured.
[00129] Furthermore, since the management node transmits the real-time data and the history data over different channels, respectively, different analysis requirements of the analysis node can be met. The analysis node can analyze the situation that needs to be known in time by analyzing the real-time data, and analyze the situation that does not have a high requirement on time limit by analyzing the history data, thereby knowing the history state of the object monitored by the data acquisition node.
[00130] Fig. 7 is a block diagram of a management node according to an embodiment of the present disclosure. As shown in Fig. 7, the management node 20 includes:
[00131] a storage module 701, configured to store data acquired in real time in response to detecting interruption of communication with the analysis node;
[00132] an establishment module 702, configured to establish a first channel and a second channel with the analysis node in response to detecting the restoration of communication with the analysis node;
[00133] a first acquisition module 703, configured to acquire real-time data from the stored data and send the real-time data to the analysis node over the first channel; and [00134] a second acquisition module 704, configured to acquire history data from the stored data and send the history data to the analysis node over the second channel. [00135] The storage duration of the real-time data in the management node is less than a duration threshold, and the storage duration of the history data in the management node is greater than or equal to the duration threshold.
[00136] In summary, the embodiment of the present disclosure provides a management node. The management node may store data acquired in real time after detecting interruption of communication with an analysis node. After detecting the restoration of communication with the analysis node, the management node sends real-time data whose storage duration is less than the duration threshold over the first channel, and send history data whose storage duration is greater than or equal to the duration threshold over the second channel. Since the management node provided by the embodiment of the present disclosure does not lose the data acquired in real time data after the management node detects interruption of communication with the analysis node, the integrity of the data received by the analysis node is not affected.
[00137] Moreover, since the stored data is simultaneously transmitted to the analysis node over different channels, the efficiency of transmitting data to the analysis node is improved, and the real-time and continuity of the data received by the analysis node is ensured.
[00138] Optionally, the first acquisition module 703 is configured to:
[00139] in the case that a non-empty file exist in a first directory, acquire real-time data from a file in the first directory, wherein the first directory is configured to store a file whose storage duration in the management node is less than the duration threshold; and
[00140] in the case that no non-empty file exists in the first directory, acquire real-time data based on a first circular queue and store the real-time data in a file form to the first directory when the first circular queue in a full state, wherein the first circular queue is configured to store the data acquired in real time.
[00141] Optionally, a plurality of files exist in the first directory, and the first acquisition module 703 is configured to:
[00142] acquire real-time data from a first file in the first directory based on a second circular queue, wherein the storage duration of the first file is greater than the storage duration of other files in the first directory, and the second circular queue is configured to read data in the first file. [00143] Optionally, the second acquisition module 704 is configured to:
[00144] in the case that a non-empty file exists in a second directory, acquire history data from a file in the second directory, wherein the second directory is configured to store a file whose storage duration in the management node is greater than or equal to the duration threshold. [00145] Optionally, a plurality of files exist in the second directory; and the second acquisition module 704 is configured to: [00146] acquire history data from a second fde in the second directory based on a third circular queue, wherein the storage duration of the second fde is greater than the storage duration of other fdes in the second directory, and the third circular queue is configured to read data in the second file.
[00147] Optionally, for the circular queue configured to read data in the management node, the circular queue reads data from a corresponding file in the following manner:
[00148] mapping the data in the file to a memory block;
[00149] sequentially storing the memory addresses of the memory block in the circular queue in the order in which the data is mapped to the memory block;
[00150] acquiring data from the memory block based on the memory address at the dequeuing end of the circular queue.
[00151] Optionally, as shown in Fig. 8, the management node may further include:
[00152] a releasing module 705, configured to release a memory block corresponding to the circular queue if the circular queue configured to read data in the management node is in an empty state; and
[00153] a deletion module 706, configured to delete the file read by the circular queue.
[00154] In summary, the embodiment of the present disclosure provides a management node. The management node may store data acquired in real time after detecting interruption of communication with an analysis node. After detecting the restoration of communication with the analysis node, the management node sends real-time data whose storage duration is less than the duration threshold over the first channel, and send history data whose storage duration is greater than or equal to the duration threshold over the second channel. Since the management node provided by the embodiment of the present disclosure does not lose the data acquired in real time data after the management node detects interruption of communication with the analysis node, the integrity of the data received by the analysis node is not affected.
[00155] Moreover, since the stored data is simultaneously transmitted to the analysis node over different channels, the efficiency of transmitting data to the analysis node is improved, and the real-time and continuity of the data received by the analysis node is ensured.
[00156] The embodiments of the present disclosure further provide a data transmission system. The data transmission system may include at least one data acquisition node 10 (e.g. the data acquisition node 10 shown in Fig. 1), a management node 20 (e.g. the management node 20 shown in Fig. 1, Fig. 7, or Fig. 8), and an analysis node 30 (e.g. the analysis node 30 shown in Fig. 1) receiving date transmitted by the management node 20. [00157] The embodiments of the present disclosure further provide a computer device. The computer device may include a processor and a memory storing therein at least one instruction, at least one program, a code set, or an instruction set. The at least one instruction, the at least one program, the code set, or the instruction set, when loaded and executed by the processor, causes the processor to implement the data transmission method shown in the above embodiments, for example, the data transmission method shown in Fig. 2 or Fig. 3.
[00158] The embodiments of the present disclosure further provide a computer-readable storage medium storing therein at least one program code that, when loaded and executed by a processor, causes the processor to implement the data transmission method as shown the above embodiments, for example, the data transmission method shown in Fig. 2 or Fig. 3.
[00159] In the embodiments of the present disclosure, the terms "first", "second", and "third" are used for descriptive purpose only and are not to be construed as indicating or implying any relative importance. The term "a plurality of in the embodiments of the present disclosure refers to two or more. The term "and/or" merely describes an association relationship between associated objects, and indicates that three relationships may exist. For example, A and/or B, may indicate: A exists alone, A and B exist concurrently, and B exists alone. In addition, the character "/" used herein generally indicates that the associated objects are of an "OR" relationship.
[00160] The above descriptions are merely optional embodiments of the present disclosure, and are not intended to limit the present disclosure. Any modifications, equivalent substitutions, improvements and the like made within the spirit and principles of the present disclosure shall be included in the protection scope of the present disclosure.

Claims

CLAIMS What is claimed is:
1. A data transmission method, applicable to a management node, the method comprising: storing data acquired in real time in response to detecting interruption of communication with an analysis node; establishing a first channel and a second channel with the analysis node in response to detecting restoration of the communication with the analysis node; acquiring real-time data from stored data, and sending the real-time data to the analysis node over the first channel; and acquiring history data from the stored data, and sending the history data to the analysis node over the second channel; wherein storage duration of the real-time data in the management node is less than a duration threshold, and storage duration of the history data in the management node is greater than or equal to the duration threshold.
2. The method of claim 1, wherein acquiring the real-time data from the stored data comprises: in the case that a non-empty file exists in a first directory, acquiring real-time data from the file in the first directory, wherein the first directory is configured to store a file whose storage duration in the management node is less than the duration threshold; in the case that no non-empty file exists in the first directory, acquiring real-time data based on a first circular queue, wherein the first circular queue is configured to store the data acquired in real time, and store the real-time data in a file form to the first directory when the first circular queue is in a full state.
3. The method of claim 2, wherein a plurality of files exist in the first directory; and acquiring the real-time data from the first directory comprises: acquiring the real-time data from a first file in the first directory based on a second circular queue, wherein storage duration of the first file is greater than storage duration of other files in the first directory, and the second circular queue is configured to read data in the first file.
4. The method of any one of claims 1 to 3, wherein acquiring the history data from the stored data comprises: in the case that a non-empty file exists in a second directory, acquiring the history data from a file in the second directory, wherein the second directory is configured to store a file whose storage duration in the management node is greater than or equal to the duration threshold.
5. The method of claim 4, wherein a plurality of files exist in the second directory; and acquiring the history data from the second directory comprises: acquiring the history data from a second file in the second directory based on a third circular queue, wherein storage duration of the second file is greater than storage duration of other files in the second directory, and the third circular queue is configured to read data in the second file.
6. The method of claim 3 or 5, wherein the circular queue configured to read data in the management node reads data from a corresponding file in the following manner: mapping data in the file to a memory block; sequentially storing memory addresses of the memory block in the circular queue according to an order in which the data is mapped to the memory block; acquiring data from the memory block based on the memory address at a dequeuing end of the circular queue.
7. The method of claim 6, further comprising: in the case that the circular queue configured to read data in the management node is in an empty state, releasing a memory block corresponding to the circular queue; and deleting a file read by the circular queue.
8. A management node, comprising: a storage module, configured to store data acquired in real time in response to detecting interruption of communication with an analysis node; an establishment module, configured to establish a first channel and a second channel with the analysis node in response to detecting restoration of the communication with the analysis node; a first acquisition module, configured to acquire real-time data from stored data and send the real-time data to the analysis node over the first channel; and a second acquisition module, configured to acquire history data from the stored data and send the history data to the analysis node over the second channel; wherein storage duration of the real-time data in the management node is less than a duration threshold, and storage duration of the history data in the management node is greater than or equal to the duration threshold.
9. A data transmission system, comprising: the management node as defined in claim 8 and an analysis node configured to receive data transmitted by the management node.
10. A computer device, comprising a processor and a memory storing therein at least one instruction, at least one program, a code set or an instruction set, wherein the at least one instruction, the at least one program, the code set or the instruction set, when loaded and executed by the processor, causes the processor to implement the data transmission method as defined in any one of claims 1 to 7.
11. A computer-readable storage medium storing therein at least one program code, wherein the at least one program code, when loaded and executed by a processor, causes the processor to implement the data transmission method as defined in any one of claims 1 to 7.
PCT/SG2022/050490 2021-07-14 2022-07-13 Data transmission method, node and system WO2023287357A2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110797123.2 2021-07-14
CN202110797123.2A CN113630442B (en) 2021-07-14 2021-07-14 Data transmission method, device and system

Publications (3)

Publication Number Publication Date
WO2023287357A2 true WO2023287357A2 (en) 2023-01-19
WO2023287357A3 WO2023287357A3 (en) 2023-03-02
WO2023287357A8 WO2023287357A8 (en) 2023-08-31

Family

ID=78379778

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SG2022/050490 WO2023287357A2 (en) 2021-07-14 2022-07-13 Data transmission method, node and system

Country Status (2)

Country Link
CN (1) CN113630442B (en)
WO (1) WO2023287357A2 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115102911A (en) * 2022-07-29 2022-09-23 上海电气风电集团股份有限公司 Data acquisition method and device, electronic equipment and readable storage medium

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8661486B2 (en) * 2007-12-19 2014-02-25 At&T Intellectual Property I, L.P. System and method of delivering video content
CN102255794B (en) * 2010-05-17 2014-07-30 塔塔咨询服务有限公司 Remote message transmit-receive handling capacity and waiting time shortening system and method
CN101968876B (en) * 2010-09-17 2012-11-14 航天恒星科技有限公司 Adaptive real-time processing method for remote sensing images of ground system
US9518459B1 (en) * 2012-06-15 2016-12-13 Petrolink International Logging and correlation prediction plot in real-time
CN105957334A (en) * 2016-04-20 2016-09-21 国网上海市电力公司 Automatic real-time monitoring and statistic analysis system for channel
US10587399B2 (en) * 2016-06-06 2020-03-10 Agilepq, Inc. Data conversion systems and methods
US10467151B2 (en) * 2017-09-05 2019-11-05 NGINX, Inc. Using shared memory to transport data between server processes
CN107678835B (en) * 2017-09-30 2020-05-08 东软集团股份有限公司 Data transmission method and system
CN107995061A (en) * 2017-11-30 2018-05-04 北京卓讯科信技术有限公司 Collection and playback system and method when more specification 10Gbps network signals are long
CN110597890B (en) * 2018-05-25 2022-04-05 杭州海康威视数字技术股份有限公司 Data acquisition system, data acquisition method, node device, and storage medium
US10771523B1 (en) * 2019-04-12 2020-09-08 Dish Network L.L.C. Asynchronous real-time media transfer over wireless networks
CN111031094B (en) * 2019-11-06 2022-07-12 远景智能国际私人投资有限公司 Data transmission method, device, equipment and storage medium in IoT system
CN112905106B (en) * 2019-12-04 2023-04-18 贵州白山云科技股份有限公司 Data processing method, device, system, equipment and storage medium
CN111107149A (en) * 2019-12-18 2020-05-05 贵州智诚科技有限公司 Method for continuously transmitting data of road traffic equipment in disconnected network
CN111176171A (en) * 2019-12-31 2020-05-19 南京深度智控科技有限公司 Building thing networking data acquisition device based on distributing type cloud framework
CN111918230B (en) * 2020-05-29 2022-09-09 北京寄云鼎城科技有限公司 Data acquisition method, data transmission method, gateway, equipment and storage medium
CN111770143A (en) * 2020-06-16 2020-10-13 南京东源磐能能源科技股份有限公司 Data breakpoint continuous transmission scheme based on Mqtt protocol
CN112269655B (en) * 2020-10-15 2023-01-13 北京百度网讯科技有限公司 Memory mapping file cleaning method and device, electronic equipment and storage medium
CN112667592B (en) * 2020-12-24 2024-05-07 平安科技(深圳)有限公司 Data storage method, device, computer equipment and storage medium

Also Published As

Publication number Publication date
WO2023287357A8 (en) 2023-08-31
WO2023287357A3 (en) 2023-03-02
CN113630442A (en) 2021-11-09
CN113630442B (en) 2023-09-12

Similar Documents

Publication Publication Date Title
CN107689976B (en) File transmission method and device
EP3633957A1 (en) Data storage method, storage server, storage medium and system
CN106991177B (en) Lossless acquisition method and system for real-time logs in distributed environment
CN112422497B (en) Message transmission method and device and computer equipment
CN109905479B (en) File transmission method and device
CN107395559B (en) Data processing method and device based on redis
CN111338893A (en) Process log processing method and device, computer equipment and storage medium
WO2023287357A2 (en) Data transmission method, node and system
WO2024139748A1 (en) Data transmission method and apparatus, and electronic device
CN112052227A (en) Data change log processing method and device and electronic equipment
CN112311902A (en) File sending method and device based on micro-service
CN111988391A (en) Message sending method and device
CN109788251B (en) Video processing method, device and storage medium
CN108063809B (en) Machine equipment data acquisition method and acquisition system
CN110719233B (en) Method and device for transmitting information
CN110750425A (en) Database monitoring method, device and system and storage medium
CN111669431B (en) Message transmission method and device, computer equipment and storage medium
US10250515B2 (en) Method and device for forwarding data messages
CN108023880B (en) Data packet processing method and device and server
CN115208872A (en) Edge cloud mirror image data processing method and device, computer equipment and storage medium
CN111552612A (en) MSSQL monitoring management method, management device, system and computer equipment
CN112153148A (en) Message accumulation processing method and device based on message receiving end
CN114546979B (en) Distributed storage system, and management method, device and equipment thereof
CN115102943B (en) Multi-channel-based data trans-regional transmission method and device
CN109586968A (en) The log processing method of big data platform and the log processing system of big data platform

Legal Events

Date Code Title Description
DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 22842571

Country of ref document: EP

Kind code of ref document: A2