Data Center Network Structure Based On Cartesian Product Graph

With the rapid growth of Internet data volume and online services,the scale of data center networks continues to expand.Building a data center network with high performance,high scalability and cost-effectiveness is a hot research issue.At the same time,industrial experience points out that incremental scalability can enable data centers to obtain better cost and energy consumption advantages,that is,under the premise of not destroying the existing topology,the data center network can add a small number of servers according to actual needs.Therefore,building a data center network with incremental scalability is also a challenging research problem.The Cartesian product graph is a compound graph with high scalability.It is constructed from a basic graph and an extended graph.By using the Cartesian product graph,it is more flexible to construct a network structure of any scale.This thesis focuses on how to build a data center network structure with high performance,high scalability,high flexibility and good costeffectiveness.The main work and innovations of this thesis are as follows:1)Aiming at the problems of low flexibility,low scalability,and low economy of the data center network structure,a new type of data center network structure,namely FSDC,is proposed.Based on the Cartesian product graph of the ring graph,the FSDC is constructed using a commercial m-port switch and a 2-port server.FSDC can use different basic graphs to construct Cartesian product graphs of the same degree.Therefore,compared with other data center network structures,FSDC has better flexibility and scalability.In addition,this thesis analyzes the topological properties such as the diameter of the FSDC and the bisection bandwidth;based on the property of multiple paths between nodes in the Cartesian product graph,this thesis designs a fault-tolerant routing algorithm.Through comparative analysis and simulation experiments with other data center network structures,the results show that FSDC has good flexibility,scalability,and better cost and energy consumption advantages.2)Aiming at the demand for incremental expansion of real data centers and the locality of data center application exchanges,a new type of data center network structure,namely SDCCP,is proposed.SDCCP is also based on the Cartesian product graph,constructed using commercial m-port switches and 2-port servers.Unlike FSDC,the basic graph used by SDCCP is a complete graph,which can make better use of the locality of application communication in the data center to improve the overall network performance;for the SDCCP structure,this thesis designs a distributed fault-tolerant routing algorithm.This algorithm can run on any node of SDCCP,and by using multiple different paths between nodes to bypass failed devices or links,the traffic is evenly distributed among different links,saving data transmission time.In addition,in order to meet the incremental expansion requirements,this thesis proposes an incomplete SDCCP structure,which allows adding a part of devices to the network at a time,and proves that the adding process does not affect the property of the topology.Through comparison with other data center network structures and simulation experiments,the results show that SDCCP has achieved a better balance between network performance and cost.