A data communication system and method capable of resumed data transmission
A data communication system, a technology of continuous transmission from breakpoints, applied in the field of data communication, which can solve the problems of time-consuming, low efficiency, and multiple bandwidth resources.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0031]A data communication system capable of resuming transmission from breakpoints, including communication between the client and the server, and communication between the client and the server. A heartbeat mechanism is added to the client to monitor the network connection status between the client and the server; Send to the server, and at the same time establish a save queue in the client to save the sent data packets, the server will store the successfully received data in the database in chronological order and return the response data packet; the client judges whether there is In the case of a network failure, find the data packets that were not sent successfully when the network failure occurred in the storage queue, and resend to complete the resuming of the breakpoint.
[0032] In this embodiment, the client runs the production data sending thread (or process), and sends the current production data after each job step ends. Since the job steps are carried out in chro...
Embodiment 2
[0036] On the basis of Embodiment 1, the heartbeat mechanism is specifically: the client runs a heartbeat signal to maintain a thread or process to send a heartbeat packet to the server every Th seconds, and waits for the server to reply to a pre-agreed response packet. If a response packet is received within the specified timeout period, it can be judged that the current network connectivity is good, and the current server-side program is working normally; otherwise, it means that the network is interrupted; the specified timeout period can be set according to requirements.
Embodiment 3
[0038] On the basis of embodiment 2, the storage queue is Q=(a 1 ,a 2 ,...,a n ),a 1 It is the head element of the queue, which is the first packet to enter the queue; a n is the tail element of the queue, which is the last data packet entering the queue. In addition to the content of the data packet itself, each queue element is also attached with the sending timestamp of the data packet. In order to ensure that the implementation of each element ai in the queue is convenient and feasible, the size of a single element in the queue is set to the maximum number of bytes of the sent data packet, and the length of the queue is saved at the same time to initialize n; the client sends a real-time data packet each time , the data packets sent will be inserted into the tail of the storage queue Q, and the storage queue Q will be filled after the client sends n data packets, and the subsequent data packets will enter the queue sequentially through the tail of the queue, and the dat...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



