耿海军,施新刚,王之梁,尹霞,尹少平.基于有向无环图的互联网域内节能路由算法[J].计算机科学,2018,45(4):112-116
基于有向无环图的互联网域内节能路由算法
Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph
投稿时间:2017-02-03  修订日期:2017-04-18
DOI:10.11896/j.issn.1002-137X.2018.04.017
中文关键词:  域内路由,能耗,绿色网络,有向无环图
英文关键词:Intra-domain routing,Energy consumption,Green network,Directed acyclic graph
基金项目:本文受国家重点基础研究发展计划(“863”计划)基金资助
作者单位E-mail
耿海军 山西大学软件学院 太原030006 ghj123025449@163.com 
施新刚 清华大学网络科学与网络空间研究院 北京100048  
王之梁 清华大学网络科学与网络空间研究院 北京100048  
尹霞 清华大学计算机科学与技术系 北京100048  
尹少平 山西大学软件学院 太原030006  
摘要点击次数: 260
全文下载次数: 185
中文摘要:
      互联网在快速发展的过程中面临新的挑战,其中网络能耗问题尤为突出。学术界提出了大量用于 解决网络能耗问题 的方案,然而这些方案都考虑了网络中的实时流量数据,计算复杂度较高,不利于实际部署。对此,提出一种基于有向无环图的互联网域内节能路由算法(Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph,EEBDAG),该方法 利用有向无环图来解决因链路关闭造成的路由环路和网络性能下降等问题, 仅须考虑网络拓扑结构,不需要考虑网络中的实时流量数据 。实验结果表明,EEBDAG不仅具有较低的节能比率,而且具有较低的链路利用率,为ISP解决互联网节能问题提供了一种全新的方案。
英文摘要:
      With the rapid development of Internet,it is facing lots of challenges,in which the problem of network energy consumption is particularly prominent.Therefore,the academics put forward a large number of schemes to solve the problem.However,all of these methods need to consider the real-time traffic data in the network,and the computation complexity is very high,which is inconvenient to the actual deployment.Therefore,this paper proposed an energy-efficient intra-domain routing algorithm based on directed acyclic graph,which merely relies on network topology,without traffic awareness.The proposed scheme builds a directed acyclic graph for each node in the network,for the purpose of avoiding routing loops and alleviating the network performance degradation caused by cutting off links.Experimental results show that EEBDAG not only has lower energy-saving ratio,but also has lower link utilization,which provides an efficient solution for the ISP solving the Internet energy saving problem.
查看全文  查看/发表评论  下载PDF阅读器