Telecommunications Circuit Design via Two-Stage Node Group Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Modern telecommunications networks are complex and inefficient due to their size and complexity, making it difficult for circuit designers to navigate and optimize circuit routes effectively, even with automated tools.
Innovation Solution
A method is introduced that uses a two-stage search approach by first selecting an abstract route based on grouped network nodes and then searching for a corresponding circuit route within the detailed network model, reducing the search space and improving efficiency through node grouping and scoring/filtering rules.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a detailed search through the entire network model is performed to find a circuit route, then the route selection accuracy is improved, but the computational complexity and time consumption increase significantly
Solution Approach 1:
The network model is segmented into multiple hierarchical levels: a high-level abstract model containing node groups and interconnections, and a detailed low-level model containing individual nodes and connections. The search process is divided into two stages: first searching the abstract model to identify candidate node groups, then searching the detailed model only within relevant portions. This segmentation reduces computational complexity while maintaining route selection accuracy.
Solution Approach 2:
Before performing the detailed route search, the system preliminarily identifies candidate node groups in the abstract model and uses scoring/filtering rules to pre-select the most promising candidates. This preliminary action narrows down the search space in the detailed model, reducing computational complexity while ensuring that accurate route options are not missed.
2Reliability
If the entire network model is searched to ensure all possible routes are considered, then the completeness of route options is improved, but the design process becomes cumbersome and inefficient
Solution Approach 1:
The system dynamically adjusts the search process based on scoring results. After the preliminary search in the abstract model, node groups are scored and filtered according to user-defined criteria. The detailed search is then dynamically focused only on high-scoring candidate node groups, ensuring completeness of relevant route options while dramatically improving design efficiency by avoiding exhaustive search of the entire network model.
Solution Approach 2:
The system changes the level of detail in the model being searched based on the stage of the process. In the preliminary stage, the abstract model with aggregated node groups is searched. In the detailed stage, only specific portions of the detailed model corresponding to candidate node groups are searched. This parameter change in search granularity maintains route option completeness while improving productivity.
3Extent of automation
If automated tools are used to assist circuit design, then the need for human design input is reduced, but the tools become cumbersome to operate in complex networks
Solution Approach 1:
The system adds an abstract dimension to the network model, creating a high-level view with node groups that represents the network structure in a simplified manner. This additional dimension allows automated tools to operate more effectively by first identifying routes at the abstract level, then mapping them to the detailed level. This dimensional approach maintains high automation while improving ease of operation by reducing the apparent complexity to the user.
Data Source
AI summary
A method of designing a network circuit for a telecommunications network is disclosed. The method includes storing first model data in a database representing a first model of the telecommunications network. Second model data is received representing a second model of the telecommunications network. The second model data defines node groups, each representing a plurality of network nodes of the first network model, and interconnections between node groups, each representing connectivity between node groups in the first network model. The method involves searching the second model data to select a route from a start node group to an end node group, the route specifying a plurality of node groups connected by interconnections in the second network model; and searching the first model data to select a circuit from a node of the start node group to a node of the end node group.