Abstract
The main purpose of the work was examining various methods of decomposition of a network optimization problem of simultaneous routing and bandwidth allocation based on Lagrangian relaxation. The problem studied is an NP-hard mixed-integer nonlinear optimization problem. Multiple formulations of the optimization problem are proposed for the problem decomposition. The decomposition methods used several problem formulations and different choices of the dualized constraints. A simple gradient coordination algorithm, cutting-plane coordination algorithm, and their more sophisticated variants were used to solve dual problems. The performance of the proposed decomposition methods was compared to the commercial solver CPLEX and a heuristic algorithm.
Subject
Energy (miscellaneous),Energy Engineering and Power Technology,Renewable Energy, Sustainability and the Environment,Electrical and Electronic Engineering,Control and Optimization,Engineering (miscellaneous),Building and Construction
Reference48 articles.
1. Data Centres and Data Transmission Networks
2. The Growing Footprint of Digitalisation
3. Usage impact on data center electricity needs: A system dynamic forecasting model
4. Flow Control and Routing Algorithms for Data Networks;Gallager;Proceedings of the 5th International Conference on Computer Communication (ICCC 1980),1980
5. Data Networks;Bertsekas,1992