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

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

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