Packet Redundancy Elimination via Hash-Based Encoding Keys

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Cellular wireless networks face challenges in reducing redundant traffic due to the shared wireless communication medium, limited resources on mobile devices, and higher loss rates, which complicate the deployment of redundancy elimination techniques.

Innovation Solution

A method for encoding and decoding packets to reduce redundancy, using a cache synchronization mechanism and encoding keys represented as an 8B value, allowing for intra-user and inter-user redundancy reduction, even on mobile devices with limited resources, by identifying and removing matched regions from packets and inserting encoding keys, enabling efficient redundancy elimination across the air interface.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If redundancy elimination techniques are deployed at mobile devices to reduce redundant traffic, then traffic volume is reduced, but device complexity and resource consumption increase

Engineering Contradiction:
Improvetraffic volumeVSAvoiddevice complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The redundancy elimination process is segmented into distinct functional modules: a caching module that stores previous packets, a comparison module that identifies redundant regions using hash functions, and an encoding module that replaces redundant data with references. This segmentation allows the system to reduce traffic volume while managing device complexity through modular design, where each module performs a specific function independently.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system performs preliminary actions by pre-computing and storing hash values of packet regions in a cache before actual transmission occurs. When a new packet arrives, the hash comparison is performed against pre-stored hashes, enabling rapid identification of redundant content without requiring complex real-time analysis, thus reducing both traffic volume and computational complexity.

Inventive Principle:
Principle #10Preliminary action

2Productivity

If redundancy elimination is implemented in cellular wireless networks, then network capacity is improved, but synchronization complexity increases due to higher loss rates

Engineering Contradiction:
Improvenetwork capacityVSAvoidsynchronization complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system implements feedback mechanisms where the mobile device monitors transmission status and cache synchronization with the network. When packet loss occurs or synchronization is detected, the system adjusts its redundancy elimination strategy by requesting retransmission of specific packets or adjusting the cache content, thereby maintaining network capacity improvement while managing synchronization complexity through adaptive feedback control.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The network and mobile device maintain copies of packet caches independently, with each entity storing redundant information locally. This copying approach allows both sides to perform redundancy elimination autonomously without requiring constant real-time synchronization, thus improving network capacity while reducing synchronization complexity by allowing asynchronous operation with periodic cache updates.

Inventive Principle:
Principle #26Copying

3Quantity of substance

If packet regions are identified and removed to eliminate redundancy, then traffic volume is reduced, but processing time increases

Engineering Contradiction:
Improvetraffic volumeVSAvoidprocessing time
Core Design Contradiction:
Quantity of substanceVSLoss of time

Solution Approach 1:

The system replaces complex mechanical packet comparison operations with hash function computations. Instead of comparing entire packet contents byte-by-byte, the system computes hash values of packet regions and compares these compact representations. This substitution dramatically reduces processing time while maintaining effective redundancy detection, thus reducing traffic volume without significant processing time penalty.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Solution Approach 2:

The system applies different processing strategies to different regions of packets based on their redundancy characteristics. Frequently redundant regions (such as headers or common data patterns) are identified and targeted for hash-based comparison and compression, while unique regions are transmitted as-is. This local quality approach optimizes the balance between traffic reduction and processing time by focusing computational effort only where it provides maximum benefit.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS9030960B2Method and apparatus for reducing redundant traffic in communication networks
Publication Date: 2015.05.12 WSOU INVESTMENTS LLC
  • US9030960B2 patent drawing
  • US9030960B2 patent drawing
  • US9030960B2 patent drawing

AI summary

A capability is provided for reducing or even eliminating redundant traffic in cellular wireless networks. A method is provided for encoding a target packet in a manner for reducing redundancy of information in the target packet. The method includes identifying a region of the target packet that matches a region of a stored packet, removing, from the target packet, the identified region of the target packet from the target packet, and inserting, within the target packet, an encoding key comprising a hash of the stored packet. A method is provided for reconstructing a packet from an encoded packet that is encoded in a manner for reducing redundancy of information in a network. The method includes identifying an encoding key within the encoded packet, wherein the encoding key comprises a hash of a stored packet, retrieving the stored packet using the hash of the stored packet, removing the encoding key from the encoded packet, and inserting information from the stored packet within the encoded packet.