Speaker
Description
The work is devoted to the result of the creating a first module of the 1-st phase of the data processing center at the Joint Institute for nuclear research for modeling and processing experiments carried out on the test installations of the Large Hadron Collider. The issues related to handling the enormous data flow from the LHC experimental installations and troubles of distributed storages are considered. The article presents a hierarchical diagram of the network farm and a basic model of the network architecture levels. The project documentation of the network based on the Brocade equipment is considered. Protocols for disposal full mesh network topologies are considered. The newest modern data transfer protocol Transparent Interconnection of Lots of Links (TRILL) is presented. Its advantages are analyzed in comparison with the other possible protocols that may be used in the full-mesh topology, like a Spanning tree protocol. Empirical calculations of data routing based on a Dijkstra's algorithm and a patent formula of the TRILL protocol are given.
Two monitoring systems of the network segment and download of the data channels are described. The former is a typical packet software; the latter is a newly designed software with an application to graph drawing. The data are presented which were obtained experimentally from 40G interfaces through by each monitoring systems, their behavior is analyzed. The data accuracy in different systems is proved. The main result is that the discrepancy of experimental data with theoretical predictions to be equal to the weight balancing of the traffic when transmitting the batch information over the equivalent edges of the graph. It is shown that the distribution of the traffic over such routes is of arbitrary and inconsistent with the patent formula character.
The conclusion analyzes the issues of the traffic behavior under extreme conditions. There are two main questions to be answered. Which way does the distribution of batch data transfer over four equivalent routes occur? What happens if overload takes place? An assumption is made of the need to compare the traffic behavior in various data centers with the help of the traffic generators
