Transmission Queue Flow Control for Bursty Data Latency

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data transfer systems face challenges in efficiently handling bursty data traffic, leading to underutilization or over-design of communication bandwidth, particularly in scenarios with significant communication latency, where flow control mechanisms like XON/XOFF and Windowing are inadequate.

Innovation Solution

Implementing a transmission queue with an optimal length inversely proportional to data latency time at the destination, dynamically adjusting based on network latency and bandwidth, to manage data transfer between source and destination.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If XON/XOFF flow control is used to prevent queue overflow, then queue overflow is avoided, but network capacity utilization decreases due to premature flow control signals caused by communication latency

Engineering Contradiction:
Improvequeue overflow preventionVSAvoidnetwork capacity utilization
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The system pre-calculates and transmits flow control signals before the destination queue actually becomes full, taking into account the round-trip communication latency. This preliminary action prevents the queue from overflowing while allowing the network to operate at higher utilization rates, as the flow control signal is sent in advance rather than reactively when the queue is already full.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system implements a feedback mechanism where the destination monitors its queue depth and sends flow control signals back to the source based on pre-calculated thresholds that account for communication latency. This feedback loop allows the system to dynamically adjust the data flow to prevent queue overflow while maximizing network utilization.

Inventive Principle:
Principle #23Feedback

2Reliability

If Windowing flow control is used to maintain fixed data rate, then network bandwidth is preserved, but system adaptability decreases when processing capacity or bandwidth varies

Engineering Contradiction:
Improvenetwork bandwidth controlVSAvoidsystem adaptability to varying conditions
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The system dynamically adjusts the data transfer rate and window size based on real-time conditions at both the source and destination. Instead of using a fixed window size, the system monitors queue depths, communication latency, and processing capacities, and adapts the flow control parameters accordingly. This allows the system to maintain reliable bandwidth control while being highly adaptable to varying network conditions and processing capacities.

Inventive Principle:
Principle #15Dynamics

3Productivity

If system is designed to handle worst case burst capacity, then maximum data burst capability is achieved, but system cost increases due to over-design

Engineering Contradiction:
Improvemaximum data burst capabilityVSAvoidcommunication bandwidth resources
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The system changes the parameters of flow control dynamically based on actual traffic conditions rather than designing for worst-case scenarios. By adjusting queue depths, flow control thresholds, and data rates in real-time, the system can handle bursty traffic effectively using moderate, cost-effective bandwidth resources rather than requiring excessive over-provisioned capacity.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS7730237B1Flow control mechanism
Publication Date: 2010.06.01 EMC IP HLDG CO LLC
  • US7730237B1 patent drawing
  • US7730237B1 patent drawing
  • US7730237B1 patent drawing

AI summary

Transferring data elements from a source to a destination includes providing a transmission queue at the source, where data elements in the transmission queue are transferred from the source to the destination, determining an optimal length for the transmission queue, where the optimal queue length is inversely proportional data latency time at the destination, and, if the optimal length is greater than an instantaneous length of the transmission queue, adding data elements to the transmission queue. Adding data elements may include adding a number of elements corresponding to a difference between the optimal length and the instantaneous length of the transmission queue. Determining optimal length may include dividing a constant by the data latency time at the destination. Transferring data elements may also include providing a network between the source and the destination.