Network Energy-Saving Adjustment Routing Under Changing Demands: Models and Algorithms

Routing is key to ensuring the normal operation of a network. The rapid development of networks and the continuous expansion in scale have placed high demands on network energy-saving routing. In this study, we described the problem of network energy-saving adjustment routing under the condition of point-to-point demand changes. The influences of point-to-point demand changes on routing scheme adjustment and network energy consumption are considered, and optimal adjustment of the routing scheme when the demand in the network changes from one moment to another is studied. A 0-1 nonlinear integer programming routing adjustment model is established to adjust the costs and minimize network routing energy consumption. Furthermore, it is proven that the problem is NP-hard, therefore two algorithms are designed: a heuristic algorithm based on the depth-first search and a heuristic algorithm based on k-shortest paths. The validity of the routing adjustment model and the algorithm is verified for both a small network and a medium-to-large size network.