[go: up one dir, main page]

CN112788113B - Data communication system and method capable of breakpoint continuous transmission - Google Patents

Data communication system and method capable of breakpoint continuous transmission Download PDF

Info

Publication number
CN112788113B
CN112788113B CN202011605724.0A CN202011605724A CN112788113B CN 112788113 B CN112788113 B CN 112788113B CN 202011605724 A CN202011605724 A CN 202011605724A CN 112788113 B CN112788113 B CN 112788113B
Authority
CN
China
Prior art keywords
queue
data
client
data packet
length
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011605724.0A
Other languages
Chinese (zh)
Other versions
CN112788113A (en
Inventor
李驹光
吴金华
唐东明
刘湛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu Zhongqian Automation Engineering Co ltd
Original Assignee
Chengdu Zhongqian Automation Engineering 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 Chengdu Zhongqian Automation Engineering Co ltd filed Critical Chengdu Zhongqian Automation Engineering Co ltd
Priority to CN202011605724.0A priority Critical patent/CN112788113B/en
Publication of CN112788113A publication Critical patent/CN112788113A/en
Application granted granted Critical
Publication of CN112788113B publication Critical patent/CN112788113B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/06Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/10Active monitoring, e.g. heartbeat, ping or trace-route

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Health & Medical Sciences (AREA)
  • Cardiology (AREA)
  • General Health & Medical Sciences (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a data communication system capable of realizing breakpoint continuous transmission, which comprises a client and a server, wherein the client is communicated with the server, and a heartbeat mechanism is added into the client to monitor the network connection state of the client and the server; the client sends the data generated by the client to the server in real time, meanwhile, a storage queue is established in the client to store the sent data packets, and the server stores the successfully received data into a database according to the time sequence and returns a response data packet; and the client judges whether the network fault occurs according to the condition of receiving the reply packet, searches the data packet which is not successfully transmitted when the network fault occurs in the storage queue, and retransmits the data packet to finish the breakpoint continuous transmission. The scheme provided by the invention can meet the strong real-time operation requirement of the system widely existing in the industrial automation system, improve the transmission efficiency and reduce the loss of real-time data as much as possible.

Description

Data communication system and method capable of breakpoint continuous transmission
Technical Field
The present invention relates to the field of data communication, and in particular, to a data communication system and method capable of resuming transmission at a breakpoint.
Background
Whether for long distance network data communications or for short distance device-to-device data communications, the logical relationship between the communicating entities can be generally divided between client and server sides. The server and the client exist in a one-to-one manner in the simple system; in a complex system, a server and a client exist in a one-to-many mode. The background of the application of the invention is a welding operation flow of a certain welding robot, and the welding robot (as a client) sends relevant information (welding gun information, welding wire information, gas information, nozzle information, welding gun speed position temperature, welding seam width height, electric energy consumption, time stamp and the like) of a current welding gun to a background server side in the process of needing operation and after the operation is finished. The welding process is designed in advance and is issued to the controller of the welding robot before the welding operation starts, so the controller of the welding robot can complete the welding operation according to the set process steps, and sends production process data to the background server after each step. Each step of the welding operation has strict time constraint, and the steps have strict sequence, so in order to completely monitor the whole welding operation process and take the whole welding operation process as data guarantee of welding quality, the data sent by the welding robot after each operation step in the operation process is required to be not lost. However, there may be uncertainty in the network connection, and when a network drop occurs, the security operation of the currently transmitted data needs to be completed in time. This operation needs to consider two issues: firstly, it is necessary to know when the connection state loss between the client and the server occurs, and when this occurs, if the data sending process of the client cannot timely know the current network connection state, the data transmission process is still performed, and it is obvious that the server does not receive the sent data (but the client receives the data for the server); secondly, in order to prevent the data transmission failure of the client caused by the disconnection, the data backup to be sent needs to be considered and stored in advance, and the network is waited to restore the continuous transmission of the disconnected point data. However, when the backup data is stored, how much data is backed up, how the backup data is coordinated with the newly generated data in the transmission process, the processing process of receiving the broken data needs to be considered after the server side which is disconnected is connected again.
Generally, in order to ensure stability and integrity of data transmission, both communication parties need to maintain a connection state all the time, and in consideration of uncertain factors of network connectivity in a communication environment, in most communication systems, a heartbeat signal is adopted between a client and a server to perform keep-alive operation of connection. The application does not consider that the keep-alive is realized by adopting the KEEPALIVE option carried by the TCP protocol, because the KEEPALIVE option can cause bandwidth waste and cannot carry out application layer interaction, the method is not a high-efficiency keep-alive mode.
Considering that in the background of the application, the most central requirement is that information of welding operation cannot be lost, in order to achieve the purpose, firstly, the connection state of a network needs to be ensured; in case of disconnection, the job data to be sent needs to be saved and transmitted again after the network connection is restored, which may also be called breakpoint resume. In the published literature and patent publications, periodic heartbeat signals are the primary method used to identify the status of a network connection. In the processing of breakpoint continuous transmission, whether a specific file or field data acquired by a client is used, the client generally inquires whether the current network connection is normal before sending, and if the current network connection is normal, the data is sent; and if not, storing the current data to be sent, and sending the data after the network is recovered. The query method not only consumes time but also consumes excessive bandwidth resources, and the state query is performed first every time the service data is normally received and transmitted, so that the efficiency is very low, and if the quantity of the data to be transmitted is large and the transmission frequency is high, a large amount of data is accumulated by the method, which is not feasible in practical application. Therefore, a more efficient data transmission scheme is needed for machine operation occasions with higher real-time requirements.
Disclosure of Invention
Aiming at the problems in the prior art, the data communication system and the method capable of continuously transmitting at the breakpoint are provided in consideration of the strong real-time operation requirement of the system widely existing in the industrial automation system, the transmission efficiency is improved, and the loss of real-time data is reduced as much as possible, wherein the data communication system comprises application layer heartbeat, breakpoint data storage, breakpoint data retransmission, newly generated real-time data, logic processing of transmission between the breakpoint data and the like.
The technical scheme adopted by the invention is as follows: a data communication system capable of continuous transmission at a breakpoint comprises a client and a server, wherein the client is communicated with the server, and a heartbeat mechanism is added in the client to monitor the network connection state of the client and the server; the client sends the data generated by the client to the server in real time, meanwhile, a storage queue is established in the client to store the sent data packets, and the server stores the successfully received data into a database according to the time sequence and returns a response data packet; and the client judges whether the network fault occurs according to the condition of receiving the reply packet, searches the data packet which is not successfully transmitted when the network fault occurs in the storage queue, and retransmits the data packet to finish the breakpoint continuous transmission.
Further, the heartbeat mechanism is specifically: the client runs a heartbeat signal maintaining thread or process to realize that heartbeat packets are sent to the server end every Th seconds, waits for the server end to reply a predetermined response packet, and can judge that the current network connectivity is good and the program of the current server end works normally if the response packet is received within a specified timeout time; otherwise, the network is interrupted.
Further, the save queue is Q ═ a (a)1,a2,…,an),a1The queue head element is the data packet entering the queue firstly; a isnThe queue tail element is the last data packet entering the queue; initializing n by saving the length of the queue; after the client sends a real-time data packet each time, inserting the sent data packet into the tail of a storage queue Q, filling the storage queue Q after the client sends n data packets, sequentially entering the queue from the tail of the queue, and sequentially removing the data packet at the head of the queue from the queue; each element in the save queue is accompanied by a transmit timestamp of the stored packet.
Further, the specific process of resending is as follows: when the network connection is in a problem, the client does not receive a response data packet replied by the server, the client searches a data packet needing to be retransmitted in the storage queue Q, and the searched keyword is a timestamp for transmitting the data packet; if a plurality of unresponsive data packets exist, the client needs to perform the processes of searching and retransmitting for multiple times in the queue Q; the data packets sent by the retransmission process do not enter the holding queue.
Further, in the data packet retransmission process of breakpoint continuous transmission, when a client generates a new data packet transmission request, new data packet transmission is performed after the current retransmission data transmission is completed, and the new data packet is added to the tail of the queue.
Further, the saving queue length has a dynamic adjustment mechanism, which specifically includes: setting the length of a storage queue to len as Th/Td, wherein Th is the sending period of a heartbeat data packet, Td is the average value of the past m real-time data sending intervals of the client, and m is taken according to the system tracking condition; the m-times transmission interval value is stored in the array, each time a newly generated transmission interval is sent into the array to replace the earliest interval value data, after the m-times time interval is accumulated, len is executed to Th/Td, a new len value is obtained to be used as the length of the queue, and accordingly, the data packet stored in the queue is adjusted and stored.
Further, the process of adjusting the data packets stored in the storage queue includes:
when the new length of the save queue is increased compared with the original length, connecting the increased length unit to the head of the original queue, and setting a new queue head element;
when the new length of the save queue is reduced compared with the original length, the reduced length is directly cut off from the head of the original queue, and a new queue head element is set.
Further, the storage queue is implemented by a variable-length array or a linked list.
The invention also provides a data communication method capable of realizing breakpoint continuous transmission, which comprises the following steps:
step 1, initializing a network socket of a client and initializing a data storage queue;
step 2, whether a new data packet is sent or not is judged, if yes, the current data packet is sent and the step 3 is carried out, and if not, the step 6 is carried out;
step 3, inserting the current data packet to be sent into the tail of the queue, moving the queue in sequence, enabling the data packet at the head of the queue to be out of the queue, and recording the past 1 time interval for sending the data packet;
step 4, judging whether the number of the recording time intervals reaches m, if so, entering step 5, otherwise, entering step 6;
step 5, calculating the average value of m time intervals, recalculating the queue length, adjusting the queue structure and the stored data packet according to the new queue length, and replacing the earliest recorded time interval value with the current time interval value;
and 6, judging whether a response data packet which is not received exists, if so, extracting the corresponding data packet from the data storage queue to transmit, otherwise, entering the step 2, and continuing to wait for a new data packet to transmit.
Further, the process of step 5 is as follows: setting the length of a storage queue to len-Th/Td, wherein Th is the sending period of the heartbeat data packets of the client and can be set according to requirements, and Td is the average value of the past m real-time data sending intervals of the client; after the time interval is accumulated for m times, executing len to Th/Td to obtain a new len value as the length of the queue, and correspondingly adjusting and storing the data packets stored in the queue; the process of adjusting the data packets stored in the queue comprises the following steps: when the new length of the save queue is increased compared with the original length, connecting the increased length unit to the head of the original queue, and setting a new queue head element; when the new length of the save queue is reduced compared with the original length, the reduced length is directly cut off from the head of the original queue, and a new queue head element is set.
Compared with the prior art, the beneficial effects of adopting the technical scheme are as follows: the scheme provided by the invention can meet the strong real-time operation requirement of the system widely existing in the industrial automation system, improve the transmission efficiency and reduce the loss of real-time data as much as possible.
Drawings
Fig. 1 is a flowchart of a data communication method according to the present invention.
FIG. 2 is a diagram illustrating dynamic increase of the length of the save queue according to an embodiment of the present invention.
FIG. 3 is a diagram illustrating dynamic reduction of the length of the save queue according to an embodiment of the invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
According to the client and the server in network connection, the client finishes self operation work and sends production data to the server in real time, and the server stores the received data into the database in time sequence.
Example 1
A data communication system capable of continuous transmission at a breakpoint comprises a client and a server, wherein the client is communicated with the server, and a heartbeat mechanism is added in the client to monitor the network connection state of the client and the server; the client sends the data generated by the client to the server in real time, meanwhile, a storage queue is established in the client to store the sent data packets, and the server stores the successfully received data into a database according to the time sequence and returns a response data packet; and the client judges whether the network fault occurs according to the condition of receiving the reply packet, searches the data packet which is not successfully transmitted when the network fault occurs in the storage queue, and retransmits the data packet to finish the breakpoint continuous transmission.
In this embodiment, the client runs a production data sending thread (or process), and sends the current production data after each job step is finished. Since the operation steps are performed in time sequence, correspondingly, the production data is transmitted in time sequence, but it is noted that the time intervals between the steps are not consistent. In order to ensure that the critical production data is not lost, the client needs to get a reply from the server. In consideration of the real-time transmission requirement of the production data, when the reply of the server to the last data packet is not received, the client may need to transmit a new data packet again. However, whether a new data packet is sent next or not, the client also sets a limit of the reception timeout, that is, if the system does not receive the reply signal from the server within the specified timeout period, it can determine that the data packet is lost.
If the network connection is normal, the client may receive multiple reply signals at a time after sending a new data packet, which indicates that the server correctly receives multiple data packets sent in the past time.
If the network connection is not normal, the client may not receive one reply signal after continuously sending a plurality of data packets, or only receives less than n reply packets after sending n data packets, and at this time, the client system may determine that the current network has a connection failure. The first possibility of the failure is that when the client sends real-time production data, the network connection is in a problem, so that the production data sent by the client is not received by the server, and the server naturally does not send a plurality of data packets back to the client; the second possibility of the failure is that the server receives the production data sent by the client, and when the server replies, the network connection is in a problem, so that the client does not receive a response data packet replied by the server within a specified time. Therefore, in order to ensure that the important data is completely received by the server, the client searches and sends the data packet which does not receive the response data packet from the storage queue, and performs the work of breakpoint continuous transmission.
Example 2
On the basis of embodiment 1, the heartbeat mechanism specifically includes: the client runs a heartbeat signal maintaining thread or process to realize that heartbeat packets are sent to the server end every Th seconds, waits for the server end to reply a predetermined response packet, and can judge that the current network connectivity is good and the program of the current server end works normally if the response packet is received within a specified timeout time; otherwise, the network is interrupted; wherein the specified timeout period can be set according to requirements.
Example 3
Based on example 2, the save queue is Q ═ a (a)1,a2,…,an),a1The queue head element is the data packet entering the queue firstly; a isnThe queue tail element is the last data packet entering the queue, and each queue element is attached with a sending time stamp of the data packet besides the content of the data packet. In order to ensure that each element ai in the queue is convenient and feasible to realize, the size of a single element in the queue is set as the maximum byte number of a transmitted data packet, and meanwhile, the length initialization n of the queue is stored; after the client sends the real-time data packet each time, the sent data packet is inserted into the tail of the storage queue Q, the storage queue Q is filled after the client sends n data packets, the later data packets sequentially enter the queue through the tail, and the data packets at the head of the queue are sequentially removed from the queue.
Example 4
On the basis of embodiment 3, the specific process of retransmission is as follows: when the network connection is in a problem, the client does not receive a response data packet replied by the server, the client searches a data packet needing to be retransmitted in the storage queue Q, and the searched keyword is a timestamp for transmitting the data packet; if a plurality of unresponsive data packets exist, the client needs to perform the processes of searching and retransmitting for multiple times in the queue Q; the data packets sent by the retransmission process do not enter the holding queue.
Example 5
On the basis of embodiment 4, in the process of retransmitting the data packet which is continuously transmitted at the breakpoint, when the client generates a new data packet transmission request, the client transmits the new data packet after the current retransmission data is transmitted, and adds the new data packet to the tail of the queue.
Example 6
On the basis of embodiment 5, the length of the save queue has a dynamic adjustment mechanism, where the queue length len is Th/Td, and Th is a transmission period of a heartbeat packet, and generally Th remains unchanged in the whole operation period; and Td is the shortest interval for the current real-time packet transmission. Obviously, the smaller Td is, the larger len is, and the longer queue consumes the longer computing resources and time; however, if Td is too large, len will be too small, and the number of elements in the queue too small may not satisfy the requirement of all sent data entering the queue for temporary storage: therefore, Td is set as the average value of the past m real-time data transmission intervals of the client, and m takes a value according to the system tracking condition; storing m times of sending interval values in an array, sending a newly generated sending interval into the array each time to replace the earliest interval value data, executing len to Th/Td after the array accumulates to m times of time intervals, obtaining a new len value as the length of a queue, and correspondingly adjusting and storing data packets stored in the queue; the value m can be an empirical value according to the actual condition of system operation, and is generally 3-5.
By adopting a dynamic adjustment mechanism for storing the queue in the embodiment, the setting of the queue length is more consistent with the real situation of the real-time data transmission of the current client: if the time interval is larger, the queue length is reduced to save system resources; if the time interval is small, the queue length is increased to accommodate the buffering requirement of more packets.
Example 7
On the basis of embodiment 6, the process of adjusting the data packets stored in the save queue includes:
when the new length of the save queue is increased compared with the original length, connecting the increased length unit to the head of the original queue, and setting a new queue head element; for example, if len is increased by k compared with the original queue length, then k units are newly added to connect to the head of the original queue, a new queue head element is set, and finally the queue length is extended to be n + k, and the queue growth is schematically shown in fig. 2
When the new length of the save queue is reduced compared to the original length, the reduced length is directly truncated from the head of the original queue and a new queue head element is set, for example, len is reduced by k compared to the original queue length, k elements are directly truncated from the head of the original queue and a new queue head element is set, and finally the queue length is compressed to n-k, and the queue reduction is schematically shown in fig. 3.
Example 8
On the basis of embodiment 7, the save queue is realized by a variable-length array or a linked list.
Example 9
On the basis of embodiment 8, as shown in fig. 1, the present invention further provides a data communication method capable of resuming at a breakpoint, including the following steps:
step 1, initializing a network socket of a client and initializing a data storage queue;
step 2, whether a new data packet is sent or not is judged, if yes, the current data packet is sent and the step 3 is carried out, and if not, the step 6 is carried out;
step 3, inserting the current data packet to be sent into the tail of the queue, moving the queue in sequence, enabling the data packet at the head of the queue to be out of the queue, and recording the past 1 time interval for sending the data packet;
step 4, judging whether the number of the recording time intervals reaches m, if so, entering step 5, otherwise, entering step 6;
step 5, calculating the average value of m time intervals, recalculating the queue length, adjusting the queue structure and the stored data packet according to the new queue length, and replacing the earliest recorded time interval value with the current time interval value;
and 6, judging whether a response data packet which is not received exists, if so, extracting the corresponding data packet from the data storage queue to transmit, otherwise, entering the step 2, and continuing to wait for a new data packet to transmit.
Example 10
On the basis of the example 9, the process of the step 5 is as follows: setting the length of a storage queue to len-Th/Td, wherein Th is the sending period of a heartbeat data packet of the client, and Td is the average value of the past m real-time data sending intervals of the client; after the time interval is accumulated for m times, executing len to Th/Td to obtain a new len value as the length of the queue, and correspondingly adjusting and storing the data packets stored in the queue; the process of adjusting the data packets stored in the queue comprises the following steps: when the new length of the save queue is increased compared with the original length, connecting the increased length unit to the head of the original queue, and setting a new queue head element; when the new length of the save queue is reduced compared with the original length, the reduced length is directly cut off from the head of the original queue, and a new queue head element is set.
The invention is not limited to the foregoing embodiments. The invention extends to any novel feature or any novel combination of features disclosed in this specification and any novel method or process steps or any novel combination of features disclosed. Those skilled in the art to which the invention pertains will appreciate that insubstantial changes or modifications can be made without departing from the spirit of the invention as defined by the appended claims.
All of the features disclosed in this specification, or all of the steps in any method or process so disclosed, may be combined in any combination, except combinations of features and/or steps that are mutually exclusive.
Any feature disclosed in this specification may be replaced by alternative features serving equivalent or similar purposes, unless expressly stated otherwise. That is, unless expressly stated otherwise, each feature is only an example of a generic series of equivalent or similar features.

