Routing Table Validation via Violation Predicates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In data centers, the complexity and dynamic nature of network interconnection systems make it difficult to ensure reliable and timely communication between servers, with issues such as undeliverable packets and lost connections due to routing device failures or misconfigurations, which are often detected only after incidents occur, requiring manual verification and correction.
Innovation Solution
A method and system for automatically validating routing tables of routing devices by generating violation predicates based on contracts specifying desired behavior, using a constraint-based solver to identify and potentially correct violations in routing table configurations, ensuring compliance with specified contracts for destination addresses and next hops.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If manual verification and correction of routing tables is performed, then routing table accuracy can be maintained, but detection time is delayed until incidents occur and operational complexity increases
Solution Approach 1:
The patent performs preliminary validation of routing tables by generating violation predicates from contracts and using constraint solvers to detect configuration errors before they cause incidents. This proactive approach replaces reactive manual verification, maintaining routing table accuracy while enabling early detection of violations.
Solution Approach 2:
The system enables routing tables to self-validate by automatically generating violation predicates and solving constraints without human intervention. The automated validation process continuously monitors routing configurations, detecting and alerting to violations before they manifest as operational incidents, eliminating the need for manual verification.
2Loss of time
If automated validation with constraint solvers is implemented, then detection speed improves and incidents are prevented, but system complexity and computational resources increase
Solution Approach 1:
The patent introduces violation predicates as intermediary mathematical representations that bridge routing table configurations and contract requirements. These predicates translate complex routing validation problems into constraint satisfaction problems solvable by automated solvers, enabling fast detection without requiring overly complex custom validation logic.
Solution Approach 2:
The system replaces manual mechanical verification processes with automated computational constraint solving. By substituting human analysts with algorithmic constraint solvers that process violation predicates, the system achieves faster detection speed while the complexity is encapsulated in reusable mathematical models rather than ad-hoc validation procedures.
3Reliability
If comprehensive contract validation is performed on all routing devices, then network integrity is ensured, but computational resources and processing overhead increase
Solution Approach 1:
The patent applies validation selectively to individual routing devices and their specific contracts rather than uniformly validating all routing tables in the network. By generating and solving violation predicates only for affected routing devices with contract violations, the system ensures network integrity through targeted validation while minimizing unnecessary computational resource consumption on already-compliant devices.
Data Source
AI summary
A system performed by a computing device for validating routing tables of routing devices is provided. The routing tables map destination addresses to a next hops of the routing device. The system accesses one or more contracts that specify the desired behavior of a routing table of a routing device by specifying destination addresses and permissible next hops. For each routing device, the system generates a violation predicate for each contract that is applicable to the routing device. When a violation predicate is evaluated for a target destination address and a target next hop of the routing device, the violation predicate indicates whether the routing table violates the contract. The system then solves the violation predicates for all possible combinations of a target destination address and target next hops to determine whether any routing table violates the desired behavior of its routing device as specified by a contract.