DOI: 10.17586/2226-1494-2019-19-6-1064-1071


SIMULATION MODEL OF REDUNDANT MACHINE-TO-MACHINE EXCHANGE WITH ORGANIZATION OF QUEUES FOR ACCESS TO AGGREGATED CHANNELS

V. A. Bogatyrev, I. A. Slastikhin, D. D. Zhdanov, A. A. Smolin


Read the full article  ';
Article in Russian

For citation:
Bogatyrev V.A., Slastikhin I.A., Zhdanov D.D., Smolin A.A. Simulation model of redundant machine-to-machine exchange with organization of queues for access to aggregated channels. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2019, vol. 19, no. 6, pp. 1064–1071 (in Russian). doi: 10.17586/2226-1494-2019-19-6-1064-1071


Abstract
Subject of Research. The paper presents the study of computer systems in providing exchanges through redundant channels in order to analyze the possibilities of reliability increase and timeliness of computer systems interaction as a result of redundant transfers through aggregated channels, taking into account the implementation options in computer nodes of distributed separate queues for access to each channel, or general queue for access to all channels. Method. The method is based on the development of simulation models of the considered options for redundant exchange through aggregated channels. Main Results. The redundant exchange efficiency is shown taking into account the organization of distributed queues in the nodes for access to aggregated channels. For the first option of redundant exchange, separate queues are organized at each computer node for access to each channel. The incoming request is copied k times (depending on the criticality to the timeout), and each copy is placed in one of the queues. For the second option, one common queue is organized for all channels in each computer node, and each incoming packet is entered in this queue (a request for its transmission). When a request is issued from the general queue, k copies of the transmitted packet are generated, and each copy is transmitted through one of the n channels as far as the node is granted access rights to it. A specific feature of the reserved service is the formation of k copies for each request, issued for service in different channels. A service is considered to be successfully completed if at least one of the k created copies of the request (package) is correctly executed in the specified time. The existence of the optimal reservation multiplicity of transmitted copies of packets is shown; the efficiency area of the reserved machine-to-machine exchange is determined. Practical Relevance. The results can be used in the design of highly reliable computer systems, including real-time ones.

Keywords: reliability, timeliness, queue, transmission reservation, aggregated channels, criticality to timeout, redundancy rate, area efficiency, simulation