Claims (8)

1. A data communication system capable of continuous transmission at a breakpoint is characterized by comprising a client and a server, wherein the client is communicated with the server, and a heartbeat mechanism is added in the client to monitor the network connection state of the client and the server; the client sends the data generated by the client to the server in real time, meanwhile, a storage queue is established in the client to store the sent data packets, and the server stores the successfully received data into a database according to the time sequence and returns a response data packet; the client judges whether a network fault occurs according to the condition of receiving the reply packet, searches for a data packet which is not successfully sent when the network fault occurs in the storage queue, and resends the data packet to finish breakpoint continuous transmission;
the length of the storage queue has a dynamic adjustment mechanism, and specifically includes: setting the length of a storage queue to be len = Th/Td, wherein Th is the sending period of a heartbeat data packet, Td is the average value of the past m real-time data sending intervals of the client, and m takes a value according to the system tracking condition; the m-times transmission interval value is stored in the array, each time a newly generated transmission interval is sent into the array to replace the earliest interval value data, after the m-times time interval is accumulated, len = Th/Td is executed to obtain a new len value as the length of the queue, and accordingly, the data packet stored in the queue is adjusted and stored.
2. The data communication system of claim 1, wherein the heartbeat mechanism is specifically: the client runs a heartbeat signal maintaining thread or process to realize that heartbeat packets are sent to the server end every Th seconds, waits for the server end to reply a predetermined response packet, and can judge that the current network connectivity is good and the program of the current server end works normally if the response packet is received within a specified timeout time; otherwise, the network is interrupted.
3. The data communication system according to claim 1, wherein the save queue is Q = (a)1,a2,…,an),a1The queue head element is the data packet entering the queue firstly; a isnThe queue tail element is the last data packet entering the queue; initializing n by saving the length of the queue; after the client side sends the real-time data packet each time, the sent data packet is inserted into the tail of the storage queue Q,the storage queue Q is filled after n data packets are sent by the client, the subsequent data packets sequentially enter the queue through the tail of the queue, and the data packets at the head of the queue are sequentially removed from the queue; each element in the save queue is accompanied by a transmit timestamp of the stored packet.
4. The data communication system according to claim 1, wherein the specific process of retransmission is: when the network connection is in a problem, the client does not receive a response data packet replied by the server, the client searches a data packet needing to be retransmitted in the storage queue Q, and the searched keyword is a timestamp for transmitting the data packet; if a plurality of unresponsive data packets exist, the client needs to perform the processes of searching and retransmitting for multiple times in the queue Q; the data packets sent by the retransmission process do not enter the holding queue.
5. The data communication system according to claim 4, wherein in the data packet retransmission process of breakpoint retransmission, when a client generates a new data packet transmission request, new data packet transmission is performed after the current retransmission data transmission is completed, and the new data packet is added to the tail of the queue.
6. The data communication system according to claim 1, wherein the adjusting the data packets stored in the save queue comprises:
when the new length of the save queue is increased compared with the original length, connecting the increased length unit to the head of the original queue, and setting a new queue head element;
when the new length of the save queue is reduced compared with the original length, the reduced length is directly cut off from the head of the original queue, and a new queue head element is set.
7. A data communications system according to claim 1, wherein the save queue is implemented by a variable length array or linked list.
8. A data communication method capable of breakpoint continuous transmission is characterized by comprising the following steps:
step 1, initializing a network socket of a client and initializing a data storage queue;
step 2, whether a new data packet is sent or not is judged, if yes, the current data packet is sent and the step 3 is carried out, and if not, the step 6 is carried out;
step 3, inserting the current data packet to be sent into the tail of the queue, moving the queue in sequence, enabling the data packet at the head of the queue to be out of the queue, and recording the past 1 time interval for sending the data packet;
step 4, judging whether the number of the recording time intervals reaches m, if so, entering step 5, otherwise, entering step 6;
step 5, calculating the average value of m time intervals, recalculating the queue length, adjusting the queue structure and the stored data packet according to the new queue length, and replacing the earliest recorded time interval value with the current time interval value;
step 6, judging whether a response data packet is not received, if so, extracting a corresponding data packet from the data storage queue to transmit, otherwise, entering the step 2, and continuing to wait for a new data packet to transmit;
the process of the step 5 is as follows: setting the length of a storage queue to be len = Th/Td, wherein Th is the transmission period of a heartbeat data packet of the client, and Td is the average value of the past m real-time data transmission intervals of the client; after the time interval is accumulated for m times, len = Th/Td is executed, a new len value is obtained to be used as the length of the queue, and accordingly, the data packets stored in the queue are adjusted and saved; the process of adjusting the data packets stored in the queue comprises the following steps: when the new length of the save queue is increased compared with the original length, connecting the increased length unit to the head of the original queue, and setting a new queue head element; when the new length of the save queue is reduced compared with the original length, the reduced length is directly cut off from the head of the original queue, and a new queue head element is set.
CN202011605724.0A 2020-12-30 2020-12-30 Data communication system and method capable of breakpoint continuous transmission Active CN112788113B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011605724.0A CN112788113B (en) 2020-12-30 2020-12-30 Data communication system and method capable of breakpoint continuous transmission

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011605724.0A CN112788113B (en) 2020-12-30 2020-12-30 Data communication system and method capable of breakpoint continuous transmission

