Correlation Directed Acyclic Graph for SDN Migration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The complexity of migrating software-defined network (SDN) component configurations across computing environments is hindered by their highly interdependent nature, lacking effective tools to visualize and manage dependencies, leading to manual and iterative processes that are prone to errors and time-consuming.
Innovation Solution
A computer-implemented system and method generate a correlation directed acyclic graph (CDAG) from a configuration export file of SDN components, using correlation keys and template entries to represent graph nodes and edges, illustrating dependencies and relationships, facilitating the migration planning and execution.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If manual and iterative processes are used to manage SDN component configuration dependencies, then flexibility in handling complex interdependencies is maintained, but the process becomes time-consuming and error-prone
Solution Approach 1:
The patent replaces manual mechanical processes with an automated computer-generated dependency graph system. The system automatically generates, visualizes, and manages SDN component configuration dependencies through software tools, eliminating manual tracking and reducing both time consumption and human errors in dependency management.
Solution Approach 2:
The patent introduces a computer-generated dependency graph as an intermediary between configuration components and migration processes. This graphical representation serves as a mediator that automatically captures and displays relationships between SDN components, enabling systematic management of dependencies without manual intervention.
2Reliability
If comprehensive dependency tracking is implemented for SDN components, then migration accuracy is improved, but system complexity increases due to the need to track interdependent configurations
Solution Approach 1:
The patent transforms complex dependency relationships into a visual graphical dimension. By representing dependencies as nodes and edges in a computer-generated graph, the system adds a visual dimension that makes complex interrelationships easily comprehensible and manageable, reducing the perceived complexity while maintaining comprehensive tracking.
Solution Approach 2:
The patent replaces complex manual dependency tracking mechanisms with an automated computer-generated graphical system. The software automatically generates, updates, and visualizes dependency relationships, eliminating the need for complex manual tracking procedures while maintaining complete dependency information.
3Productivity
If configuration export files with correlation keys are processed automatically, then migration speed is improved, but the initial setup and processing complexity increases
Solution Approach 1:
The patent performs preliminary actions by automatically generating dependency graphs from configuration export files before migration execution. The system pre-processes configuration data, identifies correlations between components, and visualizes dependencies in advance, enabling faster and more accurate migration execution without manual analysis during the actual migration process.
Data Source
AI summary
A computer-implemented system and method for generating a correlation directed acyclic graph (CDAG) of configurations of a software-defined network (SDN) component for migration from a source computing environment to a destination computing environment uses a configuration export file of the SDN component to draw the CDAG. Correlation keys defined in the configuration export file are used to draw graph nodes. Contents associated with the correlation keys and template entries are used to draw edges between at least some of the graph nodes. The CDAG with the graph nodes and the edges is then displayed.