References
  1. Kopetz H. Real-time systems: Design principles for distributed embedded applications. Springer, 2011, 396 p. doi: 10.1007/978-1-4419-8237-7
  2. Sorin D.J. Fault tolerant computer architecture. Morgan & Claypool, 2009, 103 p. doi: 10.2200/S00192ED1V01Y200904CAC005
  3. Shooman M.L. Reliability of computer systems and networks: Fault tolerance, analysis, and design. John Wiley & Sons, 2002, 527 p. doi: 10.1002/047122460X
  4. Utkin L.V., Coolen F.P.A. A Robust weighted SVR-based software reliability growth model. Reliability Engineering & System Safety, 2018, vol. 176, pp. 93–101. doi: 10.1016/j.ress.2018.04.007
  5. PolovkoA.M., GurovS.V. Fundamentaltheoryofreliability.St. Petersburg, BHV Publ., 2006, 702 p.(inRussian)
  6. ShubinskiiI.B. Reliablefault-tolerantinformationsystems.Synthesis methods. Ul'yanovsk, Pechatnyj dvor, 2016, 544 p.(inRussian)
  7. Zhmylev S., Martynchuk I., Kireev V., Aliev T. Analytical methods of nonstationary processes modeling. CEUR Workshop Proceedings, 2019, vol. 2344.
  8. Aliev T.I. The synthesis of service discipline in systems with limits. Communications in Computer and Information Science, 2016, vol. 601, pp. 151–156. doi: 10.1007/978-3-319-30843-2_16
  9. Tatarnikova T.M., Elizarov M.A. Virtual channel simulation model. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2016, vol. 16, no. 6, pp. 1120–1127. (in Russian). doi: 10.17586/2226-1494-2016-16-6-1120-1127
  10. Kutuzov O.I., Tatarnikova T.M. Evaluation and comparison of queues in classical and fractal queuing systems. Information and Control Systems, 2016, no. 2, pp. 48–55. (in Russian). doi: 10.15217/issn1684-8853.2016.2.48
  11. Kutuzov O.I., Tatarnikova T.M. On the simulation paradigm analysis. Technical Journal of Information Technologies, Mechanics and Optics, 2017, vol. 17, no. 3, pp. 552–558. (in Russian). doi: 10.17586/2226-1494-2017-17-3-552-558
  12. Bogatyrev V.A. An optimum backup execution for the heterogeneous server system.InstrumentsandSystems: Monitoring, Control, andDiagnostics, 2007, no. 12, pp. 30–36. (inRussian)
  13. Bogatyrev V.A. The combinatorial stochastic method of reliability evaluation and fault tolerance for networks with cluster architecture. Instruments and Systems: Monitoring, Control, and Diagnostics, 2006, no. 6, pp. 21–26. (in Russian)
  14. Bogatyrev V.A., Bogatyrev S.V.Association reservation servers in clasters highly reliable computersystem. Information technologies, 2009,no. 6. pp. 41–47.(in Russian)
  15. Gunnar A., Johansson M. Robust load balancing under traffic uncertainty-tractable models and efficient algorithms. Telecommunication Systems, 2011, vol. 48, no. 1-2, pp. 93–107. doi: 10.1007/s11235-010-9336-9
  16. Banner R., Orda A. Multipath routing algorithms for congestion minimization, CCIT Report No. 429. Department of electrical engineering, technion, Haifa, Israel, 2004. Available at: http://www.ee.technion.ac.il/people/ron/Congestion.pdf. (accessed: 27.09.2019).
  17. Kabatiansky G., Krouk E., Semenov S. Error Correcting Coding and Security for Data Networks. Analysis of the Superchannel Concоept. Wiley, 2005, 288 р. doi: 10.1002/0470867574
  18. Krouk E., Semenov S. Application of coding at the network transport level to decrease the message delay. Proc. 3rd Intern. Symp. on Communication Systems Networks and Digital Signal Processing. Staffordshire University, UK, 2002, pp. 109–112.
  19. Kleinrock L. Queueing systems: Volume I. – Theory. New York, Wiley Interscience, 1975, 417 p.
  20. Kleinrock L. Queueing systems: Volume II – Computer applications. New York, Wiley Interscience, 1976, 576 p.
  21. Dudin A.N., Sun’ B. A multiserver MAP/PH/N system with controlled broadcasting by unreliable servers. Automatic Control and Computer Sciences. 2009, no. 5, pp. 247–256. doi: 10.3103/S0146411609050046
  22. Dudin A.N., Sung V. Unreliable multi-server system with controllable broadcasting service. Automation and Remote Control, 2009, vol. 70, no. 12, pp. 2073–2084. doi: 10.1134/S0005117909120145
  23. Lee M.H., Dudin A.N., Klimenok V.I. The SM/M/N queueing system with broadcasting service. Mathematical Problems in Engineering, 2006, vol. 2006, pp. 98171. doi: 10.1155/MPE/2006/98171
  24. Bogatyrev V.A., Bogatyrev S.V. Redundant service clusters with the destruction of irrelevant queries. Vestnik komp'iuternykh i informatsionnykh tekhnologii, 2017, no. 1(151), pp. 21–28. (in Russian). doi: 10.14489/vkit.2017.01.pp.021-028
  25. Bogatyrev V.A., Bogatyrev A.V. The Model of redundant service requests real-time in a computer cluster. Information technologies, 2016, vol. 22, no. 5, pp. 348–355. (in Russian)


Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Copyright 2001-2019 ©
Scientific and Technical Journal
of Information Technologies, Mechanics and Optics.
All rights reserved.

Яндекс.Метрика