升级
能源消耗
计算机科学
预算约束
网络拓扑
链接预算
整数规划
路径(计算)
数学优化
网络规划与设计
启发式
能量(信号处理)
拓扑(电路)
计算机网络
工程类
数学
电信
经济
电气工程
操作系统
新古典经济学
统计
无线
作者
Lely Hiryanto,Sieteng Soh,Kwan‐Wu Chin,Mihai Lazarescu
标识
DOI:10.1109/tgcn.2021.3082617
摘要
Upgrading a legacy network to a Software Defined Network in stages, and minimizing the energy consumption of a network are now of great interest to operators. To this end, this paper addresses a novel problem: minimize the energy consumption of a network by upgrading switches over multiple stages subject to the available monetary budget at each stage. Our problem considers (i) bundled links that can be powered-off individually, (ii) decreasing upgrade cost and increasing traffic demands over multiple stages, and (iii) rerouting demands to an alternative path with a delay that is within a predefined limit. Additionally, the link load on the path is no larger than a given maximum utilization. We formulate the problem as an Integer Linear Program and propose a greedy heuristic called Green Multi-Stage Switch Upgrade (GMSU). Experiment results on five actual network topologies show that: (i) our approaches reduce the energy consumption by up to 73.98%, (ii) rerouting traffic demand via longer paths improves the energy saving by up to 9.6%, (iii) GMSU produces results that are at most 4.83% from the optimal result, and (iv) increasing the budget and the number of stages affect the total energy saved and the number of upgraded switches.
科研通智能强力驱动
Strongly Powered by AbleSci AI