Adaptive Network Coding With Sliding Window For Packet Loss

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Traditional routing networks face issues with packet loss due to congestion and corruption, leading to wasted resources, reduced throughput, and increased delays, as entire packets are often dropped at intermediate nodes, necessitating retransmission.

Innovation Solution

The implementation of adaptive network coding with a sliding window, where packets are divided into significance-level-based chunks, allowing intermediate nodes to perform a 'packet wash' by dropping less significant chunks during congestion, and the source node transmits replacement chunks within a sliding window to ensure data integrity and efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional routing networks forward entire packets, then data integrity is maintained, but network resources are wasted and throughput is reduced when packet loss occurs

Engineering Contradiction:

Improvedata integrityVSAvoidnetwork throughput

Core Design Contradiction:

ReliabilityVSProductivity

Solution Approach 1:

The patent segments the payload into multiple source chunks with different significance levels before encoding. This allows the network to transmit only essential portions of data when packet loss occurs, rather than requiring retransmission of entire packets. The segmentation enables partial data recovery and reduces retransmission overhead, thereby improving network throughput while maintaining critical data integrity.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent changes the parameter of data representation by encoding source chunks into coded chunks with varying significance levels. This parameter change allows the destination to reconstruct data with different quality levels based on which chunks are received, enabling graceful degradation during packet loss and improving overall network efficiency without complete retransmission.

Inventive Principle:

Principle #35Parameter changes

2Stability of the object's composition

If packets are buffered and forwarded in traditional routing, then transmission order is maintained, but delays increase during network congestion

Engineering Contradiction:

Improvetransmission orderVSAvoidtransmission delay

Core Design Contradiction:

Stability of the object's compositionVSLoss of time

Solution Approach 1:

The patent performs preliminary encoding of source chunks into coded chunks with significance levels before transmission. This preliminary action allows intermediate nodes and destinations to selectively process or discard chunks based on current network conditions without requiring complete buffering of entire packets, thereby reducing transmission delays while maintaining stability through the encoding structure.

Inventive Principle:

Principle #10Preliminary action

3Reliability

If entire packets are retransmitted upon loss, then data completeness is ensured, but network resources are wasted and delays are unpredictable

Engineering Contradiction:

Improvedata completenessVSAvoidnetwork resource waste

Core Design Contradiction:

ReliabilityVSLoss of energy

Solution Approach 1:

The patent enables discarding of less significant coded chunks during packet wash operations while preserving more significant chunks. The destination can recover essential data from the remaining chunks without requiring retransmission of the entire original packet. This selective discarding and recovering mechanism ensures data completeness for critical information while minimizing network resource waste.

Inventive Principle:

Principle #34Discarding and recovering

4Productivity

If packet wash is performed without significance levels, then congestion is managed, but data quality deteriorates uniformly

Engineering Contradiction:

Improvecongestion managementVSAvoiddata quality

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The patent applies local quality by assigning different significance levels to different coded chunks, allowing packet wash operations to selectively discard less significant chunks while preserving more significant ones. This creates non-uniform quality preservation where critical data portions maintain high quality even during congestion, while less critical portions may be degraded or discarded, optimizing both congestion management and data quality.

Inventive Principle:

Principle #3Local quality

Data Source

PatentUS12199764B2Qualitative communication using adaptive network coding with a sliding window

Publication Date: 2025.01.14 HUAWEI TECH CO LTD

AI summary

A system and a method performed by a source node for communicating data packets in the network comprising dividing a payload for data transmission into a plurality of source chunks with each source chunk comprising a significance level; performing, according to the significance level of each of the plurality of source chunks, adaptive network coding on each source chunk to obtain a plurality of coded chunks in a plurality of coding groups, where a significance level of coded chunks in at least two of the plurality of the coding groups is different, and wherein each coding group of the plurality of coding groups comprises at least one coded chunk having the same first significance level; generating a first coded data packet comprising a header and a payload comprising the plurality of coded chunks; and transmitting the first coded data packet to a destination node.