Font Size: a A A

Research On Energy Saving Routing Algorithm And Deadlock Free Routing Algorithm In Data Center Networks

Posted on:2019-12-11Degree:MasterType:Thesis
Country:ChinaCandidate:L J ChenFull Text:PDF
GTID:2428330566497537Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
To meet the growing demand for online activities,data centers are becoming larger and larger,and many large-scale data centers are installed in specially constructed huge buildings with hundreds of thousands of servers deployed.Data centers with large numbers of devices have become one of the biggest consumers of energy.This paper studies the energy-saving problem of data center network from the point of view of routing.Due to the size of today's data center networks and the burst traffic patterns of many data center applications,packet loss may occur any time due to the network failure.The data center solves the problem of packet loss by applying data center bridging technology,but it also introduces the routing deadlock failure.Many researchers have carried out researches on deadlock-free routing algorithms.This paper will study the deadlock-free routing algorithm.In the first part of this paper,we study the energy-saving problem of data center network from the routing point of view,and propose an energy-saving routing algorithm.In the initial stage of the system,we build the data center network topology.Then we take the node failure probability as main parameter to calculate the importance of nodes.To reduce the failure probability of routing,we rank the nodes according to their importance and obtain the sorted matrix.Then,we turn off the unimportant nodes based on sorted matrix,and only retain important nodes for routing.We aim to shut down most of the network devices to save most of the energy for data center networks.The simulation results show that the energy-saving routing algorithm proposed in this paper has higher energy saving.In the second part of this paper,we study the routing deadlock problem in data center network by limiting the routing loop while finding a shorter routing path.We propose an effective deadlock-free routing algorithm.We first analyzed the characteristics of the data center network topology.To limit routing loop and minimize length of routing path,we then design a deadlock-free routing algorithm to get lower average network latency and higher network throughput.The proposed routing algorithm uses the data center bridging function to divide the physical layer into multiple virtual layers,which not only increases the diversity of routing paths,but also improves the fault tolerance of routing algorithms.The simulation results show that the algorithm designed in this paper has better network performance while guaranteeing deadlock-free.
Keywords/Search Tags:data center network, routing algorithm, energy-saving, deadlock-free
PDF Full Text Request
Related items