Computer Science

Computer Science ›› 2020, Vol. 47 ›› Issue (4): 238-242.doi: 10.11896/jsjkx.190600064

• Computer Network • Previous Articles     Next Articles

Intra-domain Energy Efficient Routing Algorithm Based on Algebraic Connectivity

GENG Hai-jun1, ZHANG Wen-xiang1, YIN Xia2   

  1. 1 School of Software Engineering,Shanxi University,Taiyuan 030006,China;
    2 Department of Computer Science Technology,Tsinghua University,Beijing 100084,China
  • Received:2019-06-13 Online:2020-04-15 Published:2020-04-15
  • Contact: GENG Hai-jun,born in 1983,Ph.D,lecturer,is a member of China Computer Federation.His man research interests include future Internet architecture and routing algorithm.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (61702315),Scientific and Technological Innovation Programs of Higher Education Institutions in Shanxi (201802013) and National Key R&D Program of China (2018YFB1800401).

PDF (PC)

588

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

Key words: Algebraic connectivity, Energy efficient routing, Link betweenness, Link criticality, Path stretch

CLC Number: 

  • TP393.2
[1]GUPTA M,SINGH S.Greening of the Internet[C]//Proceedings of the ACM Conference on Applications,Technologies,Architectures,and Protocols for Computer Communications (SIGCOMM 2003).2003:19-26.
[2]JIA X,JIANG Y,GUO Z,et al.Intelligent Path Control for Energy-saving in Hybrid SDN Networks.Computer Networks,2018,131:65-76.
[3]KOCAOGLU M,MALAK D,AKAN O.Fundamentals of Green Communications and Computing:Modeling and Simulation.IEEE Computer Society Press,2012.
[4]XU M,SHANG Y,LI D,et al.Greening data center networks with throughput-guaranteed power-aware routing.Computer Networks,2013,57(15):2880-2899.
[5]YANG Y,WANG D,PAN D,et al.Wind blows,traffic flows:Green Internet routing under renewable energy[C]//Procee-dings of the IEEE Conference on Computer Communications (INFOCOM).2016:1-9.
[6]MINERAUD J,WANG L,BALASUBRAMANIAM S,et al.Hybrid renewable energy routing for ISP networks[C]//Proceedings of the IEEE Conference on Computer Communications (INFOCOM).2016:1-9.
[7]CHABAREK J ,SOMMERS J ,BARFORD P ,et al.PowerAwareness in Network Design and Routing[C]//Proceedings of the IEEE Conference on Computer Communications (INFOCOM).2008:457-465.
[8]CHIARAVIGLIO L,CIULLO D,MELLIA M,et al.Modeling sleep mode gains in energy-aware networks .Computer Networks,2013,57(15):3051-3066.
[9]ANDREWS M,ANTA A F,ZHANG L,et al.Routing for Energy Minimization in the Speed Scaling Model[C]//Conference on Information Communications.IEEE Press,2010:2435-2443.
[10]CHIARAVIGLIO L,CIANFRANI A,ROUZIC E L,et al.Sleep modes effectiveness in backbone networks with limited configurations.Computer Networks the International Journal of Computer & Telecommunications Networking,2013,57(15):2931-2948.
[11]ZHANG M,YI C,LIU B,et al.GreenTE:Power-aware trafficengineering[C]//The IEEE International Conference on Network Protocols.IEEE Computer Society,2010:21-30.
[12]CHIARAVIGLIO L,MELLIA M,NERI F.Minimizing ISPNetwork Energy Cost:Formulation and Solutions.IEEE/ACM Transactions on Networking,2012,20(2):463-476.
[13]YANG Y,XU M,WANG D,et al.A Hop-by-Hop RoutingMechanism for Green Internet.IEEE Transactions on Parallel & Distributed Systems,2016,27(1):2-16.
[14]ZHOU B,ZHANG F,WANG L,et al.HDEER:A Distributed Routing Scheme for Energy-Efficient Networking.IEEE Journal on Selected Areas in Communications,2016,34(5):1713-1727.
[15]MERRIS R.Laplacian matrices of graphs:a survey.Linear Algebra & Its Applications,1994,197-198(2):143-176.
[16]CUOMO F,CIANFRANI A,POLVERINI M,et al.Networkpruning for energy saving in the Internet.Computer Networks,2012,56(10):2317-2550.
[17]GENG H,SHI X,WANG Z,et al.A hop-by-hop dynamic distributed multipath routing mechanism for link state network.Computer Communications,2018,116:225-239.
[18]YANG Y,XU M,LI Q.Fast Rerouting Against Multi-LinkFailures Without Topology Constraint.IEEE/ACM Transactions on Networking,2017:1-14.
[19]GENG H,SHI X,YIN X,et al.Algebra and algorithms for multipath QoS routing in link state networks.Journal of Communications and Networks,2017,19(2):189-200.
[1] ZHANG Ju, WANG Hao, LUO Shu-ting, GENG Hai-jun, YIN Xia. Hybrid Software Defined Network Energy Efficient Routing Algorithm Based on Genetic Algorithm [J]. Computer Science, 2020, 47(6): 236-241.
[2] SU Fan-jun,DU Ke-yi. Trust Based Energy Efficient Opportunistic Routing Algorithm in Wireless Sensor Networks [J]. Computer Science, 2020, 47(2): 300-305.
[3] ZHANG Ju, GENG Hai-jun, LIU Jie-qi. Intra-domain Energy Efficiency Routing Scheme Based on Network Entropy [J]. Computer Science, 2019, 46(2): 76-80.
[4] HAO Ju-tao,ZHAO Jing-jing,LI Ming-lu. Energy Level and Link State-based AODV Route Request Forwarding Scheme Study [J]. Computer Science, 2009, 36(7): 68-70.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
Add:18# Honghu West Rd., Yubei ,Chongqing,China    Post Code: 401121
Tel: 023-63500828/023-67039612/023-67039623
E-mail: jsjkx12@163.com
Powered by Beijing Magtech Co., Ltd.