Shortest Path Isolation Trace for Mesh Network Switches
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional depth first traversal-based isolation traces in infrastructure models arranged as mesh networks often return sub-optimal solutions, including unnecessary switchable elements, which can increase worker time and computational resources in maintenance and simulation tasks.
Innovation Solution
Implementing a shortest path first-based isolation trace function that performs shortest-path traces from the location to each source, adding the first encountered switchable element to a solution set and marking it active to prevent further traversal, resulting in a more optimal solution with fewer and closer switchable elements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If depth first traversal is used to discover switchable elements, then all connected switchable elements are found, but the solution includes unnecessary elements and increases worker time and computational resources
Solution Approach 1:
The patent extracts only the necessary switchable elements required for isolation by using shortest path algorithms. Instead of collecting all switchable elements through depth first traversal, the system identifies and extracts only those elements that lie on the shortest paths from the target location to sources, eliminating redundant elements from the solution set.
Solution Approach 2:
The patent changes the traversal parameter from depth-first exploration to shortest-path prioritization. By modifying the search strategy to always expand the shortest path first, the system naturally discovers the minimal set of switchable elements needed for isolation, rather than exploring all possible paths and collecting redundant elements.
2Reliability
If depth first traversal is used to discover switchable elements, then all connected switchable elements are found, but worker time and computational resources increase
Solution Approach 1:
The patent maintains continuous useful action by always processing the shortest path first. The priority queue ensures that the most efficient isolation path is discovered and processed first, continuously reducing the isolation set without backtracking or exploring redundant paths, thereby minimizing worker time and computational resources.
Solution Approach 2:
The patent skips unnecessary exploration by using shortest path prioritization. Instead of exhaustively traversing all paths as in depth first traversal, the system rushes through the most efficient paths first and stops when the target is isolated, skipping redundant explorations that would waste worker time and computational resources.
Data Source
AI summary
In example embodiments, a shortest path first-based isolation trace function is provided to determines what switchable elements need to be closed to stop flow of a quality to a location in an infrastructure model arranged as a network. The shortest path first-based isolation trace function may perform shortest-path traces from the location to each source. For each successful shortest-path trace finding one or more switchable elements, the first switchable element encountered on the path of the trace is added to a solution set, and marked as active to prevent further traversal in subsequent shortest-path traces. When all the shortest-path traces are complete, the solution set may be returned as a result. If no switchable element is found on a path of one of the shortest-path traces, it may be concluded that the location cannot be isolated and such conclusion returned as the result instead of the solution set.