Network Design Apparatus Optimizing Path Redundancy and Delay
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network design methods struggle to optimize infrastructure networks for diverse network services by efficiently accommodating lines with different requirements for inter-end delay and redundancy, leading to increased costs.
Innovation Solution
A network design apparatus and method that calculates a threshold value for inter-end delay and the number of redundant paths for each line, determining an optimal path candidate set and interface combination candidate set to minimize the total cost value, while ensuring the required degree of path redundancy is met.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If path candidates satisfying inter-end delay requirements are calculated for each line, then network service requirements are met, but the number of path candidates increases leading to higher equipment costs
Solution Approach 1:
The patent segments the path candidate calculation by dividing paths into different types (first type paths and second type paths) with different redundancy levels. This allows the system to calculate and select appropriate path candidates for each line based on specific requirements, rather than calculating all possible paths, thereby reducing the overall complexity and equipment costs while still meeting inter-end delay requirements.
2Reliability
If the number of redundant paths is increased for each line, then path redundancy requirement is satisfied, but the total cost value of interfaces increases
Solution Approach 1:
The patent applies local quality by allowing different lines to have different numbers of redundant paths based on their specific requirements. Some lines may require one redundant path while others may require two or more. This localized approach ensures that each line receives the appropriate level of redundancy without unnecessarily increasing the total cost value of interfaces across the entire network.
Solution Approach 2:
The patent implements partial action by calculating a sufficient number of path candidates (first type and second type paths) for each line based on the required degree of path redundancy, rather than calculating all possible paths. This partial calculation approach provides the necessary redundancy for reliability while avoiding the excessive cost that would result from considering or implementing all possible path combinations.
3Productivity
If path candidate set and interface combination candidate set are calculated simultaneously, then optimal network configuration is achieved, but calculation complexity and processing time increase
Solution Approach 1:
The patent segments the calculation process into distinct steps: first calculating the path candidate set (including first type paths and second type paths) for each line, then calculating the interface combination candidate set based on these path candidates. This segmentation allows the system to manage calculation complexity systematically and reduces processing time compared to simultaneous calculation of all candidates.
Solution Approach 2:
The patent applies preliminary action by first calculating and storing the path candidate set (with different types of paths) before calculating the interface combination candidate set. This preliminary calculation of paths provides a foundation that simplifies the subsequent interface combination calculation, thereby reducing the overall processing time while still achieving the optimal network configuration.
Data Source
AI summary
With a network design apparatus, a network design method, and a network design processing program, a network configuration is designed for a network in which a transfer apparatus is disposed at each of a plurality of communication hubs and the communication hubs are connected via a link by a link portion apparatus in the transfer apparatus. In design of a network configuration, a threshold value of an inter-end delay and the number of redundant paths are calculated for each line on the basis of topology information, line information, and design parameter information. A path candidate set is calculated for each line on the basis of the threshold value of the inter-end delay and the number of redundant paths.