Twisted Tabulation Hashing for Router Data Loss

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing data network routers face performance bottlenecks due to hash tables struggling to keep pace with internet traffic, leading to data loss and potential security vulnerabilities from adversarial attacks, as conventional hashing techniques require secondary hashing that complicates implementation and slows down queries.

Innovation Solution

The implementation of a robust hash function, such as twisted tabulation, which provides strong robustness guarantees by maintaining simplicity and efficiency, allowing for short-range amortization and reducing the need for secondary hashing, thereby ensuring constant-time operations even under adversarial conditions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If conventional hashing techniques are used in routers, then implementation is straightforward, but performance deteriorates under high traffic conditions leading to data loss

Engineering Contradiction:

Improvehash table throughputVSAvoiddata loss rate

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The patent changes the fundamental parameter of the hashing algorithm from conventional hashing to twisted tabulation hashing. This parameter change enables the hash table to achieve optimal worst-case performance guarantees, allowing it to handle high traffic volumes without data loss by ensuring that hash operations complete in constant time regardless of traffic conditions or adversarial attacks.

Inventive Principle:

Principle #35Parameter changes

2Speed

If conventional hashing techniques are used, then implementation is simple, but query speed decreases due to requirement for secondary hashing

Engineering Contradiction:

Improvequery processing speedVSAvoidhashing implementation complexity

Core Design Contradiction:

SpeedVSDevice complexity

Solution Approach 1:

The patent extracts and eliminates the need for secondary hashing from the conventional hashing approach. By using twisted tabulation hashing, the system achieves robust performance guarantees without requiring the additional hashing layer, thereby improving query processing speed while maintaining implementation simplicity through a single, well-defined hashing function.

Inventive Principle:

Principle #2Taking out (Extraction)

3Productivity

If hash tables operate at high speed, then productivity increases, but vulnerability to adversarial attacks increases

Engineering Contradiction:

Improvedata processing throughputVSAvoidadversarial attack susceptibility

Core Design Contradiction:

ProductivityVSObject-affected harmful factors

Solution Approach 1:

The patent employs a disposable random oracle function that is re-randomized periodically. This approach provides strong security guarantees against adversarial attacks while maintaining high processing throughput. The random oracle is inexpensive to compute and can be re-randomized without impacting performance, effectively neutralizing threats from malicious inputs while preserving productivity.

Inventive Principle:

Principle #27Cheap short-living objects (Disposable)

Data Source

PatentUS9189416B2Methods, systems and products for hashing using twisted tabulation

Publication Date: 2015.11.17 AT&T INTELLECTUAL PROPERTY I L P

AI summary

Methods, systems, and products describe a robust solution for the dictionary problem of data structures. A hash function based on tabulation is twisted to utilize an additional xoring operation and a shift. This twisted tabulation offers strong robustness guarantees over a set of queries in both linear probing and chaining.