Network Configuration Repair via Graph Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current automated network configuration repair techniques are slow, non-scalable, and often produce incorrect solutions, especially for large networks with complex configurations, and fail to support new constructs like routing adjacencies and administrative distances.
Innovation Solution
The approach divides the repair problem into two sub-problems, using constraint solving techniques to compute optimal pathsets and then specializing these paths to satisfy data plane constraints, allowing for efficient graph techniques to adjust administrative distances and routing protocol metrics, thereby achieving scalability and correctness.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Extent of automation
If automated network configuration repair is implemented using existing methods, then repair automation is achieved, but repair speed is slow and does not scale to large networks
Solution Approach 1:
The patent segments the network configuration repair problem into two independent sub-problems: (1) control plane repair using ETG graph techniques to determine optimal pathsets, and (2) data plane repair using constraint solving to specialize paths. This segmentation allows each sub-problem to be solved independently and efficiently, achieving scalability to large networks while maintaining full automation.
Solution Approach 2:
The patent introduces an intermediary constraint solving layer that bridges the control plane repair (ETG-based path determination) and data plane repair (configuration application). This intermediary layer translates control plane pathsets into data plane constraints, enabling efficient coordination between the two repair phases and achieving both automation and speed.
2Extent of automation
If existing automated repair methods are used, then some repair capability is provided, but correctness is not guaranteed when k-Reachable policies are specified
Solution Approach 1:
The patent implements feedback through constraint solving that verifies whether the determined pathsets actually satisfy the k-Reachable policies. The constraint solver checks if the specialized data plane paths match the control plane paths, providing feedback to ensure correctness. If paths do not match, the system can iterate to find correct solutions, guaranteeing reliability for k-Reachable policies.
Solution Approach 2:
The patent performs preliminary action by first determining optimal pathsets in the control plane using ETG techniques before specializing them in the data plane. This preliminary control plane analysis establishes correct path requirements, and subsequent data plane specialization is guided by these pre-determined constraints, ensuring correctness from the outset rather than requiring post-hoc verification.
3Adaptability or versatility
If the repair model is extended to support new configuration constructs, then versatility is improved, but model complexity increases
Solution Approach 1:
The patent creates a universal repair model using ETGs and constraint solving that can handle multiple types of network configuration constructs (routing adjacencies, static routes, administrative distances, BGP local preferences, etc.) through a single unified framework. The ETG graph representation and constraint solving approach are general enough to model diverse constructs without requiring separate specialized models, achieving versatility without proportional complexity increases.
Data Source
AI summary
Discussed herein is technology for verifiable network configuration repair. A method can include adding a routing adjacency or route redistribution edge to a router of an aETG to generate an enhanced aETG (eaETG), adding, for each dETG of dETGs, static route edges to a destination of the dETG to generate an enhanced dETG (edETG), determining, for each of the edETGs, all simple paths from all sources to the destination of the edETG, determining a set of paths (pathtset) over the determined simple paths that satisfies the policies, and translating the edge additions and/or removals in the eaETG and in the edETGs to an addition and/or removal of one or more of a routing adjacency, routing filter, or static route based on the determined pathset.