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

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

扫码查看
原文链接
  • 万方数据
  • 维普
随着信息技术的高速发展,互联网的规模逐渐增大,与此同时,网络的能耗也随之攀升.业界普遍采用关闭利用率较低的链路来降低网络能耗.然而,目前的网络节能方案并不能有效平衡能量节约率、计算开销和路径拉伸度三者之间此消彼长的关系.为了应对上述问题,文中提出了 一种基于链路关联度模型的绿色节能路由框架.该框架支持不同的链路关联度模型,仅需要网络拓扑结构,而不需要网路中的实时流量矩阵,更易于在实际网络中部署.基于提出的链路关联度模型的绿色节能路由算法的框架,文中实现了链路行关联度算法LRC(Link Row Correlation)、链路列关联度算法LCC(Link Column Correla-tion)、链路行-列关联度算法 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％.
Green Energy-saving Routing Framework Based on Link Correlation Model
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.

Green energy-saving routingLink correlation modelPath stretchEnergy saving rate

王玲、金子琨、吴勇、耿海军

展开 >

山西大学自动化与软件学院 太原 030006

山西大学计算机与信息技术学院 太原 030006

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

山西省应用基础研究计划山西省应用基础研究计划山西省高等学校科技创新项目中国高校产学研创新基金项目山西省重点研发计划项目山西省重点研发计划项目国家自然科学基金项目国家重点研发计划项目

20210302123444202103021245562022L0022021FNA02009201903D421003202202020101004617023152018YFB1800401

2024

10.11896/jsjkx.230800103

计算机科学
重庆西南信息有限公司（原科技部西南信息中心）

计算机科学

CSTPCD北大核心
影响因子：0.944
ISSN：1002-137X
年,卷(期)：2024.51(3)
  • 26