Publications (2)

Publication Number Publication Date
CN112788113A CN112788113A (en) 2021-05-11
CN112788113B true CN112788113B (en) 2021-10-22

Family

ID=75753274

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011605724.0A Active CN112788113B (en) 2020-12-30 2020-12-30 Data communication system and method capable of breakpoint continuous transmission

Country Status (1)

Country Link
CN (1) CN112788113B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116133156A (en) * 2022-12-23 2023-05-16 珠海格力电器股份有限公司 A communication method, device and system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103595559A (en) * 2013-11-05 2014-02-19 深圳市远行科技有限公司 System and method for transmitting big data and service system thereof
CN109309730A (en) * 2018-10-31 2019-02-05 北京国信宏数科技有限责任公司 A kind of believable document transmission method and system

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9742651B2 (en) * 2015-03-05 2017-08-22 International Business Machines Corporation Client-side fault tolerance in a publish-subscribe system
CN107800521A (en) * 2017-09-23 2018-03-13 湖南胜云光电科技有限公司 A kind of data acquisition storage method of highly reliable free of losses

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103595559A (en) * 2013-11-05 2014-02-19 深圳市远行科技有限公司 System and method for transmitting big data and service system thereof
CN109309730A (en) * 2018-10-31 2019-02-05 北京国信宏数科技有限责任公司 A kind of believable document transmission method and system

