Hybrid Resource Route Selection in Multi-Node Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current route selection methods in network communications can only embody information of one network resource, limiting the flexibility in scheduling network resources when constructing communication paths.

Innovation Solution

A method and apparatus that construct a directed graph for a multi-node network, including directed edges for each network resource between nodes, and assign delay weight values based on node information to enable flexible scheduling of hybrid resources.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If a directed graph is constructed with only one network resource per directed edge, then the graph structure remains simple and easy to manage, but the flexibility in scheduling network resources is limited

Engineering Contradiction:
Improveflexibility in scheduling network resourcesVSAvoidcomplexity of directed graph construction
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent segments the directed graph into multiple independent directed edges, where each edge represents a different network resource between two network nodes. This segmentation allows each edge to be independently configured and managed, enabling flexible resource scheduling while maintaining simple graph structure. The graph G=(V,E) is constructed with multiple directed edges e1, e2, ..., en between nodes, where each edge corresponds to a specific network resource type.

Inventive Principle:
Principle #1Segmentation

2Adaptability or versatility

If multiple directed edges representing different network resources are constructed between network nodes, then resource scheduling flexibility is improved, but the complexity of the directed graph increases

Engineering Contradiction:
Improveability to embody multiple network resourcesVSAvoidcomplexity of graph construction and management
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent creates a universal directed graph structure that can accommodate multiple types of network resources (Internet links, private links, optical fiber links, etc.) using the same framework. Each directed edge is designed to represent any type of network resource uniformly, allowing the graph to serve multiple functions: route selection, resource scheduling, delay calculation, and traffic engineering, all within a single multi-functional structure.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The patent uses parameter changes to differentiate between multiple network resources in the directed graph. Each directed edge is assigned specific parameters including delay weight values, resource types, and capacity characteristics. By varying these parameters across different edges while maintaining the same graph structure, the system can represent diverse network resources without increasing structural complexity. The delay weight value calculation based on node information dynamically adjusts these parameters for optimal route selection.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11082326B2Route selection method and apparatus based on hybrid resource, and server thereof
Publication Date: 2021.08.03 CHONGQING XINGJIE SHUXING TECHNOLOGY PARTNERSHIP ENTERPRISE (LLP)
  • US11082326B2 patent drawing
  • US11082326B2 patent drawing
  • US11082326B2 patent drawing

AI summary

A route selection method based on hybrid resources, the route selection method being applied to a server, the server being communicably connected to a multi-node network, the multi-node network including at least two network nodes, wherein the method includes: constructing a directed graph for the multi-node network, and constructing a directed edge for each of the at least two network resources among the network resources if the at least two network resources are included between any two network nodes; and receiving node information of various network nodes, acquiring a delay weight value between any two network nodes under any network resource based on the node information, and assigning the delay weight value to a corresponding directed edge.