Energy-aware routing based on link utilization in domain network

Jingfan Tang, W. ., M. Zhang, Ming Jiang, Qicheng Wang
{"title":"Energy-aware routing based on link utilization in domain network","authors":"Jingfan Tang, W. ., M. Zhang, Ming Jiang, Qicheng Wang","doi":"10.18311/ijprvd/2020/27953","DOIUrl":null,"url":null,"abstract":"Aimed at the characteristic of the Software Defined Network (SDN), several green routing algorithms are proposed. However, there are many drawbacks consisted in the existing algorithms. Therefore, we propose a self-adaptive energy saving routing algorithm (LAR) which is based on residual bandwidth of links and SDN. The proposed algorithm makes the link utilization which is changing in real time as the link cost. It would obtain the topology information and link status to optimize and prune the topology for reducing the computing time of routing algorithm before selecting routing path. After a period of time, the incoming flows will automatically be gathered in heavily-loaded links. The links without traffic will be switched off while the whole network connectivity and QoS are guaranteed. Simulation results show that it is possible to reduce considerable energy consumption during off-peak hours and link energy saving can be up to 55%. And, the algorithm has the distinct advantage in terms of complexity and network performance comparing with related schemes.","PeriodicalId":226140,"journal":{"name":"Indian Journal of Power and River Valley Development","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indian Journal of Power and River Valley Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18311/ijprvd/2020/27953","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Aimed at the characteristic of the Software Defined Network (SDN), several green routing algorithms are proposed. However, there are many drawbacks consisted in the existing algorithms. Therefore, we propose a self-adaptive energy saving routing algorithm (LAR) which is based on residual bandwidth of links and SDN. The proposed algorithm makes the link utilization which is changing in real time as the link cost. It would obtain the topology information and link status to optimize and prune the topology for reducing the computing time of routing algorithm before selecting routing path. After a period of time, the incoming flows will automatically be gathered in heavily-loaded links. The links without traffic will be switched off while the whole network connectivity and QoS are guaranteed. Simulation results show that it is possible to reduce considerable energy consumption during off-peak hours and link energy saving can be up to 55%. And, the algorithm has the distinct advantage in terms of complexity and network performance comparing with related schemes.
基于链路利用率的域网络能量感知路由
针对软件定义网络(SDN)的特点,提出了几种绿色路由算法。然而,现有的算法存在许多缺陷。因此,我们提出了一种基于链路剩余带宽和SDN的自适应节能路由算法(LAR)。该算法将实时变化的链路利用率作为链路成本。在选择路由路径之前,获取拓扑信息和链路状态,对拓扑进行优化和剪枝,减少路由算法的计算时间。一段时间后,传入的流将自动聚集在重载链接中。在保证全网连通性和QoS的前提下,关闭无流量的链路。仿真结果表明,在非高峰时段可以减少相当大的能耗,链路节能可达55%。与相关方案相比,该算法在复杂度和网络性能方面具有明显的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信