Also Published As

Publication number Publication date
CN112788113A (en) 2021-05-11

Similar Documents

Publication Publication Date Title
US8537664B2 (en) Method and system for accelerating transmission of data between network devices
JP4902905B2 (en) Message transmission method, communication method, deferred acknowledgment communication system, and message transmission system
US6954797B1 (en) Data Communication method, terminal equipment, interconnecting installation, data communication system and recording medium
CN103259632B (en) Based on the continuous reliable assemblage method of radio sensing network data adopting patrilineal line of descent with only one son in each generation model
CN112436994B (en) Data transmission method and electronic equipment
CN101425977A (en) Air-ground data communication control system
CN112118171A (en) Message intercommunication system, method, device, computer equipment and readable storage medium
CN112788113B (en) Data communication system and method capable of breakpoint continuous transmission
CN105807734A (en) Multi-robot system control method and multi-robot system
CN103546917A (en) Data transmission method and device
US8943362B2 (en) Control and monitoring for fast millimeter-wave link using out-of-band wireless channel
CN111970346A (en) Internet of things data transmission method and system
CN112671924A (en) Method, system, computer program and storage medium for dynamically adjusting heartbeat mechanism time interval
CN113612737A (en) Long message reliable transmission method based on grouping and retransmission mechanism
CN113485176A (en) Vehicle data acquisition, caching and retransmitting method and remote monitoring terminal
CN113220652A (en) Multilink concurrent transmission method and system based on compression processing
CN104200641B (en) Data collection method based on energy audit
CN115277723B (en) Breakpoint-resume transmission method and system based on buffer events in edge acquisition history module
US20060251076A1 (en) Real-time and reliable method for transporting data
CN116436570A (en) Data transmission method, device, equipment and computer readable storage medium
GB2398214A (en) Deferred acknowledgment communications
CN115001999A (en) A network state detection method in a wireless ad hoc network
CN104378778A (en) Method and system for communication between master station and slave station in Internet of Things and conversion gateway
JP5539161B2 (en) Data transmission method and multi-site data distribution method
CN115348207B (en) UDP-based master-slave NAT equipment flow table synchronization method and system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant