计算机科学 ›› 2024, Vol. 51 ›› Issue (3): 289-299.doi: 10.11896/jsjkx.230800103

• 计算机网络 • 上一篇    下一篇

基于链路关联度模型的绿色节能路由框架

王玲1, 金子琨2, 吴勇1, 耿海军1,2   

  1. 1 山西大学自动化与软件学院 太原030006
    2 山西大学计算机与信息技术学院 太原030006
  • 收稿日期:2023-08-16 修回日期:2023-11-11 出版日期:2024-03-15 发布日期:2024-03-13
  • 通讯作者: 吴勇(wuyong@sxu.edu.cn)
  • 作者简介:(jonas_wang@163.com)
  • 基金资助:
    山西省应用基础研究计划(20210302123444,20210302124556);山西省高等学校科技创新项目(2022L002);中国高校产学研创新基金项目(2021FNA02009);山西省重点研发计划项目(201903D421003,202202020101004);国家自然科学基金项目(61702315);国家重点研发计划项目(2018YFB1800401).

Green Energy-saving Routing Framework Based on Link Correlation Model

WANG Ling1, JIN Zikun2, WU Yong1, GENG Haijun1,2   

  1. 1 School of Automation and Software Engineering,Shanxi University,Taiyuan 030006,China
    2 School of Computer and Information Technology,Shanxi University,Taiyuan 030006,China
  • Received:2023-08-16 Revised:2023-11-11 Online:2024-03-15 Published:2024-03-13
  • About author:WANG Ling,born in 1980,master,assistant.Her main research interests include Internet routing algorithm and network architecture.WU Yong,born in 1981,master,lectu-rer.His main research interests include Internet routing algorithm and network architecture.
  • Supported by:
    Applied Basic Research Program of Shanxi Province(20210302123444,20210302124556),Scientific and Technological Innovation Programs of Higher Education Institutions in Shanxi(2022L002),Ministry of Education(CN) Industry-University-Research Innovation Fund(2021FNA02009),Key Research and Development Program of Shanxi Province(201903D421003,202202020101004),National Natural Science Foundation of China(61702315) and National Key Research and Development Program of China(2018YFB1800401).

摘要: 随着信息技术的高速发展,互联网的规模逐渐增大,与此同时,网络的能耗也随之攀升。业界普遍采用关闭利用率较低的链路来降低网络能耗。然而,目前的网络节能方案并不能有效平衡能量节约率、计算开销和路径拉伸度三者之间此消彼长的关系。为了应对上述问题,文中提出了一种基于链路关联度模型的绿色节能路由框架。该框架支持不同的链路关联度模型,仅需要网络拓扑结构,而不需要网路中的实时流量矩阵,更易于在实际网络中部署。基于提出的链路关联度模型的绿色节能路由算法的框架,文中实现了链路行关联度算法LRC(Link Row Correlation)、链路列关联度算法LCC(Link Column Correlation)、链路行-列关联度算法LRCC(Link Row Column Correlation)和链路介数关联度LBC(Link Betweenness Correlation)4种不同的绿色节能路由算法。实验结果表明,在The Internet Topology Zoo公布的真实拓扑和由Brite模拟生成的拓扑中,LRC,LCC,LRCC和LBC的平均能量节约率比DLF算法的平均能量节约率高12.65%和7.17%,且它们的平均路径拉伸度比DLF算法的平均路径拉伸度低3.00%和13.75%。

关键词: 绿色节能路由, 链路关联度模型, 路径拉伸度, 能量节约率

Abstract: With the rapid development of information technology,the scale of the Internet is increasing.At the same time,the energy consumption of the network is rising.In order to reduce network energy consumption,the industry generally adopts the method of closing the link with low link utilization.However,the current network energy-saving scheme can not effectively ba-lance the trade-off among energy-saving rate,computational overhead and path stretch.In order to solve the above problems,this paper proposes a green energy-saving routing framework based on link correlation model.The framework supports different link correlation models.It only needs the network topology,not the real-time traffic matrix in the network,so it is easier to deploy in the actual network.Based on the green energy-saving routing framework based on link correlation model,this paper implements four different energy-saving green routing algorithms:LRC(link row correlation),LCC(link column correlation),LRCC(link row column correlation) and LBC(link betweenness correlation).Experimental results show that in the real topology published by The Internet Topology Zoo and the topology generated by Brite simulation,the average energy saving rate of LRC,LCC,LRCC and LBC is 12.65% and 7.17% higher than that of DLF algorithm,and their average path stretch under the real topology and simulated topology is 3.00% and 13.75% lower than that of DLF algorithm.

Key words: Green energy-saving routing, Link correlation model, Path stretch, Energy saving rate

中图分类号: 

  • TP393
