基于代数连通度的域内节能路由算法

Intra-domain Energy Efficient Routing Algorithm Based on Algebraic Connectivity

通过节能路由算法减少网络能耗是网络中需要解决的一个关键性的科学问题。如今已有的节能方案都是在已知流量矩阵的前提下研究网络节能,由于实时流量难以获取,使得这些方案都难以在实际中部署。因此,文中提出一种基于代数连通度的域内节能方案(Intra-domain Energy Efficient Routing Scheme Based on Algebraic Connectivity,EERSBAC)。EERSBAC不需要网络中的实时流量矩阵,仅依靠网络中的拓扑结构就可以实现节能。首先,提出链路关键度模型,利用链路关键度模型计算出网络中所有链路的重要程度;然后,提出代数连通度模型,利用代数连通度模型可以定量的衡量网络的连通性能。实验结果表明,EERSBAC不仅能够降低网络能耗,而且具有较小的路径拉伸度。

Reducing network energy consumption through energy-efficient routing algorithm is a key scientific problem in the network.However,the existing energy-efficient routing algorithms are all based on the known traffic matrix,because the real-time traffic is difficult to obtain.Therefore,this paper proposed an intra-domain energy efficient routing scheme based on algebraic connectivity(EERSBAC).EERSBAC does not need the real-time traffic matrix in the network,but only relies on the topological structure of the network to achieve energy saving.Firstly,a link criticality model is proposed to calculate the importance of all links in the network.And then,an algebraic connectivity model is proposed to quantitatively measure the connectivity performance of the network.The experimental results show that EERSBAC not only reduce network energy consumption,but also has a smaller path stretch.