Network Graph Edge Scoring for Communication Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Determining optimal routes in optical communication networks is challenging due to the NP-hard nature of the problem, leading to intractability as network size and demand increase, and existing methods fail to effectively prioritize communication links based on topology and characteristics.
Innovation Solution
A method that uses edge scores determined by graph cuts and link characteristics to configure communication networks, prioritizing paths and preserving important links, implemented through a network management system that calculates scores based on centrality, availability, and link characteristics to optimize route selection.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional routing methods are used to determine optimal paths in communication networks, then route selection can be made, but the problem becomes intractable as network size and number of demands increase due to NP-hard complexity
Solution Approach 1:
The patent transforms the routing problem from finding optimal paths to finding paths with minimum scores, where edge scores are computed based on graph cut ranks and link characteristics. This parameter transformation converts the NP-hard optimization problem into a more tractable scoring and selection process, maintaining routing effectiveness while reducing computational complexity.
Solution Approach 2:
The patent pre-computes edge scores based on graph cut analysis and link characteristics before actual routing decisions are made. This preliminary scoring allows the routing system to make efficient path selections without performing complex optimizations in real-time, thereby improving routing efficiency while managing computational complexity.
2Reliability
If communication links are prioritized based on traditional metrics, then some links can be selected for routing, but topologically important links cannot be effectively preserved as backups
Solution Approach 1:
The patent dynamically adjusts edge scores based on graph cut ranks that reflect the topological importance of links. Links with higher graph cut ranks (indicating greater topological importance) receive score adjustments that make them less likely to be selected for primary routing while preserving them as backup options. This dynamic scoring mechanism effectively prioritizes links based on their topological significance, enhancing network resilience while simplifying the prioritization process.
3Productivity
If all communication links are treated equally in routing decisions, then simple routing can be implemented, but network capacity and service quality cannot be optimized
Solution Approach 1:
The patent assigns different scores to different edges based on their local characteristics including graph cut ranks and link-specific properties. This local differentiation allows the routing system to optimize network capacity by directing traffic through links with favorable characteristics while avoiding congested or less suitable links, thereby improving overall network productivity without requiring overly complex centralized control.
Data Source
AI summary
A network management system can be configured to identify routes for satisfying a set of demands on a communications network using a network graph that represents the communication network. The network graph edges can have edge scores that indicate a priority of the edge. The edge score for a network edge corresponding to a communication link in the communication network can depend on the topology of the communication network or the characteristics of the communication link. The network management system can iteratively identify candidate path(s) on the network graph that correspond to each of the demands and determine a score for each candidate path using the edge scores. In each iteration, the network management system can select the lowest score candidate path, update the network graph to reflect the selection of this candidate path, update the edge scores based on the updating of the network graph, and update the candidate paths for the remaining demands as needed.