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

In this paper, we consider the classification and applications of switching methods, their advantages and disadvantages. A model of a computing grid 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 were investigated under a working load with different intensities. The influence of malicious traffic such as traffic duel was estimated on the quality of service parameters of the grid. A comparative analysis of the computing grids stability was carried out with nodes which implement the store-and-forward and cut-through switching technologies. It is shown that the grids performance is approximately the same under work load conditions, and under peak load conditions the grid with the node implementing the store-and-forward technology is more stable. The grid with nodes implementing SAF technology comes to a complete deadlock through an additional load which is less than 10 percent. After a detailed study, it is shown that the traffic duel configuration does not affect the grid with cut-through nodes if the workload is increases to the peak load, at which the grid comes to a complete deadlock. The execution intensity of guns which generate a malicious traffic is determined by a random function with the Poisson distribution. The modeling system CPN Tools is used for constructing models and measuring parameters. Grid performance and average package delivery time are estimated in the grid on various load options.

1. Preve N.P., Grid Computing: Towards a Global Interconnected Infrastructure, Springer, 2011, 312 pp.

2. Zaitsev D.A., Shmeleva T.R., Guliaiev K.D., Report on scientific-research work ”Development of New World-wide Networks Addressing Systems”, state registration number 0108U008900, ONAT, Odessa, 2009, 124 pp., (in Ukrainian).

3. Liberzon D., Switching in Systems and Control, Birkhauser, Boston, 2003, 230 pp.

4. Sakun A.L., Zaitsev D.A., “An Evaluation of MPLS Efficacy using Colored Petri Net Models”, Proceedings of International Middle Eastern Multiconference on Simulation and Modelling (MESM’2008), Amman (Jordan), August 26–28, 2008, 31–36.

5. Shmeleva T.R., Zaitsev D.A., “Switched Ethernet Response Time Evaluation via Colored Petri Net Model”, Proccedings of International Middle Eastern Multiconference on Simulation and Modelling, August 28–30, 2006, Alexandria (Egypt), 68–77.

6. Zaitsev D.A., Shmeleva T.R., “Parametric Petri Net Model for Ethernet Performance and Qos Evaluation”, Proceedings of 16th Workshop on Algorithms and Tools for Petri Nets, September 25–26, 2009, University of Karlsruhe, Germany, 15–28.

7. Zaitsev D.A., Shmeleva T.R., Retschitzegger W. and Proll B., “Blocking Communication Grid via Ill-Intentioned Traffic”, 14th Middle Eastern Simulation and Modelling Multiconference, February 3–5, 2014, Muscat, Oman, 63–71.

8. Jensen K., Kristensen L.M., Coloured Petri Nets: Modelling and Validation of Concurrent Systems, Springer, 2009, 384 pp.

9. Retschitzegger W., Proll B., Zaitsev D.A., Shmeleva T.R., “Security of grid structures under disguised traffic attacks”, Cluster Computing, 19:3 (2016), 1183–1200.

10. Shmeleva T.R., “Security of Grid Structures with Cut-through Switching Nodes”, System Informatics, 2017, №10, 23–32.