Multipath Galois Packet Coding for Low-Latency Reliable Networking

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current computer networking technologies face challenges in achieving both low latency and high reliability while efficiently utilizing bandwidth, particularly over long distances and in wireless communication links, due to issues like packet loss, high computational complexity, and transmission overhead in random linear network coding systems.

Innovation Solution

The Multipath Asynchronous Galois Information Coding (MAGIC) system uses a server to generate random superpositions of packet fragments encoded in a Galois field, transmitted over multiple communication lines, allowing clients to decode received superpositions and provide preemptive error correction, thereby simplifying coordination and improving bandwidth utilization.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If random linear network coding is used to transmit data over multiple communication lines, then bandwidth utilization is improved, but computational complexity increases due to Gauss-Jordan elimination methods required for decoding

Engineering Contradiction:
Improvebandwidth utilizationVSAvoidcomputational complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent changes the mathematical field parameter from real numbers to Galois field GF(2^8), which transforms the decoding operation from complex Gauss-Jordan elimination to simple bitwise XOR operations. This parameter change maintains bandwidth utilization benefits while dramatically reducing computational complexity

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent substitutes the mechanical computational process of Gauss-Jordan elimination with a simpler algebraic operation in Galois field. The decoding mechanism is replaced from iterative numerical methods to direct field arithmetic operations, reducing computational overhead

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

2Reliability

If random linear network coding is used to overcome packet loss, then reliability is improved, but transmission overhead increases due to large coefficient vectors attached to encoded blocks

Engineering Contradiction:
Improvepacket loss recoveryVSAvoidtransmission overhead
Core Design Contradiction:
ReliabilityVSLoss of substance

Solution Approach 1:

The patent changes the coefficient representation from large real-number vectors to compact Galois field elements (8-bit values). This parameter change maintains the ability to recover from packet loss while reducing the size of transmitted coefficient data by an order of magnitude

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent uses disposable one-time pad coefficients generated from Galois field operations instead of reusable large coefficient vectors. Each encoded block uses fresh random coefficients from the finite field, reducing transmission overhead while maintaining security and reliability

Inventive Principle:
Principle #27Cheap short-living objects (Disposable)

3Reliability

If wired communication links are used to ensure reliability and bandwidth, then packet loss is reduced, but latency increases due to slower speed of light in fiber and longer physical paths

Engineering Contradiction:
Improvepacket loss rateVSAvoidlatency
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent implements dynamic path selection and adaptive encoding that responds to real-time network conditions. The system dynamically adjusts which communication lines are used and how data is encoded, allowing it to exploit low-latency wireless paths when available while maintaining reliability through redundant transmission over multiple paths

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent performs preliminary encoding and redundancy insertion before transmission, creating multiple encoded versions of the data that can be recovered from any subset of transmitted packets. This preliminary action allows the system to use faster wireless links without sacrificing reliability, as error recovery is already built into the encoded structure

Inventive Principle:
Principle #10Preliminary action

4Loss of time

If wireless communication links are used to reduce latency, then speed of light is achieved, but reliability decreases due to packet loss from hardware failure, environmental factors, and network congestion

Engineering Contradiction:
ImprovelatencyVSAvoidpacket loss rate
Core Design Contradiction:
Loss of timeVSReliability

Solution Approach 1:

The patent segments the data transmission into multiple independent encoded blocks that can be transmitted over different wireless links simultaneously. Each block is independently encoded with redundancy, allowing the receiver to reconstruct the original data from any sufficient subset of received blocks, thereby achieving both low latency and high reliability

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements feedback mechanisms where the receiver sends acknowledgments about which encoded blocks were successfully received. The transmitter uses this feedback to determine which blocks need retransmission or can be replaced with new encoded blocks, optimizing the use of unreliable wireless channels while maintaining data integrity

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS10958530B1Networking systems and methods using multipath asynchronous Galois information coding
Publication Date: 2021.03.23 JUMP ALGORITHMS LLC
  • US10958530B1 patent drawing
  • US10958530B1 patent drawing
  • US10958530B1 patent drawing

AI summary

A system for transmitting information over a network may include a server that generates random superpositions each including multiple packet fragments encoded using a Galois field and transmits them over multiple communication links to a client device. The packet fragments may be a plurality of fixed-size vectors that define the information to be transmitted. The server also may select a subset of the fixed-size vectors based on heuristics and generate a coefficient for each of the selected vectors. The coefficients may include any natural number. The superposition may be a sum of the selected fixed-size vectors multiplied by their associated coefficients. The server may repeat the process until the client acknowledges receipt of the information or another condition is met. The client device may then decode the received superposition, such as by solving the set of linear equations represented by the received superpositions. Other implementations also are described.