Dynamic Buffer Interface for Protocol Overhead Management

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In communications systems, the efficient use of return-link bandwidth is hindered by the need to transmit overhead data such as ACK packets and FEC data, which can occupy bandwidth and delay the transmission of more valuable payload data, especially in systems with limited upload allowances.

Innovation Solution

Implementing a shared dynamic buffer at the interface between the link layer and higher layers of the protocol stack to efficiently manage and update status data, allowing for continuous uploading of current status information according to available upload allocations, thereby reducing the need for sequential queuing and optimizing bandwidth usage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a FIFO queue is used to manage return-link data, then protocol compliance is maintained, but return-link bandwidth efficiency deteriorates due to overhead data occupying bandwidth and delaying payload transmission

Engineering Contradiction:
Improveprotocol complianceVSAvoidbandwidth efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent replaces the static FIFO queue with a dynamic buffer that continuously updates status data (ACK packets, FEC data, partial packets) in shared memory. The buffer dynamically reflects the current state of forward-link data, allowing the most recent status information to be prioritized for upload, thereby improving bandwidth efficiency while maintaining protocol compliance.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent extracts the status data management function from the traditional FIFO queue structure. By separating the status data (overhead data) from the payload data and managing them in different buffer structures, the system can efficiently prioritize and upload only the necessary status information without being constrained by sequential queue processing, thus resolving the bandwidth efficiency issue.

Inventive Principle:
Principle #2Taking out (Extraction)

2Reliability

If the client waits for new grants to upload overhead data, then upload bandwidth allowances are respected, but transmission delays increase and valuable payload data is delayed

Engineering Contradiction:
Improvebandwidth allowance complianceVSAvoidtransmission delay
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent implements preliminary action by continuously generating and updating status data in the dynamic buffer before upload opportunities arise. The status data is maintained in shared memory in real-time, so when a new grant becomes available, the system can immediately upload current status information without waiting or reprocessing, thereby reducing transmission delays while still respecting bandwidth allowances.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent ensures continuity of useful action by maintaining the dynamic buffer continuously updated with current status data. Instead of batch processing status data only when grants are available, the buffer continuously reflects the latest state of forward-link data, enabling seamless and continuous upload operations whenever bandwidth is available, thus minimizing idle time and transmission delays.

Inventive Principle:
Principle #20Continuity of useful action

3Reliability

If overhead data is prioritized in the queue, then protocol requirements are met, but payload data transmission is delayed and bandwidth usage is inefficient

Engineering Contradiction:
Improveprotocol requirement fulfillmentVSAvoiddata transmission efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent applies segmentation by separating overhead data (status data) from payload data in the buffer structure. The dynamic buffer organizes status data independently, allowing the system to identify and upload only the necessary overhead information (such as ACK packets for acknowledged packets) without forcing sequential transmission of all queued data. This segmentation enables efficient bandwidth usage while meeting protocol requirements.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the parameter of data organization from fixed FIFO ordering to dynamic priority-based ordering. The buffer structure allows status data to be organized based on current relevance and protocol requirements, enabling the system to transmit only the necessary overhead data with appropriate priority, thereby improving overall data transmission efficiency while fulfilling protocol obligations.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS8516069B1Optimizer-to-link layer interface using dynamic buffering
Publication Date: 2013.08.20 SNAPPI INC
  • US8516069B1 patent drawing
  • US8516069B1 patent drawing
  • US8516069B1 patent drawing

AI summary

Systems and methods are described for communicating overhead data in a way that complies with applicable protocols while using return-link bandwidth more efficiently, for example, by providing a shared memory at an interface between lower layers and higher layers of a protocol stack. In one exemplary configuration, a shared dynamic buffer is provided at the interface between a closely coupled client optimizer and link layer of a user system. For example, the dynamic buffer is used to supplement or replace the FIFO queue typically at the interface between Layers 2 and 3 of the OSI protocol stack for the TCP protocol. The client optimizer continually and efficiently maintains current status data in the shared memory (e.g., ACK or NACK data, FEC data, partial packets, etc.). This status data can be uploaded by the link layer according to upload bandwidth allowances granted by a protocol partner.