Packet Compressibility Estimation for Early Compression Bypass
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data compression algorithms face inefficiencies in processing packets that are poorly compressible, leading to increased processing requirements, delay, and potential expansion of packet size, which can increase link bandwidth requirements and negatively impact user experience.
Innovation Solution
A technique that estimates the compressed length of data packets incrementally, employing a delayed update of the arithmetic coder state to allow early termination of compression for incompressible packets, using a bit-cost table and heuristic compressibility tests to determine if packets should be sent uncompressed, thereby conserving processing power and avoiding packet expansion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If compression algorithms process all packets, then compressible data is reduced in size, but incompressible packets experience increased processing delay and potential expansion
Solution Approach 1:
The patent applies preliminary action by performing an initial compressibility assessment on packets before committing to full compression processing. The system evaluates packet characteristics and predicts compressibility in advance, allowing it to bypass compression for packets predicted to be incompressible, thus avoiding unnecessary processing delay while still applying compression to suitable candidates.
Solution Approach 2:
The patent utilizes parameter changes by dynamically adjusting the compression processing state based on predicted compressibility. When a packet is predicted to be incompressible, the system changes the processing parameter to skip compression entirely. This parameter change resolves the contradiction by preventing processing delay and potential expansion for incompressible packets while maintaining compression benefits for compressible ones.
2Productivity
If compression is applied to incompressible packets, then processing is performed, but packet size may expand increasing link bandwidth requirements
Solution Approach 1:
The patent performs preliminary compressibility prediction before compression processing to identify packets that would not benefit from compression. By assessing packet characteristics in advance and predicting low compressibility, the system bypasses the compression process for such packets, preventing packet expansion and unnecessary bandwidth consumption while maintaining productivity for compressible packets.
Solution Approach 2:
The system changes the processing parameter based on predicted compressibility, switching from compression mode to pass-through mode for incompressible packets. This parameter change prevents the harmful effect of packet expansion while preserving compression throughput for packets that are actually compressible, resolving the contradiction between productivity and packet size.
3Ease of operation
If compression processing is performed on all packets, then data transmission is handled, but processing power is wasted on incompressible packets
Solution Approach 1:
The patent applies preliminary action by implementing a compressibility prediction step before full compression processing. This preliminary assessment evaluates packet characteristics and predicts whether compression will be effective, allowing the system to skip compression for incompressible packets and thereby conserve processing power while maintaining ease of operation for compressible packets through automated decision-making.
Solution Approach 2:
The system dynamically changes the processing parameter based on predicted compressibility, switching between compression and non-compression modes. This parameter change optimizes processing power usage by applying compression only when beneficial, while preserving ease of operation through automated, context-aware processing decisions that require no manual intervention.
Data Source
AI summary
A network node includes a processor programmed to parse at least a portion of an input block having a plurality of segments, determine whether at least one of the plurality of segments matches a segment stored in a history buffer, and predict a compressibility of the input block based at least in part on whether at least one of the plurality of segments matches a segment stored in the history buffer.