Improved Energy-Aware Routing Algorithm in Software-Defined Networks

Adriana Fernández-Fernández, C. Cervelló-Pastor, Leonardo Ochoa-Aday
{"title":"Improved Energy-Aware Routing Algorithm in Software-Defined Networks","authors":"Adriana Fernández-Fernández, C. Cervelló-Pastor, Leonardo Ochoa-Aday","doi":"10.1109/LCN.2016.41","DOIUrl":null,"url":null,"abstract":"The growing energy consumption of communication networks has attracted the attention of the networking researchers in the last decade. In this context, SDN allows a flexible programmability, suitable for the power-consumption optimization problem. In this paper we present an energy-aware routing approach which minimizes the number of links used to satisfy a given traffic demand. Different from previous works, we optimize energy consumption in OpenFlow networks with in-band control traffic. To this end, we start formulating an optimization model that considers routing requirements for control and data plane communications. To reduce the complexity of our model in large-scale topologies, a heuristic algorithm is developed as well. Although it is not widely researched, except for quantitative and heuristic results, we also derive a simple and efficient algorithm for the best controller placement in terms of energy saving. Simulation results confirm that the proposed solution enables the achievement of significant energy savings.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"25 1","pages":"196-199"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2016.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

The growing energy consumption of communication networks has attracted the attention of the networking researchers in the last decade. In this context, SDN allows a flexible programmability, suitable for the power-consumption optimization problem. In this paper we present an energy-aware routing approach which minimizes the number of links used to satisfy a given traffic demand. Different from previous works, we optimize energy consumption in OpenFlow networks with in-band control traffic. To this end, we start formulating an optimization model that considers routing requirements for control and data plane communications. To reduce the complexity of our model in large-scale topologies, a heuristic algorithm is developed as well. Although it is not widely researched, except for quantitative and heuristic results, we also derive a simple and efficient algorithm for the best controller placement in terms of energy saving. Simulation results confirm that the proposed solution enables the achievement of significant energy savings.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
软件定义网络中改进的能量感知路由算法
近十年来,日益增长的通信网络能耗引起了网络研究人员的广泛关注。在这种情况下,SDN允许灵活的可编程性,适合于功耗优化问题。在本文中,我们提出了一种能量感知路由方法,该方法可以最大限度地减少用于满足给定流量需求的链路数量。与以往的工作不同,我们优化了OpenFlow网络中带内控制流量的能耗。为此,我们开始制定一个优化模型,该模型考虑了控制和数据平面通信的路由需求。为了降低模型在大规模拓扑结构中的复杂性,我们还开发了一种启发式算法。虽然目前还没有广泛的研究,但除了定量和启发式的结果外,我们还从节能的角度推导了一种简单有效的最佳控制器布局算法。仿真结果证实了所提出的解决方案能够实现显著的节能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the General Chair Message from the general chair Best of Both Worlds: Prioritizing Network Coding without Increased Space Complexity Controlling Network Latency in Mixed Hadoop Clusters: Do We Need Active Queue Management? TransFetch: A Viewing Behavior Driven Video Distribution Framework in Public Transport
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1