SDN Controller Path Calculation Using Switch Capability Constraints

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In Software Defined Networks (SDNs), controllers face challenges in calculating new paths due to flow table configuration failures caused by differing capabilities of switches, leading to message forwarding failures without effective solutions.

Innovation Solution

A method and device that calculate network paths by using capability information of forwarding nodes as constraint conditions, specifically incorporating switch, flow table, group, and meter table features, along with existing constraints like link cost and bandwidth, to improve path calculation correctness and applicability using SPF/CSPF algorithms.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If the controller calculates paths without considering switch capability information, then the path calculation process is simple and fast, but the flow table configuration fails when switches have different capabilities, leading to message forwarding failures

Engineering Contradiction:
Improveflow table configuration success rateVSAvoidpath calculation complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The controller obtains capability information of each switch in advance before calculating the forwarding path. This preliminary acquisition of switch capabilities (buffer size, table数量, statistical capabilities, etc.) allows the path calculation to consider these constraints from the beginning, preventing flow table configuration failures later.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The path calculation algorithm is modified to incorporate switch capability parameters as additional constraints. The controller adjusts the path selection based on parameters such as maximum buffer size, number of supported tables, and statistical capabilities, transforming the traditional shortest path algorithm into a capability-aware constrained path algorithm.

Inventive Principle:
Principle #35Parameter changes

2Measurement precision

If the controller obtains capability information from all switches in the network, then the path calculation accuracy improves, but the network communication overhead increases

Engineering Contradiction:
Improvepath calculation accuracyVSAvoidnetwork communication overhead
Core Design Contradiction:
Measurement precisionVSLoss of information

Solution Approach 1:

The capability information is extracted and stored locally in the controller's memory after being obtained once from each switch. This extraction and local storage eliminates the need for repeated requests to all switches during normal path calculations, significantly reducing ongoing network communication overhead while maintaining accurate path calculation.

Inventive Principle:
Principle #2Taking out (Extraction)

3Productivity

If the controller uses traditional path algorithms without considering switch capabilities, then the path calculation is fast, but the calculated paths may not be executable on switches with limited capabilities

Engineering Contradiction:
Improvepath calculation speedVSAvoidpath compatibility with switch capabilities
Core Design Contradiction:
ProductivityVSAdaptability or versatility

Solution Approach 1:

The path calculation considers local capability characteristics of each specific switch along the potential path. Instead of requiring all switches to have uniform high capabilities, the algorithm selects paths that match the actual capability profile of each switch on that path, allowing the network to utilize switches with different capability levels appropriately.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS10044600B2Method and device for calculating a network path
Publication Date: 2018.08.07 ZTE CORP
  • US10044600B2 patent drawing
  • US10044600B2 patent drawing
  • US10044600B2 patent drawing

AI summary

The present disclosure discloses a method and device for calculating a network path. Wherein, the method includes that: a network control node calculates a forwarding path from a source node to a destination node according to capability information of a forwarding node and a constraint condition. By the method, correctness of calculating the SDN path and network applicability may be improved.