Research On Routing Methods Of Data Center Networks With Regular Topologies

With the continuous development and widespread application of cloud computing technologies,the size of data center networks has been expanding.The expansion of network scale has brought many challenges to data center network.To dispose of the issue,researchers have proposed a variety of new network architectures to meet these challenges,and proposed corresponding routing algorithms for these new topologies.Because these routing algorithms are all aimed at specific topologies,they have poor universality and are difficult to be widely used in complex heterogeneous data center networks.In addition,multi-tenancy technology is also one of the hot topics in the data center network routing technology.Currently,there are many problems in multi-tenancy technology such as how to break the subnet limits,how to separate the IP address of the virtual machine from the subnet location,and how to implement the virtual machine migration.For the above problems,this paper presents a topological description language(TDL)which is suitable for describing various network structures.We can describe node attributes,naming rules,addressing rules,connection relationships and location relationships in a regular network with TDL.The language can reflect the regularity of the network topology and create a topology description file TDF for computer analysis and processing.This paper presents a generic routing method for data center networks based on a regular topology.The algorithm uses TDF as an input and quickly calculates routes using the regularity of the topology of the data center network topology.When calculating a specific routing path,the routing algorithm does not need to learn the entire network topology,and therefore has higher routing efficiency.In addition,based on the above routing algorithm,this paper proposes a new multi-tenancy solution for data center networks.The solution uses a consistent hash algorithm and a distributed circular hash table technology to store the information of virtual machines in location resolvers.The solution supports isolation of tenants,the communication between the virtual machines within a same tenant and the migration of virtual machines.This solution does not depend on specific routing methods,not require extra servers and is transparent to virtual machines,so it takes low cost and has good robustness.In this paper,Fat-tree topology is taken as an example to introduce the design process of routing algorithm in detail.In order to verify the feasibility of TDL routing method,we use the network simulation software OPNET as experimental platform to simulate the experiment and verify the algorithm according to the experimental results.