Availability model based on network calculus for data flow processing system
- Authors: Promyslov V.G.1
-
Affiliations:
- V.A. Trapeznikov Institute of Control Sciences of RAS
- Issue: No 110 (2024)
- Pages: 113-148
- Section: Control systems analysis and design
- URL: https://journals.rcsi.science/1819-2440/article/view/285150
- DOI: https://doi.org/10.25728/ubs.2024.110.5
- ID: 285150
Cite item
Full Text
Abstract
The work examines the problem of assessing accessibility in digital computing systems focused on flow data processing, Availability is considered in the context of the confidentiality, integrity, availability (CIA) model of information security, Availability is characterized by the fact that it is a “point” assessment of the time characteristics of a system, its function or element, To assess availability, a three-level reference model is proposed, associated with different representations of the system at the architectural and functional levels, The formulation of the model is considered within the framework of the network calculus theory (NC), which makes it possible to apply this model to calculate the accessibility of digital computing systems in practice, To test the model, the work analyzes the availability of the system on a mock-up of a digital computing system with competitive processing of streaming data on the server, The possibility of calculating system parameters for various disciplines of processing competing threads on the server is shown.
Keywords
About the authors
Vitaly Georgievich Promyslov
V.A. Trapeznikov Institute of Control Sciences of RAS
Email: vp@ipu.ru
Moscow
References
- БАЙБУЛАТОВ А.А., ПРОМЫСЛОВ В.Г. Аппроксимация огибаю-щей в приложениях «Network calculus» // Проблемы управления. – 2016. – №6. – C. 59–64.
- БАЙБУЛАТОВ А.А., ПРОМЫСЛОВ В.Г. О свойстве доступности и его метрике для АСУ ТП АЭС // Труды 15-й Международной конференции «Управление развитием крупномасштабных систем» (MLSD’2022). – М.: ИПУ РАН, 2022. – Т. 3. – С. 1020–1024.
- БАХАРЕВА Н.Ф., ТАРАСОВ В.Н. Аппроксимативные методы и модели массового обслуживания, Исследование компьютерных сетей. – Самара: Изд-во СНЦ РАН, 2017. – 328 с.
- ВИШНЕВСКИЙ В.М. Теоретические основы проектирования компьютерных сетей. – М.: Техносфера, 2003. – 512с.
- ВИШНЕВСКИЙ В.М., ГОРБУНОВА А.В. Применение методов машинного обучения к решению задач теории массового обслу-живания // ИТиВС. – 2021. – №4. – C.70–82.
- ГОСТ Р 51901,12-2007 (МЭК 60812:2006) Метод анализа видов и последствий отказов.
- ГОСТ Р ИСО /МЭК 15408-1-2008 Методы и средства обеспечения безопасности. Критерии оценки безопасности информационных технологий. Часть 1. Введение и общая модель.
- ГОСТ Р 27,002-2009 Национальный стандарт Российской Феде-рации. Надежность в технике. Термины и определения.
- ГОСТ Р 56205-2014 IEC/TS 62443-1-1:2009 Защищенность (ки-бербезопасность) сети и системы. Часть 1-1. Терминология, кон-цептуальные положения и модели.
- КАЛАШНИКОВ А.О., АНИКИНА Е.В. Управление информацион-ными рисками сложной сети на основе метода стохастического имитационного моделирования (часть 1) // Информация и без-опасность. – 2019. – Т. 22, Вып. 1. – С. 6–13.
- КУЗНЕЦОВ Н.А., КУЛЬБА В.В., КОВАЛЕВСКИЙ С.С. и др. Ме-тоды анализа и синтеза модульных информационно-управляющих систем. – М.: Физматлит, 2002. – 800 с.
- Программы для эмуляции сервера и задающего генератора пото-ка на языке C. – URL: https://www.dropbox.com/scl/fo/txbbdux1nr89c6unr9yi7/h?rlkey=h6hc6y36a1h6r9ex0kwf8iejn&dl=0 (дата об-ращения: 12.01.2024).
- ПРОМЫСЛОВ В.Г., СЕМЕНКОВ К.В., ЖАРКО Е.Ф. Оценка соб-ственной характеристики киберфизической системы методом сетевых исчислений // Управление большими системами. – 2023. – Вып. 105. – C. 6–29.
- ADAM G. Real-Time Performance and Response Latency Measure-ments of Linux Kernels on Single-Board Computers // Computers. – 2021. – Vol. 10(64). – doi: 10.3390/computers10050064.
- BAYBULATOV A.A., PROMYSLOV V.G. Industrial Control System Availability Assessment with a Metric Based on Delay and Dependen-cy // IFAC-PapersOnLine. – Elsevier, Amsterdam, 2021. – Vol. 54, Iss. 13. – P. 472–476.
- BAYBULATOV A.A., PROMYSLOV V.G. A Metric for the IACS Availability Risk Assessment // Proc. of the Int. Russian Automation Conf. (RusAutoCon), Sochi: IEEE, 2022. – P. 750–754. – URL: https://ieeexplore,ieee,org/document/9896250.
- BECK M., SCHMITT J. The disco stochastic network calculator ver-sion 1.0: When waiting comes to an end // Proc. Valuetools. – 2013. – P. 282–285.
- BONDORF S., SCHMITT J. The DiscoDNC v2 – A Comprehensive Tool for Deterministic Network Calculus // EAI Endorsed Trans. on Internet of Things. – 2014. – Vol. 1. – doi: 10.4108/icst.valuetools.2014.258167.
- CHAKRABORTY S., SIMON K., THIELE L. A general framework for analysing system properties in platform-based embedded system de-signs // Proc. of the Conf. on Design, Automation and Test in Europe – Vol. 1, DATE’03. – Washington, DC, USA, IEEE Computer Society, 2003. – P. 10190–10195
- CHANG C.-S. Stability, queue length and delay, ii, stochastic queue-ing networks // Proc. IEEE CDC. – 1992. – Vol. 1. – P. 1005–1010.
- CHEN Q., ABERCROMBIE R. SHELDON F. Risk Assessment For Industrial Control Systems Quantifying Availability Using Mean Failure Cost (MFC) // Journal of Artificial Intelligence and Soft Com-puting Research. – 2015. – Vol. 5. – P. 205-220. – doi: 10.1515/jaiscr-2015-0029.
- CRUZ R.L. A Calculus for Network Delay, Part I: Network Elements in Isolation // IEEE Trans. on Information Theory. – Jan. 1991. –Vol. 37. – Р. 114–131.
- CRUZ R.L. A Calculus for Network Delay, Part II: Network Analysis Information Theory // IEEE Trans. on Information Theory. – Jan. 1991. – Vol. 37. – P. 132–141.
- FIDLER М., SCHMITT J. On the way to a distributed systems calcu-lus: An end-to-end network calculus with data scaling // Proc. of the Joint Int. Conf. on Measurement and Modeling of Computer Systems. – P. 287–298. – DOI: https://doi.org/10.1145/1140277.
- ISO/IEC/IEEE 9945:2009 Information technology Portable Operating System Interface (POSIX®) Base Specifications. – Iss. 7.
- JACOBS N., HOSSAIN-MCKENZIE S., SUMMERS A. Modeling Data Flows with Network Calculus in Cyber-Physical Systems: Enabling Feature Analysis for Anomaly Detection Applications // Information. – 2021. – Vol. 12. – P. 255. – DOI: https://doi.org/10.3390/info12060255.
- JIANG Y., LIU Y. Stochastic Network Calculus. – Springer, 2008.
- JONSSON B., PERATHONER S., THIELE L. et al. Cyclic dependen-cies in modular performance analysis // Proc. of the 8th ACM Int. Conf. on Embedded software, EMSOFT’08, New York, NY, USA, 2008, ACM. – P. 179–188.
- KUROSE J. On computing per-session performance bounds in high-speed multi-hop computer networks // Proc. of ACM SIGMETRICS. – 1992. – P. 128–139.
- FLUCHS S., TAŞTAN E., TRUMPF T. et al. Traceable Security-by-Design Decisions for Cyber-Physical Systems (CPSs) by Means of Function-Based Diagrams and Security Libraries // Sensors. – 2023. – Vol. 23. – P. 5547. – DOI: https://doi.org/10.3390/s2312554.
- GEISMANN J., BODDEN E. A systematic literature review of model-driven security engineering for cyber–physical systems // Journal of Systems and Software. – 2020. – Vol. 169. – P. 110697. – DOI: https://doi.org/10.1016/j.jss.2020.110697.
- LE BOUDEC J.-Y., THIRAN P. Network Calculus: A Theory of Deter-ministic Queuing Systems for the Internet. Online Version of the Book Springer Verlag, – LNCS 2050. Version April 26, 2012. – 263 p.
- LUIGI A., GIUSEPPE B., D'ACQUISTO G. Service curve estimation by measurement: an input output analysis of a softswitch model // Proc. of the Third Int. Conf. on Quality of Service in Multiservice IP Net-works (QoS-IP'05), 2005. – Springer-Verlag, Berlin, Heidelberg. – P. 49–60. – DOI: https://doi.org/10.1007/978-3-540-30573-6_4.
- NetworkCalculus,org DNC (NCorg DNC). – URL: https://github.com/NetCal/DNC (дата обращения: 12.12.2023).
- https://www.cl.cam.ac.uk/teaching/1011/R01/75-protection.pdf (да-та обращения: 30.03.2024).
- SCHMITT J.B., ZDARSKY F.A., MARTINOVIC I. Improving Perfor-mance Bounds in Feed-Forward Networks by Paying Multiplexing Only Once // GI/ITG MMB, 2008.
- SIMON I. Recognizable sets with multiplicities in the tropical semir-ing // Mathematical Foundations of Computer Science. Lecture Notes in Computer Science. – 1988. –Vol. 324. – P. 107–120.
- SCHEFFLER A., BONDORF S., SCHMITT J. Analyzing FIFO-Multiplexing Tandems with Network Calculus and a Tailored Grid Search // The 34th Int. Teletraffic Congress (ITC-2022), 2022.
Supplementary files


