Integer Programming Based Optimization of Power Consumption for Data Center Networks

IF 0.3 Q4 COMPUTER SCIENCE, CYBERNETICS
Gergely Kovásznai, Mohammed Nsaif
{"title":"Integer Programming Based Optimization of Power Consumption for Data Center Networks","authors":"Gergely Kovásznai, Mohammed Nsaif","doi":"10.14232/actacyb.299115","DOIUrl":null,"url":null,"abstract":"With the quickly developing data centers in smart cities, reducing energy consumption and improving network performance, as well as economic benefits, are essential research topics. In particular, Data Center Networks do not always run at full capacity, which leads to significant energy consumption. This paper experiments with a range of optimization tools to find the optimal solutions for the Integer Linear Programming (ILP) model of network power consumption. The study reports on experiments under three communication patterns (near, long, and random), measuring runtime and memory consumption in order to evaluate the performance of different ILP solvers.While the results show that, for near traffic pattern, most of the tools rapidly converge to the optimal solution, CP-SAT provides the most stable performance and outperforms the other solvers for the long traffic pattern. On the other hand, for random traffic pattern, Gurobi can be considered to be the best choice, since it is able to solve all the benchmark instances under the time limit and finds solutions faster by 1 or 2 orders of magnitude than the other solvers do.","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Cybernetica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14232/actacyb.299115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 1

Abstract

With the quickly developing data centers in smart cities, reducing energy consumption and improving network performance, as well as economic benefits, are essential research topics. In particular, Data Center Networks do not always run at full capacity, which leads to significant energy consumption. This paper experiments with a range of optimization tools to find the optimal solutions for the Integer Linear Programming (ILP) model of network power consumption. The study reports on experiments under three communication patterns (near, long, and random), measuring runtime and memory consumption in order to evaluate the performance of different ILP solvers.While the results show that, for near traffic pattern, most of the tools rapidly converge to the optimal solution, CP-SAT provides the most stable performance and outperforms the other solvers for the long traffic pattern. On the other hand, for random traffic pattern, Gurobi can be considered to be the best choice, since it is able to solve all the benchmark instances under the time limit and finds solutions faster by 1 or 2 orders of magnitude than the other solvers do.
基于整数规划的数据中心网络功耗优化
随着智慧城市数据中心的快速发展,降低能耗、提高网络性能、提高经济效益是必不可少的研究课题。特别是,数据中心网络并不总是满负荷运行,这会导致大量的能源消耗。本文尝试了一系列优化工具来寻找网络功耗整数线性规划(ILP)模型的最优解。该研究报告了三种通信模式(近、长、随机)下的实验,测量了运行时和内存消耗,以评估不同ILP求解器的性能。结果表明,对于近交通模式,大多数工具都能快速收敛到最优解,而对于长交通模式,CP-SAT提供了最稳定的性能并优于其他求解器。另一方面,对于随机的流量模式,Gurobi可以被认为是最好的选择,因为它能够在时间限制内解决所有的基准实例,并且比其他求解器更快地找到解决方案1到2个数量级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Acta Cybernetica
Acta Cybernetica COMPUTER SCIENCE, CYBERNETICS-
CiteScore
1.10
自引率
0.00%
发文量
17
期刊介绍: Acta Cybernetica publishes only original papers in the field of Computer Science. Manuscripts must be written in good English.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信