Network Topology Generation Using Traffic Demand Matrix
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for configuring network topologies struggle to efficiently accommodate a plurality of varying traffic demand matrices, leading to high computational complexity and difficulty in obtaining exact solutions.
Innovation Solution
The method formulates the problem as a degree-constrained network design problem, using a computation traffic generation unit to create a traffic demand matrix and a network topology generation unit to generate a topology based on this matrix and node port information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If full search method is used to solve the mixed integer linear programming problem for network topology configuration, then exact solution can be obtained, but computational complexity exponentially increases with the number of nodes
Solution Approach 1:
The patent segments the complex network topology configuration problem into two parts: first determining link establishment decisions (binary variables) and second determining traffic routing (continuous variables). This segmentation allows the use of heuristic methods for link selection while maintaining polynomial-time solvability for routing optimization, thus reducing computational complexity while obtaining sufficiently accurate solutions.
Solution Approach 2:
The patent changes the problem parameters by fixing the link establishment decisions based on heuristic criteria (such as selecting links that connect nodes with high traffic demand) and then optimizing only the routing parameters. This parameter fixation approach transforms the original mixed integer linear programming problem into a simpler optimization problem that can be solved efficiently without full exponential search.
2Reliability
If full search method is used to obtain exact network topology configuration, then optimal solution is achieved, but time required becomes prohibitively long
Solution Approach 1:
The patent performs preliminary action by pre-determining which links should be established in the network topology using heuristic rules (such as selecting links between nodes with highest traffic demands) before solving the routing optimization problem. This preliminary link selection eliminates the need to search through all possible link configurations, dramatically reducing computation time while maintaining solution quality.
3Adaptability or versatility
If network topology is designed to accommodate multiple varying traffic demand matrices, then adaptability is improved, but problem complexity and difficulty of obtaining solution increases
Solution Approach 1:
The patent creates a universal network topology configuration method that can handle multiple varying traffic demand matrices. By formulating the problem to simultaneously consider multiple traffic scenarios and using a two-stage optimization approach (link selection followed by routing optimization), the solution achieves adaptability to different traffic patterns without requiring separate designs for each scenario, thus managing complexity while improving versatility.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
It is an objective of the present disclosure to reduce computational complexity for obtaining a network topology configuration capable of efficiently accommodating a plurality of traffic demands assumed between nodes present in a network. A device of the present disclosure includes: a computation traffic generation unit that creates a traffic demand matrix whose elements are values individually obtained by demands between nodes present in a target network area from a plurality of traffic demand matrices created based on predicted traffic demands between the nodes; and a network topology generation unit that generates a network topology based on the traffic demand matrix generated by the computation traffic generation unit and port information of the nodes in the network area.