Font Size: a A A

Research And Design Of Ring Network Topology Based On CAN Model

Posted on:2021-05-11Degree:MasterType:Thesis
Country:ChinaCandidate:X J ZhangFull Text:PDF
GTID:2428330605954249Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
With the rapid development of emerging businesses such as Mobile Internet,Internet of things and Big data,the network of new data centers have become an important infrastructure for new business requirements.But there are still many problems in the performance of traditional data center networks,such as bandwidth throughput,power consumption,routing,resource utilization and so on.Based above this paper studies the performance of the data center network structure such as scalability and fault tolerance,and designs a new network topology with high scalability and high bandwidth throughput.According to the research status at home and abroad and the different performance requirements of data center,the main research contents are as follows:(1)For the problem that the data center network scalability is limited by the number of ports,this paper proposes a ring-shaped CAN-Circle network topology based on the direct interconnection of two-port servers.Firstly,a new type of ring network structure is designed,and the coding method and construction rules of CAN-Circle nodes are defined.In addition,the structure performance of the node is further theoretically analyzed and studied,mainly including the size,diameter and length of network nodes,the width of the bisection,etc.Finally,simulations were conducted to compare and analyze the performance of other structures.The results show that the ring network structure has good scalability and throughput.(2)According to the characteristics of the network structure and the coding method of the nodes,One-to-One path routing algorithm,One-to-Many path routing algorithm and One-to-All path routing algorithm are designed.The One-to-One path routing algorithm finds a path through the common prefix of source server node and destination server node,and the Multicast and Broadcast routing algorithm finds the routing path between source node and destination node by generating a multicast tree.Each routing algorithm takes account of node hop and node load conditions,which can significantly improve network utilization,stability and throughput.(3)The performance advantages of the CAN-Circle network structure are verified by experimental simulation.By comparing with other network structures,it verified the shortcoming advantages of the structure's average path length and network diameter.Especially under the common transmission communication mode of many-to-many data center networks,when there is a relationship between the number of layers of the CAN-Circle network structure and throughput,finally,the aggregation bottleneck of the algorithm is verified to have high throughput,fast convergence and low network delay.
Keywords/Search Tags:Data Center Network, Scalability, Throughput, Routing Algorithm, Average Path Length
PDF Full Text Request
Related items