Data Packet Segmentation for Lower Compression Delay
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In traditional storage systems, large data packets lead to longer compression delays, reducing compression efficiency due to increased processing time, which is not proportional to smaller data packets, affecting overall system performance.
Innovation Solution
A method that compares the size of a data packet to a threshold size, dividing it into smaller packets if it exceeds this threshold to reduce compression delay without affecting data quality or compatibility, using a processor and memory with instructions to manage this process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If large data packets are compressed directly, then compression processing delay increases, but compression quality is maintained
Solution Approach 1:
The patent divides a large data packet into multiple smaller data packets before compression processing. This segmentation allows each small packet to be compressed independently and in parallel, significantly reducing the total compression delay while maintaining overall compression efficiency. The large packet is split into segments that can be processed simultaneously by multiple compression units.
2Loss of time
If data packets are divided into smaller packets, then compression delay is reduced, but system complexity increases
Solution Approach 1:
The system segments both the data packets and the compression processing units. Each small data packet is assigned to a dedicated compression unit for parallel processing. This segmentation strategy reduces compression delay through parallelism while managing system complexity by creating a structured, scalable architecture where complexity is distributed across multiple independent units rather than concentrated in a single complex processor.
3Quantity of substance
If large data packets are compressed, then data throughput is maintained, but compression efficiency decreases
Solution Approach 1:
The patent segments large data packets into smaller units that can be compressed in parallel while maintaining the same total data throughput. By processing multiple small packets simultaneously through multiple compression units, the system achieves both high throughput and high compression efficiency, eliminating the trade-off between these two parameters.
Solution Approach 2:
The patent merges multiple compression operations on small packets into a unified parallel processing framework. By combining the compression results of multiple small packets, the system achieves the same throughput as compressing a large packet while significantly improving compression efficiency through parallel execution and reduced processing delay.
Data Source
AI summary
Embodiments of the present disclosure provide a method, an electronic device, and a computer program product for data compression. The method includes: comparing the size of a first data packet to be compressed with a first threshold size; if the size of the first data packet is greater than the first threshold size, determining at least two second data packets from the first data packet, wherein the size of each second data packet is less than a second threshold size; and respectively compressing the at least two second data packets. In this way, the delay of data compression can be shortened.