[1]AL-NEDAWE B M,ALHUMAIMA R S,ALI W H.On the quality of service of next generation green networks[J].IET Networks,2022,11(1):1-12.
[2]ZHANG M,YANG W,GAO S,et al.Network energy-savingadjustment routing under changing demands:models and algorithms[J].IEEE Access,2020,8:90676-90685.
[3]MANJATE J A,HIDELL M,SJÖDIN P.Can energy-aware routing improve the energy savings of energy-efficient ethernet?[J].IEEE Transactions on Green Communications and Networking,2018,2(3):787-794.
[4]BIANZINO A P,CHAUDET C,ROSSI D,et al.A survey of green networking research[J].IEEE Communications Surveys and Tutorials,2012,14(1):3-20.
[5]OUEDRAOGO I A,EIJI O.A green and robust optimizationstrategy for energy saving against traffic uncertainty[J].IEEE Journal on Selected Areas in Communications,2016,34(5):1405-1416.
[6]LEI J R,DENG S H,LU Z B,et al.Energy-saving traffic sche-duling in backbone networks with software-defined networks[J].Cluster Computing,2020,24(1):279-292.
[7]RIVEROS G,CESPEDES-SANCHEZ P P,PINTO-ROA D P,et al.ILP-based energy saving routing for software defined networking[C]//XLV Latin American Computing Conference.2019:1-7.
[8]KHREISHAH A,BANY S H,KHALIL I,et al.Renewableenergy-aware joint caching and routing for green communication networks[J].IEEE Systems Journal,2018,12(1):768-777.
[9]ZHOU B Y,ZHANG F,WANG L,et al.HDEER:a distributed routing scheme for energy-efficient networking[J].IEEE Journal on Selected Areas in Communications,2016,34(5):1713-1727.
[10]LEE S S W,TSENG P K,CHEN A.Multi-topology design and link weight assignment for green IP networks[C]//IEEE Symposium on Computers and Communications.2011.377-382.
[11]CIANFRANI A,ERAMO V,LISTANTI M,et al.An energy saving routing algorithm for a green OSPF protocol[C]//INFOCOM IEEE Conference on Computer Communications Workshops.2010:1-5.
[12]AMALDI E,CAPONE A,GIANOLI L G,et al.A MILP-based heuristic for energy-aware traffic engineering with shortest path routing[M].Network Optimization,2011:464-477.
[13]LEE S S W,TSENG P K,CHEN A.Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet[J].Future Generation Computer Systems,2012,28(2):437-445.
[15]ZHAGN J H,WANG X W,HUANG M,et al.A Distributed Topology Management Scheme for Energy Saving in Green Internet[J].Chinese Journal of Computers,2017,40(7):1517-1529.
[16]CHIARAVIGLIO L,MELLIA M,NERI F.Reducing power consumption in backbone networks[C]//IEEE International Conference on Communications.2009:1-6.
[17]CHIARAVIGLIO L,MELLIA M,NERI F.Energy-aware backbone networks:a case study[C]//IEEE International Confe-rence on Communications Workshops.2009:1-5.
[18]CHIARAVIGLIO L,MELLIA M,NERI F.Minimizing ISP network energy cost:formulation and solutions[J].IEEE/ACM Transactions on Networking,2012,20(2):463-479.
[19]GELENBE E,SILVESTRI S.Optimisation of power consumption in wired packet networks[C]//Quality of Service in Hete-rogeneous Networks.2009:717-729.
[20]BIANZINO A P,CHIARAVIGLIO L,MELLIA M.Distributed Algorithms for Green IP Networks[C]//IEEE INFOCOM Workshops.2012:121-126.
[21]BIANZINO A P,CHIARAVIGLIO L,MELLIA M,et al.GRiDA:green distributed algorithm for energy-efficient IP backbone networks[J].Computer Networks,2012,56(14):3219-3232.
[22]CHIARAVIGLIO L,CIANFRANI A,ROUZIC E L,et al.Sleep modes effectiveness in backbone networks with limited configurations[J].Computer Networks,2013,57(15):2931-2948.
[23]RESTREPO J C C,GRUBER C G,MACHUCA C M.Energy profile aware routing[C]//IEEE International Conference on Communications Workshops.2009:1-5.
[24]CHIARAVIGLIO L,CIULLO D,MELLIA M,et al.Modeling sleep modes gains with random graphs[C]//IEEE Conference on Computer Communications Workshops.2011:355-360.
[25]CHIARAVIGLIO L,CIULLO D,MELLIA M,et al.Modeling sleep mode gains in energy-aware networks[J].Computer Networks,2013,57(15):3051-3066.
[26]ANDREWS M,ANTA A F,ZHANG L,et al.Routing for energy minimization in the speed scaling model[C]//IEEEINFOCOM.2010:1-9.
[27]MINERAUD J,WANG L,BALASUBRAMANIAM S,et al.Hybrid renewable energy routing for ISP networks[C]//IEEE INFOCOM.2016:1-9.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!