| As the foundation of cloud computing,research on data center networks has a direct impact on the development of cloud computing.Therefore,how to improve the performance of data center networks has become an urgent problem.Improving the performance of data center networks can not only start with improving server performance to promote the overall performance locally,but also consider the infrastructure of data center networks from the perspective of improving the overall communication performance of data center networks.By regarding the servers in the data center network as nodes and the connection relationships between servers as edges,a data center network can be abstracted as a graph G=(V(G),E(G)).Therefore,there is a one-to-one correspondence between the servers in a data center network and the vertices in its logic graph.The results on the logic graph can be applied to the data center network based on the one-to-one correspondence to improve the communication performance of the data center network.Conditional BC networks have the properties of high connectivity,low diameter and recursive constructability,and it contain hypercubes,crossed cubes,Mobius cubes,and locally twisted cubes.The line graph of conditional BC networks is constructed by treating its edges as a node,and the two adjacent edges in the conditional BC networks are two adjacent nodes in the line graph.So the connectivity of the line graph is nearly twice that of the conditional BC networks,and it still possesses many excellent properties of conditional BC networks.The logical graph of some new data center networks is precisely the line graph of conditional BC networks.For example the logical graph of the BCDC data center network being the line graph of the crosscube.The independent spanning trees on the line graph of conditional BC networks can be used to design some efficient communication algorithms for data center networks.And independent spanning trees play an important role in information reliable transmission,parallel transmission,secure distribution,and diagnosis of fault processors.The main research content is as follows:(1)This thesis investigates the algorithm for constructing a node independent spanning tree rooted at a specific type of node on the line graph of the cross cube.Based on the concept of removing the 2-dimension from increasing dimension circular permutation and a symmetrical connection scheme,this thesis proposes a construction algorithm for the node independent spanning tree of the line graph of crossed cubes rooted at a type of nodes and provides theoretical proofs on the correctness and time complexity of the algorithm.Finally,this thesis designs simulation experiments based on the algorithm to simulate data transmission on BCDC and verifies that the algorithm can improve the communication performance of BCDC.(2)This thesis investigates the construction algorithm of edge independent spanning trees rooted at any node on the line graph of conditional BC networks.This thesis improves the concept of removing 2-dimension from the increasing dimension circular permutation to removing an dimension from the increasing dimension circular permutation,and proposes an asymmetric connection scheme and the remaining node connecting scheme.Based on these schemes,this thesis proposes an algorithm to construct edge independent spanning trees rooted at any node on the line graph of the conditional BC networks.The correctness and time complexity of the algorithm are also proved.Finally,this thesis verify the algorithm through simulation experiments and use it to find multiple edge-disjoint paths on four special types of conditional BC networks.In addition,simulation experiments were conducted on the line graphs of conditional BC networks with faulty edges,comparing the transmission failure rate when use these edge disjoint paths and shortest paths for communication between two points respectively. |
