Hierarchical Network Graph Routing for Faster Path Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional route search technologies in communication networks are limited by rectangular mesh division, leading to inefficient route calculations and increased computation time due to the search for undesired routes.
Innovation Solution
A route search device that divides a communication network into areas based on node information, creating a first network graph for macro search and a second network graph for micro search, allowing efficient route determination from a start point to an end point node.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If rectangular mesh division is used for route search, then the network can be systematically divided into regions, but the route search becomes inefficient and calculation time increases significantly
Solution Approach 1:
The patent divides the communication network into multiple search regions based on node information and geographic characteristics, creating a hierarchical search structure. This segmentation allows the route search to be performed in stages: first identifying candidate regions, then searching within those regions, thereby reducing the overall search space and calculation time compared to uniform rectangular mesh division.
Solution Approach 2:
The patent applies different search strategies to different regions based on their local characteristics. By dividing the network into search regions with boundaries determined by node information, the system can optimize the search approach for each region's specific topology and traffic patterns, improving overall search efficiency while adapting to local network conditions.
2Device complexity
If rectangular mesh division is used, then the network structure is simplified, but many similar routes are searched and desired routes may be missed
Solution Approach 1:
The patent segments the network into search regions that respect the underlying network topology and geographic information, rather than forcing a uniform rectangular grid. This segmentation maintains structural simplicity while improving route search accuracy by creating regions that align with actual network patterns and hazard boundaries.
Solution Approach 2:
The search region boundaries are dynamically determined based on node information, geographic data, and hazard maps rather than being fixed in advance. This dynamic approach allows the division structure to adapt to the specific network configuration and search requirements, improving both accuracy and relevance of the route search results.
Data Source
AI summary
A route search device includes a memory and a processor configured to divide a communication network including a plurality of nodes and an edge connecting the nodes into a plurality of areas based on information of the nodes, and create a first network graph that represents a connection relationship between the areas; search for one or more first routes from a start point area including a start point node to an end point area including an end point node using the first network graph; and search for one or more second routes from the start point node to the end point node using a second network graph that represents a connection relationship between the nodes and the edge in areas included in the first routes.