Packet Coding With Redundancy Control for Reliable Fast Delivery

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current communication protocols, such as TCP, face challenges in efficiently delivering data over modern Internet networks due to variability in network characteristics, leading to issues like long delays, interruptions in streaming, and inefficient bandwidth use, while alternative protocols like UDP may not ensure reliable data delivery.

Innovation Solution

A method for data communication that involves determining redundancy messages using error correcting codes, adjusting transmission limits based on delivery rates, and dynamically managing redundancy to ensure reliable and high-speed data transfer over diverse network types.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If TCP protocol is used for reliable data delivery, then data reliability is improved, but transmission speed and bandwidth efficiency deteriorate

Engineering Contradiction:
Improvedata delivery reliabilityVSAvoidtransmission speed
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent applies preliminary action by pre-calculating and injecting redundancy packets into the data stream before transmission. These redundancy packets are generated using error-correcting codes and embedded in the transmitted data flow, allowing the receiver to reconstruct lost packets without requiring retransmission requests. This proactive approach eliminates the reactive wait-time inherent in TCP's retransmission mechanism, thereby maintaining reliability while improving transmission speed.

Inventive Principle:
Principle #10Preliminary action

2Productivity

If UDP protocol is used for high-speed data transfer, then transmission speed is improved, but data delivery reliability deteriorates

Engineering Contradiction:
Improvetransmission speedVSAvoiddata delivery reliability
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent embeds redundancy information directly into the UDP data stream in advance, enabling the receiver to correct errors and reconstruct lost packets without requiring retransmission. This preliminary injection of error-correcting capability allows UDP to achieve both high speed and improved reliability simultaneously.

Inventive Principle:
Principle #10Preliminary action

3Productivity

If network coding is applied to improve bandwidth efficiency, then bandwidth utilization is improved, but protocol complexity increases

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

Solution Approach 1:

The patent implements a universal packet structure that simultaneously carries data, redundancy information, and error-correcting codes in a standardized format. This multi-functional packet design allows the same transmission mechanism to achieve bandwidth efficiency through network coding while keeping the protocol complexity manageable through standardization and reuse of common error-correcting code algorithms.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS11799586B2Packet coding based network communication
Publication Date: 2023.10.24 POWERBRIDGE IP PROTECTION LLC
  • US11799586B2 patent drawing
  • US11799586B2 patent drawing
  • US11799586B2 patent drawing

AI summary

A method for data communication between a first node and a second node includes forming one or more redundancy messages from data messages at the first node using an error correcting code and transmitting first messages from the first node to the second node over a data path, the transmitted first messages including the data messages and the one or more redundancy messages. Second messages are received at the first node from the second node, which are indicative of: (i) a rate of arrival at the second node of the first messages, and (ii) successful and unsuccessful delivery of the first messages. A transmission rate limit and a window size are maintained according to the received second messages. Transmission of additional messages from the first node to the second node is limited according to the maintained transmission rate limit and window size.