Robust Header Compression (RoHC) compressors and decompressors are provided. A RoHC compressor includes a memory and a processor. The memory stores multiple contexts and multiple codes or program instructions. The processor executes the codes or the program instructions to perform the following steps: receiving a header flow; freeing at least one of the contexts when free space of the memory is insufficient; compressing the header flow; and transmitting the compressed header flow.
Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A Robust Header Compression (RoHC) compressor comprising: a memory configured to store a plurality of contexts in a linked list and store a plurality of codes or program instructions; and a processor coupled to the memory and configured to execute the codes or the program instructions to perform following steps: receiving a header flow; freeing a context corresponding to the first node of the linked list when free space of the memory is insufficient; compressing the header flow; and transmitting the compressed header flow.
This invention relates to Robust Header Compression (RoHC) systems, specifically addressing memory management challenges in compressing header flows. The problem solved is the efficient handling of memory constraints when compressing network packet headers, ensuring continuous operation even when memory resources are limited. The system includes a memory storing multiple contexts in a linked list structure and a processor executing instructions to manage these contexts. When available memory space is insufficient, the processor frees the context associated with the first node of the linked list, prioritizing older or less critical contexts to maintain system functionality. The processor then compresses incoming header flows and transmits the compressed data. The linked list structure allows dynamic context management, ensuring that memory is reused efficiently without disrupting ongoing compression operations. This approach prevents system crashes or performance degradation due to memory exhaustion, particularly in environments with limited resources, such as wireless or embedded systems. The invention optimizes header compression by balancing memory usage and processing efficiency, ensuring reliable data transmission under varying memory conditions.
2. A Robust Header Compression (RoHC) decompressor comprising: a memory configured to store a plurality of contexts and a plurality of codes or program instructions; and a processor coupled to the memory and configured to execute the codes or the program instructions to perform following steps: receiving a compressed header flow; selecting a target context among the contexts; transmitting a static negative-acknowledgement (static-NACK) for the target context among the contexts when the contexts are currently stored in the memory and free space of the memory is insufficient; freeing the target context; and decompressing and storing data of the header flow.
Network communication and data compression. This invention addresses the problem of insufficient memory during Robust Header Compression (RoHC) decompression, which can lead to data loss or decompression failures. A decompressor is provided, featuring a memory for storing multiple contexts and program instructions. A processor executes these instructions. The decompressor receives a compressed header flow. It selects a specific target context from the stored contexts. If the target context is already in memory and the available memory space is insufficient, the decompressor transmits a static negative-acknowledgement (static-NACK) for that target context. Subsequently, the target context is freed. Finally, the decompressor decompresses and stores the data from the received header flow. This process ensures that even with limited memory, critical contexts can be managed to allow for continued decompression.
3. The RoHC decompressor of claim 2 , wherein the contexts are stored in a linked list, and the step of freeing the target context comprises: freeing a context corresponding to the first node of the linked list.
The invention relates to a method for managing context storage in a Robust Header Compression (RoHC) decompressor, specifically addressing the efficient allocation and deallocation of context memory to optimize performance and reduce overhead. In RoHC systems, contexts are used to store state information for compressed data streams, and managing these contexts efficiently is critical for maintaining low latency and minimizing memory usage. The invention describes a RoHC decompressor that stores contexts in a linked list structure, where each context is associated with a node in the list. When a target context needs to be freed, the decompressor specifically frees the context corresponding to the first node of the linked list. This approach ensures that the oldest or least recently used context is removed first, preventing memory exhaustion and maintaining optimal performance. The linked list structure allows for efficient traversal and management of contexts, enabling quick identification and removal of the target context. This method is particularly useful in environments where memory resources are constrained, such as in wireless communication systems or embedded devices, where efficient context management is essential for reliable operation. The invention improves upon existing RoHC decompressors by providing a systematic and predictable way to free contexts, reducing the risk of memory leaks and ensuring consistent performance.
4. A Robust Header Compression (RoHC) compressor comprising: a memory configured to store a plurality of contexts and a plurality of codes or program instructions; and a processor coupled to the memory and configured to execute the codes or the program instructions to perform following steps: receiving a feedback specifying a first context from a RoHC decompressor, the feedback indicating insufficient memory space at the RoHC decompressor; receiving a header flow; and compressing the header flow using a second context corresponding to the header flow when the second context exists in the memory and the second context is different from the first context.
Robust Header Compression (RoHC) is a technique used to reduce the overhead of packet headers in communication networks, particularly in environments with limited bandwidth. A key challenge in RoHC is managing memory constraints at the decompressor, where insufficient space can lead to context loss and compression failures. This invention addresses this problem by introducing a RoHC compressor that dynamically adapts to memory limitations at the decompressor. The compressor includes a memory storing multiple contexts and associated codes or program instructions, along with a processor to execute these instructions. The system receives feedback from the RoHC decompressor indicating insufficient memory space, specifying a first context that cannot be retained. Upon receiving a header flow, the compressor checks if a second context exists in its memory that matches the header flow and differs from the first context. If such a context is found, the compressor uses it to compress the header flow, avoiding conflicts with the decompressor's memory constraints. This approach ensures efficient compression while respecting the decompressor's limited resources, improving reliability in constrained environments. The solution is particularly useful in wireless and low-bandwidth networks where header compression is critical for performance.
5. The RoHC compressor of claim 4 further comprising: when the second context corresponding to the header flow exists in the memory and the second context is identical to the first context, data of the header flow is transmitted using an uncompressed profile.
This invention relates to a Robust Header Compression (RoHC) system for optimizing data transmission in communication networks. The problem addressed is the inefficiency in header compression when identical contexts for header flows already exist in memory, leading to redundant processing and potential performance degradation. The system includes a RoHC compressor that processes header flows by comparing a first context derived from a current header flow with a second context stored in memory. If the second context exists and matches the first context, the compressor transmits the header flow data using an uncompressed profile instead of compressing it. This avoids unnecessary compression operations when the context is already known, reducing computational overhead and improving transmission efficiency. The compressor may also include a memory for storing contexts associated with header flows and a comparator for determining context matches. The uncompressed profile ensures that the header flow data is sent in its original form when no further compression is needed, maintaining data integrity while optimizing processing resources. This approach is particularly useful in environments where header flows are frequently repeated, such as in real-time communication or streaming applications. The system enhances network performance by minimizing redundant compression operations while ensuring reliable data transmission.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
December 24, 2019
February 1, 2022
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.