Comparative Analysis of Stability to Induced Deadlocks for Computing Grids with Various Node Architectures

Аннотация

The classification and application of switching methods and their advantages and disadvantages are considered. A computing grid model was constructed in the form of a colored Petri net with a node, which implements cut-through packet switching. The model consists of packet switching nodes, traffic generators, and guns that form malicious traffic disguised as usual user traffic. The characteristics of the grid model are investigated under a workload with different intensities. The influence of malicious traffic such as “traffic duel” to the quality of service parameters of the grid is estimated. A comparative analysis of computing grid stability with nodes, which implement store-and-forward (SAF) and cut-through switching technologies, was conducted. It is shown that grid performance is approximately the same under workload, and under peak load the grid with a node implementing SAF packet transmission is more stable. The grid with nodes implementing SAF technology comes to a complete deadlock through an additional load, which is less than 10%. It is shown after detailed study that the traffic duel configuration does not affect the grid with cut-through nodes when increasing the workload up to peak load, at which the grid comes to a complete deadlock. The periodicity of execution of the guns, which generate malicious traffic, is determined by a random function with the Poisson distribution. The CPN Tools modeling system is used for constructing models and measuring characteristics. The grid performance and average packet delivery time are estimated under different variants of the grid load.