Network Subgraph Link Selection Using Combined Link And Node Costs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for constructing network subgraphs, such as distribution trees and flooding graphs, often fail to prioritize the capabilities and connectivity of nodes and links, leading to suboptimal network performance and inefficient data transmission.
Innovation Solution
A method that calculates a combined 'Link and Node Cost' for each link in a network, using a weighting parameter to prioritize more capable and connected nodes, allowing for efficient selection of links and nodes without requiring exponential or polynomial computation over the entire network.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If existing methods for constructing network subgraphs are used, then the construction process is simple, but the network performance is suboptimal and data transmission is inefficient
Solution Approach 1:
The patent changes the parameters used for link selection from simple link costs to a composite metric that incorporates both link costs and node costs. This parameter change enables the system to prioritize capable and connected nodes, improving data transmission efficiency without requiring complex exponential or polynomial computations over the entire network.
Solution Approach 2:
The patent segments the link selection process into two distinct cost components: link costs and node costs. By separating these concerns and evaluating them independently before combining them, the system achieves better network performance while maintaining computational simplicity and avoiding the need for complex global optimization algorithms.
2Reliability
If node capabilities and connectivity are prioritized, then network performance improves, but the computation becomes exponential or polynomial over the entire network
Solution Approach 1:
The patent applies partial action by considering only local node costs and link costs rather than performing exhaustive computations over the entire network. This approach prioritizes capable and connected nodes through localized evaluation, achieving improved network performance while avoiding exponential or polynomial computation energy requirements.
3Ease of operation
If simple link cost selection is used, then the selection process is fast, but the capabilities and connectivity of nodes are not prioritized
Solution Approach 1:
The patent merges link costs and node costs into a unified selection criterion. This combination allows the system to maintain fast selection speeds while simultaneously prioritizing node capabilities and connectivity, thereby improving data transmission efficiency without sacrificing operational speed.
Data Source
Figure 1A~1B
Figure 1C~1D
Figure 1E~1F
AI summary
A method and network device for selecting links of a network subgraph, where the method includes: obtaining link costs of links in a network; obtaining node costs of nodes connected by each of the links in the network, where the node costs comprise a first node cost of a first node and a second node cost of a second node selected from the nodes; selecting a weighting parameter based on the link costs, the node costs, or both; calculating link and node costs for each of the links, where the link and node costs are calculated based on the link costs, the node costs, the weighting parameter, or any combination thereof; and selecting a link having a lowest link and node cost among the links.