Research On Energy-Saving Routing Algorithm Based On Software Defined Network

The rapid development of communication network technology has brought convenience to our lives,but with the increase of data volume and scale,how to effectively solve the problem of network energy consumption has become a hot topic of current research.Software Defined Network(SDN)as an emerging network architecture,it decouples the control functions of the underlying network equipment,and realizes flexible scheduling of network traffic through features such as centralized control and openness of network interfaces.In this paper,we use the above characteristics to design routing algorithms and traffic scheduling strategies that can achieve high energy efficiency.There have been some researches on energy conversation in traditional network or software-defined network.For example,on the premise of meeting traffic requirements,they reduce energy consumption by sleeping as many network devices as possible.In addition,they also improve network utilization,reduce energy consumption per unit of data transmission and so on to achieve energy savings.To a certain extent,these studies mentioned above can all achieve energy saving and improve network performance,but they ignore the importance of network energy conservation issues and success rates of various network architectures in energy conservation research.In response to the above problems,the main contributions and innovations of this article are as follows:(1)The complexity of the connection in the network will affect the performance of the network.In order to comprehensively analyze the energy efficiency of the network,this paper summarizes and analyzes all networks in a library of test instances for Survivable fixed telecommunication Network Design(SNDlib).According to the calculation results of the connection complexity in each network,this paper divides all networks into four categories,and then selects two types of smaller and larger network topologies from the four categories,and selects eight types of networks as experimental objects.(2)When the useless nodes or links are closed or network utilization is increased to achieve energy saving,this study finds that when selecting the best routing path,multiple equal paths will be selected.In fact,different transmission rates on the link Cause different energy consumption to the network.Therefore,this paper proposes a new algorithm called Maximum Width Utilization of Activated Links(MBAL,Maximum Bandwidth utilization of Activated Links),which selects the path corresponding to the maximum bandwidth utilization of the newly added minimum active link as the target path,and realizes network energy conservation by jointly optimizing the number of links and utilization.(3)For traffic requests over a period of time,if there are too many traffic requests and the traffic rate is too large,some traffic requests will fail to find the best routing path.Therefore,this paper proposes a traffic scheduling strategy called Small Traffic Firstly Scheduling(STF),and combines it with priority,short,and random routing algorithms to design a new type of jointly optimized network energy saving rate and success rate.Routing algorithm.Experiments show that the three improved STF-based routing algorithms are superior to the original routing algorithms.At the same time,considering the overall energy saving rate and success rate,the STF-based greedy routing algorithm has the best performance among the six routing algorithms.