SDN Path Computation Method for QoS-Constrained Data Forwarding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current software-defined networking (SDN) path computation methods result in large path sets at end nodes, leading to increased memory occupancy and calculation time due to the inclusion of invalid paths that do not meet quality of service (QoS) requirements.
Innovation Solution
The method iteratively determines N shortest paths from each link's end node to the sink node, ensuring that only valid paths meeting QoS constraints are added to the path set of the end node, reducing the number of paths and subsequent calculation complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the path set determining step includes determining all possible paths meeting QoS constraints, then the path set completeness is improved, but the memory occupancy and calculation time increase significantly
Solution Approach 1:
The patent extracts and removes invalid paths from the path set determination process. By identifying paths that cannot satisfy QoS constraints early in the determination process and excluding them from further consideration, the system maintains path set completeness for valid paths while significantly reducing memory occupancy by not storing invalid paths.
Solution Approach 2:
The patent performs preliminary evaluation of paths during the determination process to identify and exclude invalid paths before they are fully constructed and stored. This preliminary action prevents invalid paths from occupying memory resources, while still ensuring that all potentially valid paths are thoroughly explored and included in the final path set.
2Adaptability or versatility
If the path set of the end node includes a relatively large quantity of paths, then the path selection flexibility is improved, but the calculation amount and calculation time increase
Solution Approach 1:
The patent extracts invalid paths from the calculation process by identifying and excluding them early. This removal of irrelevant paths reduces the calculation amount and time required for subsequent operations, while maintaining the flexibility to select from all valid paths that meet QoS constraints.
Solution Approach 2:
The patent changes the parameter of path validity by introducing QoS constraint evaluation criteria. Paths are evaluated against these parameters during determination, allowing the system to maintain flexibility in path selection while reducing calculation time by focusing only on paths that can potentially satisfy the constraints.
3Quantity of substance
If all paths are added to the path set without validation, then the path set comprehensiveness is improved, but the data quality and subsequent processing efficiency deteriorate
Solution Approach 1:
The patent extracts invalid paths from the path set by implementing validation checks during the path determination process. This ensures that only paths meeting QoS constraints are added to the path set, maintaining high data quality while still achieving comprehensive coverage of all valid paths.
Solution Approach 2:
The patent performs preliminary validation of paths during their construction, checking whether they will meet QoS constraints before fully adding them to the path set. This preliminary action ensures data quality by preventing invalid paths from being stored, while maintaining comprehensiveness by including all paths that can satisfy the constraints.
Data Source
AI summary
The method includes: forwarding, based on path sets of nodes in a network, service data between a source node and a sink node in the network, where the path sets of the nodes in the network are determined by iteratively performing the following path set determining step: for each link in the network, obtaining a path set of a start node of the link, and determining N shortest paths from an end node of the link to the sink node; and for each path included in the path set of the start node, determining, according to the N shortest paths, the path, and the link, to add a new path formed by the path and the link into a path set of the end node.