Multi-Layer Path Exploration Map for SDN Constraint Handling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional path computation techniques lack support for multi-layer technology path computation, fail to consider complex constraints and rules, and assume every hop is valid, which is not feasible in next-generation networks that require on-demand management of connections across multiple layers using SDN and NFV.
Innovation Solution
A method and system for determining a viable path in a network by creating a path exploration map based on a multi-layer network model, considering external and intra-node paths, and evaluating constraints and rules concurrently to find a path that meets specific criteria across Layers 0, 1, and 2, using a Software Defined Networking controller.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If conventional path computation techniques (Dijkstra, Bellman-Ford, K shortest path) are used, then computation speed and simplicity are maintained, but multi-layer path computation support and complex constraint handling capabilities are lost
Solution Approach 1:
The path computation is divided into two distinct phases: (1) path exploration phase that builds a map of all reachable ports and partial paths, and (2) viable path determination phase that evaluates constraints and rules. This segmentation allows the system to handle multi-layer complexity systematically while maintaining computational efficiency.
Solution Approach 2:
The system performs preliminary path exploration to build a comprehensive path exploration map before evaluating constraints and rules. This preliminary action identifies all possible partial paths and their characteristics, enabling subsequent constraint evaluation without re-computing paths.
2Reliability
If conventional path computation techniques assume every hop is valid, then computation simplicity is maintained, but path viability accuracy deteriorates
Solution Approach 1:
The system implements feedback mechanisms where constraints and rules are evaluated against partial paths during the exploration phase. This feedback allows the system to identify and exclude non-viable paths early, ensuring only valid end-to-end paths are returned while maintaining computational efficiency.
Solution Approach 2:
The system performs preliminary validation of hops against constraints and rules during path exploration, rather than assuming all hops are valid. This preliminary action identifies invalid hops early, preventing wasted computation on non-viable paths.
3Adaptability or versatility
If K value is increased in K shortest path algorithm to find viable paths meeting constraints, then path finding capability improves, but computation time and resource consumption increase
Solution Approach 1:
The system performs partial path exploration to identify all reachable ports and partial paths, then evaluates constraints on these partial paths. This approach avoids the need to compute excessive complete paths by pruning non-viable paths early during exploration, reducing overall computation time.
Solution Approach 2:
The computation is segmented into path exploration (building partial paths) and viable path determination (evaluating constraints). This segmentation allows efficient identification of viable paths without computing all possible complete paths, avoiding the need to increase K value excessively.
4Adaptability or versatility
If conventional path computation techniques are used with single cost factor, then computation simplicity is maintained, but ability to handle complex multi-hop constraints is lost
Solution Approach 1:
The path exploration map serves multiple functions: it stores reachable ports, partial paths, hop counts, and other path characteristics. This universal data structure supports various constraint types (hop limits, latency, bandwidth) without requiring separate computation mechanisms for each constraint.
Solution Approach 2:
The path exploration map acts as an intermediary between path exploration and constraint evaluation. It accumulates path information during exploration and provides this information to the constraint evaluation phase, enabling complex multi-hop constraint handling without direct coupling between exploration and validation.
Data Source
AI summary
Path calculation systems and methods for determining a path, based on constraints and rules, for a connection at one or more layers in a network, include determining a path exploration map of the network based on a multi-layer network model of the network defining external edges and intra-node paths, the path exploration map comprising every external port in the network that is reachable from a source port; and utilizing the path exploration map to determine a viable path, from a destination port to the source port, subject to the constraints and the rules and based on a cost.