Logical Network Priority Graph for SDN Update Scheduling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current techniques for updating logical networks in software-defined networking (SDN) are inefficient, particularly in managing updates to logical entities and their associated features across multiple host machines, leading to suboptimal processing and resource utilization.
Innovation Solution
A method utilizing a logical network priority graph to determine the update order of logical entities, where nodes represent logical entities and directed edges indicate feature priorities, allowing for topological sorting to schedule updates efficiently across host machines.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If sequential update method is used for logical entities, then update order is simple to manage, but processing efficiency is low
Solution Approach 1:
The patent changes the parameter of update scheduling from simple sequential ordering to priority-based ordering using a logical network priority graph. Each logical entity is assigned a priority value, and updates are scheduled according to these priorities rather than a fixed sequence, thereby improving processing efficiency while maintaining manageable complexity through systematic priority assignment
Solution Approach 2:
The patent introduces dynamic update scheduling where the update order of logical entities is not fixed but determined by their priority values in the logical network priority graph. This allows the system to adaptively adjust update sequences based on entity priorities, improving efficiency without proportionally increasing management complexity
2Productivity
If parallel updates are implemented for logical entities, then processing efficiency is improved, but update coordination complexity increases
Solution Approach 1:
The patent segments the update process into priority-based groups using the logical network priority graph. Logical entities are divided into different priority levels, and updates are coordinated by processing higher priority entities first. This segmentation allows parallel updates within the same priority level while maintaining proper coordination across priority levels, improving efficiency without excessive coordination complexity
Solution Approach 2:
The patent performs preliminary action by pre-establishing the logical network priority graph that defines the update order of all logical entities before actual updates begin. This preliminary prioritization framework enables subsequent parallel updates to proceed efficiently without real-time coordination complexity, as the update sequence is predetermined by the graph structure
Data Source
AI summary
Certain embodiments described herein are generally directed to determining efficient update schedules for logical networks based on a graph representing the priority of features supported by the network, and a graph representing the priority of logical entities within the logical network. By building a graph of the logical network using directed edges to represent the update priority of one logical entity over another, an ordering, or a set of possible orderings, may be obtained. A topological sort of the graph may obtain such an ordering. Alternative orderings may indicate opportunities for parallel updating, which may result in a more efficient process for updating the logical network.