Energy-Efficient Network Routing via Integer Linear Programming
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for determining routes in networks are inefficient in terms of energy usage and calculation time, leading to significant energy wastage due to underutilized links and high energy consumption.
Innovation Solution
An integer linear programming algorithm is used to calculate an energy-efficient route between a starting node and a target node, maximizing the number of idle links by aggregating network traffic and disabling unused links, thereby reducing energy consumption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If redundant links and bandwidth are deployed to improve network reliability, then network reliability is improved, but energy consumption increases due to links needing to remain enabled even at low bandwidth occupation rates
Solution Approach 1:
The patent applies dynamics by making the network routing configuration adaptive rather than static. The integer linear programming algorithm dynamically calculates and adjusts the routing configuration based on current traffic conditions, allowing the system to transition between different routing states. This enables links to be selectively activated or deactivated based on real-time energy efficiency requirements while maintaining reliability through optimized path selection.
Solution Approach 2:
The patent changes the routing parameters by using an integer linear programming algorithm that optimizes the routing configuration to maximize idle links. The algorithm modifies traditional routing parameters by incorporating energy efficiency as a primary optimization criterion, transforming the routing problem from purely reliability-based to a multi-objective optimization that balances reliability with energy consumption through mathematical modeling.
2Productivity
If traditional routing methods are used, then route determination is simple, but energy-efficient effect is poor and calculation time is long
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing the optimal routing configuration using integer linear programming before actual traffic flow begins. The system performs the computationally intensive optimization calculation in advance, generating a routing configuration that maximizes energy efficiency. This pre-computed configuration is then deployed to the network, avoiding the need for real-time recalculation and reducing operational calculation time while maintaining high energy-efficient effects.
Data Source
Figure 1~2
Figure 3
AI summary
Embodiments of the present invention provide a method for determining an energy-efficient route, and relate to the communications field. The method includes: acquiring a topology structure, a starting node, a target node, and traffic data of a network, where the traffic data includes a record of traffic among all nodes on the network; and calculating, according to the topology structure and the traffic data of the network by using an integer linear programming algorithm, an energy-efficient route between the starting node and the target node and reserved bandwidth corresponding to the energy-efficient route.