基于有向无环图的互联网域内节能路由算法  

Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph

作　　者：耿海军 施新刚[2] 王之梁[2] 尹霞[3] 尹少平 GENG Hai-jun;SHI Xin-gang;WANG Zhi-liang;YIN Xia;YIN Shao-ping(School of Software Engineering,Shanxi University,Taiyuan 030006,China;Institute for Network Sciences and Cyberspace,Tsinghua University,Beijing 100048,China;Department of Computer Science&Technology,Tsinghua University,Beijing 100048,China)

机构地区：[1]山西大学软件学院,太原030006 [2]清华大学网络科学与网络空间研究院,北京100048 [3]清华大学计算机科学与技术系,北京100048

出　　处：《计算机科学》2018年第4期112-116,共5页Computer Science

基　　金：国家重点基础研究发展计划("863"计划)基金资助项目(2015AA016105);国家自然科学基金资助项目(61702315)资助

摘　　要：互联网在快速发展的过程中面临新的挑战,其中网络能耗问题尤为突出。学术界提出了大量用于解决网络能耗问题的方案,然而这些方案都考虑了网络中的实时流量数据,计算复杂度较高,不利于实际部署。对此,提出一种基于有向无环图的互联网域内节能路由算法(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.

关 键 词：域内路由 能耗 绿色网络 有向无环图 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]