Green Multi-Stage Upgrade for Bundled-Link SDNs with Budget Constraint

2019 29th International Telecommunication Networks and Applications Conference (ITNAC) Pub Date : 2019-11-01 DOI:10.1109/ITNAC46935.2019.9077927

L. Hiryanto, S. Soh, Kwan-Wu Chin, M. Lazarescu

{"title":"Green Multi-Stage Upgrade for Bundled-Link SDNs with Budget Constraint","authors":"L. Hiryanto, S. Soh, Kwan-Wu Chin, M. Lazarescu","doi":"10.1109/ITNAC46935.2019.9077927","DOIUrl":null,"url":null,"abstract":"Upgrading a legacy network into a Software Defined Network (SDN) in stages, and minimizing the energy consumption of a network are now of great interests 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 only if they are adjacent to a SDN switch, and (ii) decreasing upgrade cost and increasing traffic demands over multiple stages. We formulate the problem as an Integer Linear Program (ILP) and propose a greedy heuristic called Green Multi-stage Switch Upgrade (GMSU). Experiment results show that increasing budget as well as number of stages affect the total energy saved and number of upgraded switches. GMSU produces results that are up to 5.8% off the optimal result. Moreover, on large networks, in which ILP becomes computationally intractable, GMSU uses less than 0.1 second to compute a solution.","PeriodicalId":407514,"journal":{"name":"2019 29th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 29th International Telecommunication Networks and Applications Conference (ITNAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNAC46935.2019.9077927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

Upgrading a legacy network into a Software Defined Network (SDN) in stages, and minimizing the energy consumption of a network are now of great interests 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 only if they are adjacent to a SDN switch, and (ii) decreasing upgrade cost and increasing traffic demands over multiple stages. We formulate the problem as an Integer Linear Program (ILP) and propose a greedy heuristic called Green Multi-stage Switch Upgrade (GMSU). Experiment results show that increasing budget as well as number of stages affect the total energy saved and number of upgraded switches. GMSU produces results that are up to 5.8% off the optimal result. Moreover, on large networks, in which ILP becomes computationally intractable, GMSU uses less than 0.1 second to compute a solution.

查看原文本刊更多论文

预算约束下捆绑链路sdn的绿色多阶段升级

将传统网络分阶段升级为软件定义网络(SDN)，并将网络的能耗降至最低，这是运营商非常感兴趣的问题。为此，本文提出了一个新的问题:在每个阶段可用的货币预算的约束下，通过在多个阶段升级交换机来最小化网络的能源消耗。我们的问题考虑了(i)只有在SDN交换机相邻时才能单独关闭的捆绑链路，以及(ii)在多个阶段降低升级成本和增加流量需求。我们将该问题表述为整数线性规划(ILP)，并提出一种贪婪启发式的绿色多级开关升级(GMSU)方法。实验结果表明，增加预算和阶段数会影响总节能和升级开关数量。GMSU产生的结果与最佳结果相差高达5.8%。此外，在大型网络中，ILP变得难以计算，GMSU使用不到0.1秒的时间来计算一个解决方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2019 29th International Telecommunication Networks and Applications Conference (ITNAC)

自引率

0.00%

发文量