Packet-Based File Compression for Secure Selective Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless user equipment (UE) technologies face challenges in efficiently compressing and storing media files, such as images and videos, which consume significant storage and resources, and lack effective methods to protect compressed data from unauthorized access.
Innovation Solution
The implementation of packet-based conversion techniques that compress files into packet-sized sections, using pattern designs and pointers to arrange and decompress data, allowing for efficient storage and retrieval while maintaining security by requiring knowledge of packet size for access.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If traditional file compression methods are used, then file size is reduced, but storage security is compromised because the entire file must be decompressed to access individual files
Solution Approach 1:
The patent divides files into discrete packet-sized sections (e.g., 512 bytes or 1 KB packets) that are independently compressed and stored. This segmentation allows individual packets to be extracted without decompressing the entire file, providing both space efficiency and security. The file is broken into multiple independent units that can be selectively accessed.
Solution Approach 2:
The patent extracts only the necessary packet-sized portions of compressed data needed for specific files. By using pointers that reference specific packet locations within the compressed stream, the system can extract individual files or selected packets without processing the complete compressed file, enhancing both efficiency and security.
2Ease of operation
If multiple files are stored separately, then file access is simple, but storage efficiency is reduced due to redundant compression overhead
Solution Approach 1:
The patent merges multiple files into a single compressed packet stream while maintaining the ability to individually access each file through pointers. The compression algorithm processes multiple files sequentially, creating a unified compressed structure that eliminates redundant compression overhead while preserving individual file accessibility through packet pointers and file metadata.
3Quantity of substance
If compression algorithms are applied to entire files, then compression ratio is optimized, but processing time increases significantly
Solution Approach 1:
The patent applies compression to packet-sized portions of files rather than entire files, performing partial compression actions. This approach achieves sufficient compression ratios for small packets while dramatically reducing processing time. The system processes data in manageable chunks (e.g., 512-byte or 1-KB packets) that can be compressed and stored independently, avoiding the computational burden of compressing large files in one operation.
Data Source
AI summary
A system described herein may provide a technique for compressing sets of files using a packet-based conversion algorithm. The algorithm may compress and decompress files using a packet-based approach, whereby packet-sized sections of file data are compressed and arranged in a specified order such that the sections may be retrieved, decompressed, and reassembled to restore the original files as needed. The packet-based approach may allow for the size of a file set to be dramatically reduced, while the resulting compressed data may not be easily accessed by unauthorized entities. Compression and decompression may utilize a pointer associated with each file in the set of files. The pointer may be generated based on data associated with a file, such as file name, size, and/or other attributes or metadata. The compressed packets may be arranged relative to the pointer within a compressed file such that the packets may be identified and decompressed.