SDN LatencySmasher Framework for Delay-Sensitive Traffic

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Software-Defined Networking (SDN) technologies face challenges in optimizing end-to-end latency, particularly in delay-sensitive applications, due to limitations in per-flow statistics collection mechanisms and high overhead in statistics collection and path updates, which affect Quality of Service (QoS) and network throughput.

Innovation Solution

The proposed solution is a software-defined networking-based framework, 'LatencySmasher,' that utilizes per-link latency active measurement techniques and an adaptive A* algorithm for systematic minimization of end-to-end delay, incorporating a sliding window for statistics collection and employing an exponentially weighted moving average model for latency estimation to optimize path selection and reduce control plane overheads.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If push-based statistics collection is used, then switches can report per-flow statistics, but many switches will not report until flow entries time out causing high latency

Engineering Contradiction:
Improveper-flow statistics collectionVSAvoidflow statistics reporting delay
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

Instead of waiting for switches to push statistics to the controller (push-based), the controller actively pulls statistics from switches using Read-State messages. This inversion of the communication initiative eliminates the timeout-based delay inherent in push-based mechanisms and enables on-demand statistics collection.

Inventive Principle:
Principle #13The other way round (Inversion)

Solution Approach 2:

The controller proactively requests flow statistics before flow entries timeout by sending Read-State messages at optimized intervals. This preliminary action prevents the need to wait for timeout events and ensures fresh statistics are available for path selection decisions.

Inventive Principle:
Principle #10Preliminary action

2Measurement precision

If frequent statistics collection is performed, then path selection accuracy improves, but control plane overhead increases

Engineering Contradiction:
Improvepath selection accuracyVSAvoidcontrol plane overhead
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The controller implements periodic statistics collection using Read-State messages at optimized intervals rather than continuous or timeout-based collection. This periodic approach balances the need for accurate path selection information with the constraint of control plane overhead, collecting statistics frequently enough to maintain accuracy but not so frequently as to create excessive overhead.

Inventive Principle:
Principle #19Periodic action

Solution Approach 2:

The statistics collection frequency and timing are dynamically adjusted based on network conditions and flow characteristics. The controller adapts the collection schedule to minimize overhead while maintaining sufficient accuracy for effective path selection, rather than using a fixed rigid schedule.

Inventive Principle:
Principle #15Dynamics

3Ease of operation

If traditional path selection is used, then routing decisions are made, but end-to-end latency is not optimized for delay-sensitive applications

Engineering Contradiction:
Improverouting decision makingVSAvoidend-to-end communication delay
Core Design Contradiction:
Ease of operationVSLoss of time

Solution Approach 1:

The controller uses real-time flow statistics (bytes, duration, per-link latency) as feedback to dynamically adjust path selection. This feedback mechanism enables the system to identify and select optimal paths that minimize end-to-end latency for delay-sensitive applications, rather than relying on static or traditional routing decisions.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The path selection process incorporates latency as a key parameter alongside traditional metrics. By changing the selection criteria to include per-link latency measurements and using algorithms like adaptive A*, the system optimizes routing decisions specifically for latency-sensitive traffic while maintaining operational simplicity.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11411872B2Network latency optimization
Publication Date: 2022.08.09 UNIV OF SOUTH FLORIDA
  • US11411872B2 patent drawing
  • US11411872B2 patent drawing
  • US11411872B2 patent drawing

AI summary

The centralized control capability of Software Defined Networking (SDN) presents a unique opportunity for enabling Quality of Service (QoS) routing. For delay sensitive traffic flows, a QoS mechanism efficiently computes path latency and minimizes a controller's response time. At the core of the challenges is how to handle short term network state fluctuations in terms of congestion and latency while guaranteeing the end-to-end latency performance of networking services. The disclosed technology provides a systematic framework that considers active link latency measurements, efficient statistic estimate of network states, and fast adaptive path computation. The disclosed technology can be implemented, for example, as an SDN controller application, and can find optimal end-to-end paths with minimum latency and significantly reduce the control overhead.