首页> 外文期刊>IEEE Transactions on Green Communications and Networking >Green Multi-Stage Upgrade for Bundled-Link SDNs With Budget and Delay Constraints
【24h】

Green Multi-Stage Upgrade for Bundled-Link SDNs With Budget and Delay Constraints

机译:具有预算和延迟约束的Bundled-Link SDN的绿色多级升级

获取原文
获取原文并翻译 | 示例
           

摘要

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: 1) our approaches reduce the energy consumption by up to 73.98%; 2) rerouting traffic demand via longer paths improves the energy saving by up to 9.6%; 3) GMSU produces results that are at most 4.83% from the optimal resu and 4) increasing the budget and the number of stages affect the total energy saved and the number of upgraded switches.
机译:将传统网络升级到阶段的软件定义的网络,并且最小化网络的能量消耗现在对运营商非常感兴趣。为此,本文解决了一个新颖的问题:通过在每个阶段的可用货币预算的多个阶段升级交换机来最小化网络的能耗。我们的问题考虑(i)可以单独关闭的捆绑链接,(ii)减少升级成本和增加多个阶段的流量需求,(iii)对具有预定限制内的延迟的替代路径进行重新路由要求。此外,路径上的链路​​负载不大于给定的最大利用率。我们将问题作为整数线性程序,并提出了一种贪婪的启发式称为绿色多级交换机升级(GMSU)。实验结果在五个实际网络拓扑上表明:1)我们的方法将能源消耗降低至73.98%; 2)通过更长的路径重新路由交通需求将节能高达9.6%; 3)GMSU产生最多4.83%的结果; 4)增加预算和阶段的数量会影响保存的总能量和升级交换机的数量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号