Network Routing Controller Using Pre-Planned Path Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Network systems face inefficiencies due to unnecessary path planning when packet forwarding rules become invalid, leading to decreased system efficiency as nodes must re-plan transmission paths for packets with identical characteristics.
Innovation Solution
A routing method utilizing a controller to store and retrieve pre-planned paths for packet flows, allowing for instant provision of new forwarding rules by comparing calculated values with stored matching values and selecting or calculating spare paths when necessary.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If packet forwarding rules are stored in nodes and reused, then forwarding efficiency is improved, but the rules may become invalid due to errors or expired dates, leading to incorrect routing
Solution Approach 1:
A controller is introduced as an intermediary between nodes and packet flows. The controller maintains the network topology diagram and determines whether packet forwarding rules are valid by comparing current packet characteristics with stored matching values. This mediator resolves the contradiction by centralizing the validation logic, allowing nodes to efficiently forward packets while the controller ensures routing accuracy by invalidating rules when topology changes occur.
Solution Approach 2:
The system implements feedback through the controller that continuously monitors network topology changes and validates packet forwarding rules. When the topology diagram changes, the controller compares new topology information with stored matching values and updates or invalidates rules accordingly. This feedback mechanism ensures routing accuracy while maintaining forwarding efficiency by only re-evaluating rules when necessary.
2Reliability
If nodes re-plan transmission paths for every packet, then routing accuracy is maintained, but network system efficiency decreases due to unnecessary planning overhead
Solution Approach 1:
The controller performs preliminary validation of packet forwarding rules by maintaining a network topology diagram and comparing it with stored matching values before packets arrive at nodes. This preliminary action identifies valid routing rules in advance, allowing nodes to forward packets efficiently without re-planning paths for every packet, while still ensuring routing accuracy through pre-validation.
Solution Approach 2:
The controller serves multiple functions: maintaining the network topology diagram, validating packet forwarding rules, determining rule validity, and updating nodes. This multi-functional approach consolidates routing management, allowing efficient packet forwarding based on pre-validated rules while maintaining routing accuracy through centralized control.
3Reliability
If packet forwarding rules are invalidated and re-planned frequently, then routing accuracy is maintained, but time is lost due to repeated path planning
Solution Approach 1:
The controller performs preliminary validation by maintaining an up-to-date network topology diagram and comparing it with stored matching values before packets require forwarding. This preliminary action determines rule validity in advance, preventing unnecessary path re-planning and reducing time loss while maintaining routing accuracy through pre-validation of rules against current topology.
Solution Approach 2:
The controller continuously maintains the network topology diagram and validation state, ensuring that packet forwarding rules remain valid without requiring frequent re-planning. This continuous validation approach maintains routing accuracy while minimizing time loss by keeping rules ready for efficient forwarding as long as they remain valid.
Data Source
AI summary
A network system and a routing method are disclosed herein. The routing method includes receiving a route planning request corresponding to a packet flow; calculating a corresponding value according to the route planning request; comparing the corresponding value with a plurality of matching values stored in a storage space; and under a condition that the corresponding value matches a corresponding one of the matching values, acquiring an assigning path stored in the storage and routing the packet flow along the assigning path.