Computer Science ›› 2018, Vol. 45 ›› Issue (4): 112-116.doi: 10.11896/j.issn.1002-137X.2018.04.017

Previous Articles     Next Articles

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

GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping   

  • Online:2018-04-15 Published:2018-05-11

Abstract: 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.

Key words: Intra-domain routing,Energy consumption,Green network,Directed acyclic graph

[1] The Climate Group.Smart 2020:Enabling the low carbon economy in the information age[R].London,2008.
[2] LANGE C,KOSIANKOWSKI D,WEIDMANN R,et al.Energy Consumption of Telecommunication Networks and Related Improvement Options[J].IEEE Journal of Selected Topics inQuantum Electronics,2011,17(2):285-295.
[3] CLARK D.The design philosophy of the DARPA internet protocols [C]∥ACM SIGCOMM Computer Communication Review.1988:106-114.
[4] FISHER W,SUCHARA M,REXFORD J.Greening backbone networks:reducing energy consumption by shutting off cables in bundled links[C]∥Proceedings of the First ACM SIGCOMM Workshop on Green Networking.2010:29-34.
[5] MINERAUD J,WANG L,BALASUB RAMANI A M S,et al.Hybrid renewable energy routing for ISP networks[C]∥IEEE Conference on Computer Communications.2016:1-9.
[6] YANG Y,WANG D,PAN D,et al.Wind Blows,Traffic Flows:Green Internet Routing under Renewable Energy[C]∥IEEE Conference on Computer Communications.2016.
[7] CHIARAVIGLIO,LUCA,MELLIA M,et al.Minimizing ISPNetwork Energy Cost:Formulation and Solutions[J].IEEE/ACM Transactions on Networking,2012,20(2):463-476.
[8] LI Q,XU M,YANG Y,et al.Safe and Practical Energy-Efficient Detour Routing in IP Networks [J].IEEE/ACM Transactions on Networking,2014,22(6):1925-1937.
[9] ZHANG M,YI C,LIU B,et al.GreenTE:Power-aware traffic-engineering[C]∥IEEE International Conference on Network Protocols.IEEE Computer Society,2010:21-30.
[10] KRIST P.Scalable and Efficient Multipath Routing:Complexity and Algorithms[C]∥2015 IEEE 23rd International Conference on Network Protocols(ICNP).IEEE,2015:376-385.
[11] OHARA Y,IMAHORI S,METER R V.MARA:Maximum Alternative Routing Algorithm[C]∥Proceedings of IEEE INFOCOM.2009:298-306.
[12] KWONG K W,GAO L,ZHANG Z L,et al.On the feasibility and efficacy of protection routing in IP networks[J].IEEE/ACM Transactions on Networking,2011,19(5):1543-1556.
[13] SPRING N,MAHAJAN R,WETHERALL D,et al.Measuring isp topologies with rocketfuel [J].IEEE/ACM Transactions on Networking,2016,12(1):2-16.
[15] Power Management for the Cisco 12000 Series Router.
[16] CHABAREK J,SOMMERS J,BARFORD P,et al.Power-Awareness in Network Design and Routing[C]∥INFOCOM 2008.2008.
[17] RAHMAN M M,SAHA S,CHENGAN U,et al.IP Traffic Matrix Estimation Methods:Comparisons and Improvements[C]∥ICC 2006.2006:90-96.
[18] XU D H,CHIANG M,REXFORD J.Link-state routing withhop-by-hop forwarding can achieve optimal traffic engineering[C]∥INFOCOM 2008.2008:1717-1730.

No related articles found!
Full text



[1] . [J]. Computer Science, 2018, 1(1): 1 .
[2] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[3] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[4] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[5] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[6] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[7] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[8] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .