Packet Data Compression Using Prefix Prediction Across Packets

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current data compression methods for packet data across communication networks are inefficient as they rely solely on data within each packet, limiting the degree of compression and network performance.

Innovation Solution

The system generates a sorted prefix array based on previously transferred packet data, allowing for predictive compression and decompression by replacing literal data with rank values, and using arithmetic encoding to enhance compression accuracy.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If data compression is performed using only data within each packet, then the compression process is simple and independent, but the degree of compression is limited

Engineering Contradiction:
Improvecompression process complexityVSAvoiddegree of compression
Core Design Contradiction:
Device complexityVSQuantity of substance

Solution Approach 1:

The patent combines multiple packets into a single data stream for compression processing. Instead of compressing each packet independently, the system merges the data from multiple packets and applies compression algorithms to the combined stream, enabling cross-packet pattern recognition and significantly increasing the degree of compression while maintaining manageable process complexity through stream-based processing.

Inventive Principle:
Principle #5Merging (Combining)

2Ease of manufacture

If data is compressed by identifying repeated patterns within single packets, then the compression method is straightforward, but network performance improvement is limited

Engineering Contradiction:
Improvecompression method simplicityVSAvoidnetwork performance
Core Design Contradiction:
Ease of manufactureVSProductivity

Solution Approach 1:

The patent transitions from one-dimensional compression (within single packets) to multi-dimensional compression by combining data from multiple packets into a unified data stream. This dimensional change allows the compression algorithm to identify patterns across packet boundaries, leveraging statistical redundancies that span multiple packets and thereby significantly improving network performance while maintaining algorithmic simplicity through stream-based processing.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

3Device complexity

If packet data is compressed without considering previously transferred data, then the compression is independent and simple, but compression accuracy is reduced

Engineering Contradiction:
Improvecompression independenceVSAvoidcompression accuracy
Core Design Contradiction:
Device complexityVSMeasurement precision

Solution Approach 1:

The patent implements preliminary action by buffering and storing previously transferred packet data before performing compression. The system maintains a data stream that includes historical packet data, allowing compression algorithms to analyze patterns across multiple packets and improve prediction accuracy. This preliminary data accumulation enables more accurate compression while managing complexity through structured stream processing and selective data retention.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS8929402B1Systems and methods for compressing packet data by predicting subsequent data
Publication Date: 2015.01.06 HEWLETT PACKARD ENTERPRISE DEV LP
  • US8929402B1 patent drawing
  • US8929402B1 patent drawing
  • US8929402B1 patent drawing

AI summary

A system, method, and computer program for compressing packet data is provided. In exemplary embodiments, one or more prefix arrays may be generated for retrieved data, and used as the basis for predicting subsequent data. The packet data may be compressed based, at least partially, on the predicted subsequent data. Accordingly, the compressed packet data may be transferred over a communication network.