Multi-Criteria Network Path Computation with Visualization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network path computation methods can only consider a single criterion for path selection, lack the ability to specify a range of values, and do not provide a graphical user interface for operators to visualize path selection criteria in router networks.
Innovation Solution
A multi-criteria network path computation approach that allows operators to select and visualize paths based on multiple criteria through an intuitive user interface, including trust, privacy, security, and cost, using slide bars for range selection and check boxes for inclusion/exclusion, and dynamically updates network maps to distinguish compliant and non-compliant links.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a single-criterion path selection algorithm is used, then the path computation is simple and fast, but the ability to consider multiple path selection criteria is limited
Solution Approach 1:
The patent segments the path selection process into multiple independent criteria (latency, bandwidth, cost, reliability) that can be individually weighted and optimized. Each criterion is handled as a separate dimension in the multi-dimensional optimization space, allowing flexible combination without requiring a completely new algorithmic framework.
Solution Approach 2:
The patent transitions from one-dimensional path optimization (single criterion) to multi-dimensional optimization by introducing multiple criteria as separate dimensions. The solution space becomes a multi-dimensional hypercube where each axis represents a different optimization criterion, enabling simultaneous consideration of latency, bandwidth, cost, and reliability.
2Productivity
If a Constrained Shortest Path First (CSPF) algorithm is used, then the graph can be pruned based on CSPF parameters, but the path selection is serial or stepwise rather than simultaneous
Solution Approach 1:
The patent merges multiple CSPF parameter constraints into a single unified multi-criteria optimization function. Instead of applying constraints sequentially (first prune by latency, then by bandwidth), the solution simultaneously optimizes across all criteria by combining them into a weighted sum objective function, achieving both efficiency and flexibility.
Solution Approach 2:
The patent changes the parameters from discrete, sequential constraints to continuous, simultaneous optimization variables. By introducing weight parameters that can be dynamically adjusted, the system allows flexible trade-offs between criteria without requiring sequential processing steps, enabling operators to optimize based on current network conditions.
3Adaptability or versatility
If traditional routing protocols are used, then the network infrastructure is simple, but there is no way to specify a range of values for path selection criteria
Solution Approach 1:
The patent introduces dynamic value range specification where operators can define minimum and maximum thresholds for each criterion in real-time. The weight parameters and value ranges are not fixed but can be dynamically adjusted based on network conditions, allowing flexible adaptation without requiring complex infrastructure changes.
Solution Approach 2:
The patent introduces an intermediary optimization layer between the simple routing infrastructure and the complex multi-criteria requirements. This intermediary layer translates high-level operator specifications (range values, weights) into concrete path selection decisions, abstracting the complexity from the network infrastructure while enabling sophisticated path optimization.
4Ease of operation
If no graphical user interface is provided, then the system remains simple, but network operators cannot easily visualize path selection criteria and results
Solution Approach 1:
The patent creates a visual representation (copy) of the network topology and selected paths that mirrors the actual network structure. This graphical copy allows operators to intuitively understand path selection results without needing to interpret complex technical data, providing immediate visual feedback on how criteria weights affect path choices.
Solution Approach 2:
The patent uses color coding and visual differentiation in the network graph to represent different path characteristics and selection criteria. By assigning distinct visual attributes to paths based on their optimization results, the system provides intuitive visual feedback that helps operators quickly assess path quality without detailed numerical analysis.
Data Source
AI summary
Systems and methods include receiving a request for a path in a network including a plurality of network elements interconnected to one another via links, wherein the request includes values for a plurality of criteria, wherein the plurality of criteria include one or more of trust, privacy, and secrecy; utilizing a multi-criteria path selection process to determine the path through the plurality of network elements over the links based on the plurality of criteria and the associated values; and providing a display of the determined path in a network map. The trust quantifies trustworthiness of each link in the network and the values of trust are any of a rating and a selection for inclusion or exclusion, the privacy quantifies a number of the links the network path is routed over for network obfuscation, and the secrecy quantifies a level of encryption utilized on the links.