Instructions stored on a computer-readable medium include, in response to receiving a new message for transmission, generating a candidate message by attempting recovery of a previous message from the new message and recovery bits of the previous message. The instructions include, in response to an indicator indicating that the attempted recovery was successful, computing a delta between the new message and the candidate message and generating a delivery message based on the computed delta. The instructions include, in response to the indicator indicating that the attempted recovery was unsuccessful, generating the delivery message based on the new message exclusive of the computed delta. The instructions include calculating new recovery bits from the new message. The instructions include storing the new recovery bits as the recovery bits of the previous message. The instructions include transmitting the delivery message to a destination over a communications channel.
Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
2. The computer-readable medium of claim 1 wherein storing the new recovery bits includes replacing the recovery bits of all previous messages.
A system and method for managing recovery bits in a communication protocol involves storing new recovery bits for a current message while replacing the recovery bits of all previously received messages. The system includes a receiver that processes incoming messages, each containing data and associated recovery bits used for error detection or correction. When a new message is received, the system stores its recovery bits and discards the recovery bits from all prior messages. This ensures that only the most recent recovery bits are retained, reducing memory usage and computational overhead. The system may also include a transmitter that sends messages with recovery bits, and a storage module that manages the retention and replacement of these bits. The method involves receiving a message, extracting its recovery bits, and replacing any previously stored recovery bits with the new ones. This approach is particularly useful in environments where memory resources are limited, or where only the latest error recovery information is relevant. The system may be implemented in hardware, software, or a combination thereof, and may be used in various communication protocols, including those in wireless networks, data transmission systems, or error-correcting code applications.
4. The computer-readable medium of claim 3 wherein the instructions further include setting the indicator to indicate that the attempted recovery was unsuccessful in response to a failure to generate the candidate message.
This invention relates to error recovery in computer systems, specifically for handling failures in message generation during recovery processes. The problem addressed is the need for a reliable mechanism to track and indicate whether an attempted recovery operation was successful or not, particularly when generating a candidate message fails. The system involves a computer-readable medium storing instructions that, when executed, perform a recovery process. If the recovery process fails to generate a candidate message, an indicator is set to reflect this failure. This indicator can be used by other system components to determine the outcome of the recovery attempt. The instructions may also include steps to generate the candidate message by applying a transformation to a stored message, where the transformation is based on a recovery policy. The recovery policy defines rules for modifying the stored message to produce a valid candidate message. If the transformation fails, the indicator is updated to show the recovery attempt was unsuccessful. This ensures that downstream processes are aware of the failure and can take appropriate action, such as retrying the recovery or triggering alternative error-handling procedures. The invention improves system reliability by providing clear feedback on recovery outcomes, allowing for more robust error management.
5. The computer-readable medium of claim 4 wherein the instructions further include skipping calculating the candidate checksum in response to the failure to generate the candidate message.
This invention relates to data processing systems that verify message integrity using checksums. The problem addressed is the computational overhead and inefficiency in systems that generate checksums for messages, even when message generation itself fails, leading to unnecessary processing. The system includes a computer-readable medium storing instructions for a checksum verification process. The instructions include generating a candidate message from a data source, such as a database or file, and calculating a candidate checksum for the candidate message. The system then compares the candidate checksum to a reference checksum to determine if the candidate message is valid. If the candidate message cannot be generated, the system skips the step of calculating the candidate checksum, avoiding wasted computational resources. This selective checksum calculation improves efficiency by preventing unnecessary processing when message generation fails. The system may also include additional steps such as retrieving the reference checksum from a storage location, determining whether the candidate message matches the reference checksum, and taking corrective actions if the checksums do not match. The selective skipping of checksum calculation ensures that resources are only used when necessary, optimizing system performance.
6. The computer-readable medium of claim 1 wherein the attempted recovery of the previous message is performed using an error-correcting code.
This invention relates to data recovery in computer systems, specifically for recovering lost or corrupted messages in a communication protocol. The problem addressed is the loss or corruption of messages during transmission or storage, which can disrupt system operations. The invention provides a method for recovering a previous message when a new message is received, using an error-correcting code to ensure accurate reconstruction. The system includes a message buffer for storing received messages and a recovery module that detects message loss or corruption. When a message is lost or corrupted, the recovery module retrieves the previous message from the buffer and applies an error-correcting code to reconstruct the lost or corrupted message. The error-correcting code allows for the detection and correction of errors, ensuring data integrity. The system may also include a synchronization mechanism to align message sequences and prevent further errors. This approach improves reliability in communication protocols by enabling automatic recovery of lost or corrupted messages without manual intervention. The invention is particularly useful in systems where message integrity is critical, such as in industrial control systems, financial transactions, or real-time data processing.
7. The computer-readable medium of claim 6 wherein the instructions further include generating the new recovery bits from the new message using the error-correcting code.
This invention relates to error correction in data storage systems, specifically improving recovery of corrupted data using error-correcting codes. The problem addressed is the need for efficient and reliable data recovery when errors occur in stored messages, particularly in systems where data integrity is critical. The invention involves a method for recovering corrupted data by generating new recovery bits from a new message using an error-correcting code. The system first identifies corrupted portions of a stored message by comparing it with a reference message. It then reconstructs the corrupted portions by applying the error-correcting code to the new message, which may include updated or corrected data. The recovery bits generated from the new message are used to replace or supplement the corrupted portions, ensuring data integrity. The error-correcting code is applied to the new message to produce recovery bits that can correct errors in the stored message. This process ensures that even if the original message is partially corrupted, the system can reconstruct the missing or erroneous data using the new message and the error-correcting code. The method is particularly useful in systems where data must be frequently updated or corrected, such as in databases or communication systems, where maintaining data accuracy is essential. The invention improves reliability by leveraging the error-correcting code to dynamically generate recovery bits from updated data, reducing the risk of data loss or corruption.
9. The computer-readable medium of claim 1 wherein attempting recovery includes concatenating the new message with at least some of the recovery bits of the previous message to generate a combined message and attempting recovery from the combined message.
This invention relates to error recovery in digital communication systems, particularly for recovering corrupted or incomplete messages by leveraging redundancy from previous transmissions. The problem addressed is the loss or corruption of data during transmission, which can disrupt communication if not properly recovered. The solution involves a method for recovering a corrupted message by combining it with recovery bits from a previously transmitted message. When a new message is received in a corrupted state, the system attempts recovery by concatenating the new message with at least some of the recovery bits from the previous message, forming a combined message. The system then attempts to recover the original data from this combined message, improving the likelihood of successful recovery by utilizing redundancy from prior transmissions. This approach is particularly useful in systems where messages are transmitted sequentially and where some redundancy is inherent in the communication protocol. The method enhances reliability by leveraging historical data to reconstruct corrupted messages, reducing the need for retransmission and improving overall communication efficiency.
10. The computer-readable medium of claim 1 wherein generating the delivery message based on the new message includes generating a wrapper delta including the new message and incorporating the wrapper delta into the delivery message.
This invention relates to efficient data transmission in computer networks, particularly for updating or delivering messages in a system where multiple messages are exchanged. The problem addressed is the inefficiency of transmitting entire messages repeatedly, especially when only small portions of the message have changed. The solution involves generating a compact representation of changes, called a "wrapper delta," which contains only the new or modified parts of a message. This wrapper delta is then incorporated into a delivery message, reducing the amount of data transmitted compared to sending the full message. The system ensures that the recipient can reconstruct the complete updated message by combining the wrapper delta with previously received data. This approach is useful in applications like real-time communication, distributed systems, or any scenario where minimizing bandwidth usage is critical. The invention optimizes network performance by avoiding redundant data transmission while maintaining message integrity.
11. The computer-readable medium of claim 1 wherein the delivery message generated based on the computed delta includes the computed delta and excludes unmodified portions of the new message.
A system and method for efficient message delivery in a communication network addresses the problem of bandwidth and processing overhead when transmitting updated messages. The invention computes a delta, or difference, between a new message and a previously transmitted message. The delta represents only the changes made to the message, rather than the entire message content. A delivery message is then generated that includes only the computed delta, excluding any unmodified portions of the new message. This reduces the amount of data transmitted, conserving bandwidth and processing resources. The system may also include a receiver that reconstructs the full updated message by applying the received delta to the previously transmitted message. The method is particularly useful in scenarios where messages are frequently updated, such as in real-time communication systems, collaborative editing environments, or distributed databases. The invention ensures that only the necessary changes are transmitted, improving efficiency without compromising data integrity. The system may further include validation mechanisms to ensure the delta is correctly applied and that the reconstructed message matches the intended new message. This approach minimizes redundant data transmission while maintaining synchronization between communicating parties.
12. The computer-readable medium of claim 1 wherein the communications channel is lossy.
A system and method for data transmission over lossy communications channels involves encoding data into a sequence of symbols, where each symbol is selected from a predefined set of symbols. The encoding process ensures that the sequence of symbols can be decoded even if some symbols are lost or corrupted during transmission. The system includes a transmitter that encodes the data and transmits the encoded symbols over a lossy channel, and a receiver that decodes the received symbols to reconstruct the original data. The encoding scheme may use error correction techniques, such as forward error correction, to mitigate the effects of symbol loss or corruption. The system is particularly useful in environments where communication reliability is compromised, such as wireless networks, satellite communications, or other channels prone to interference or signal degradation. The method ensures robust data transmission by leveraging redundancy and error detection mechanisms to recover lost or corrupted symbols, thereby improving data integrity and reliability in lossy communication environments.
14. The computer-readable medium of claim 13 wherein the instructions further include replacing the prior received message with the output message.
A system and method for processing messages in a computing environment involves receiving a message from a sender, analyzing the message to determine its content and context, and generating an output message based on the analysis. The system may modify the original message by replacing it with the output message, ensuring that the sender or recipient receives an updated or transformed version of the original content. The analysis may include natural language processing, sentiment analysis, or other techniques to assess the message's meaning, tone, or relevance. The output message may be a revised version of the original, a summary, a translation, or a filtered version that removes or alters certain elements. The system may also track message history, allowing for comparisons between the original and modified versions. This approach is useful in applications such as email filtering, chatbot interactions, or automated customer support, where message content needs to be dynamically adjusted for clarity, compliance, or efficiency. The replacement of the original message ensures that only the processed version is retained, preventing inconsistencies or misinterpretations.
15. The computer-readable medium of claim 13 wherein the delivery message includes a type indication denoting whether the delivery message includes the delta or the entire message.
A system and method for optimizing data delivery in a messaging or communication network addresses the problem of inefficient bandwidth usage when transmitting messages, particularly in scenarios where only incremental updates (deltas) are needed rather than full message retransmissions. The invention involves a computer-readable medium storing instructions for generating and transmitting delivery messages that include either a delta (partial update) or the entire message, depending on the context. The delivery message includes a type indication that explicitly denotes whether the content is a delta or a full message, allowing the receiving system to correctly interpret and process the data. This approach reduces unnecessary data transmission, conserving bandwidth and improving efficiency in communication systems. The system may also include mechanisms for determining whether a delta or full message is appropriate based on factors such as message size, network conditions, or prior transmission history. The invention is particularly useful in applications where frequent updates are required, such as real-time collaboration tools, distributed databases, or software synchronization systems. By dynamically selecting between deltas and full messages, the system ensures optimal performance while minimizing resource consumption.
17. The system of claim 16 wherein the recovery bit calculation module is configured to replace the recovery bits of all previous messages when storing the new recovery bits.
A system for data recovery in communication networks addresses the problem of message corruption during transmission. The system includes a recovery bit calculation module that generates recovery bits for error detection and correction. These recovery bits are used to reconstruct corrupted messages by identifying and repairing errors. The system also includes a storage module that retains the recovery bits for multiple messages to enable recovery of previously transmitted data. In this system, the recovery bit calculation module is configured to replace the recovery bits of all previous messages when storing new recovery bits. This ensures that the storage module only contains the most recent recovery bits, optimizing storage efficiency and reducing the computational overhead associated with maintaining outdated recovery data. The system may also include a transmission module that sends messages and their corresponding recovery bits to a receiver, and a receiver module that processes incoming messages and uses the recovery bits to detect and correct errors. The system is particularly useful in environments where message integrity is critical, such as in industrial control systems, aerospace communications, and other applications where data reliability is essential.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
July 2, 2021
December 20, 2022
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.