Hanna Drieieva, Yelyzaveta V. Meleshko, Oleksandr Drieiev, Volodymyr Mikhav
{"title":"COMPUTER SIMULATION MODEL OF A COMPUTER NETWORK WITH FRACTAL TRAFFIC FOR TESTING ROUTING ALGORITHMS","authors":"Hanna Drieieva, Yelyzaveta V. Meleshko, Oleksandr Drieiev, Volodymyr Mikhav","doi":"10.20998/2522-9052.2022.4.02","DOIUrl":"https://doi.org/10.20998/2522-9052.2022.4.02","url":null,"abstract":"\u0000 \u0000 \u0000The object of research in this article is simulation modeling of a computer network and the process of traffic routing. The relevance of the research is due to the importance of ensuring the quality of service in computer networks, in particular, by necessity reducing the number of lost IP-packets at high traffic intensity values. Determining the routing of traffic packets is a complex process and is based on various indicators or combinations of indicators. If the routing process takes place in a dynamic mode, then the complexity of the route calculation increases, in this case, one of the tools for research and comparison of different routing algorithms can be a computer simulation model of a computer network. The goal of the work is the development and research of a computer simulation model of a computer network for testing traffic routing algorithms. The tasks: to develop computer simulation model of a computer network to generate the network structure and simulate the traffic distribution process with the ability to test different routing algorithms. Research methods: theory of computer networks, theory of fractal analysis, object-oriented programming, theory of algorithms and data structures, theory of complex networks, theory of Markov processes. Conclusions. The paper investigated the basic principles of traffic routing in computer networks. A simulation model of a computer network for testing traffic routing algorithms has been developed. A method based on the theory of complex networks has been developed to generate the structure of a computer network. Theory of fractal analysis and Markov processes are used for traffic generation. A series of experiments was conducted on a developed model to determine how different fractal dimensions of traffic at high traffic intensity values affect the number of lost packets, and therefore the quality of service. Analyzing the results of the experiment, the following conclusions can be drawn: the least number of lost packets occurs when the process is random or has weak trends. The fewest lost packets were at fractal dimension 1.5, i.e., when the process is completely random, there were also few lost packets at fractal dimensions close to this; persistent and anti-persistent processes (those with memory) cause more packet loss for the same traffic intensity and maximum number of packets sent from one device per unit of time. Moreover, anti-persistent processes cause significantly more losses than persistent ones. Thus, when performing traffic routing and finding optimal paths for sending IP-packets, it can be useful to determine and take into account the fractal dimension of traffic at the entrance of each router and use it when calculating metrics to determine the best routes. \u0000 \u0000 \u0000","PeriodicalId":34701,"journal":{"name":"Suchasni informatsiini sistemi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44286391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
V. Krasnobayev, Serhii Koshman, S. Nikolsky, D. Kovalchuk
{"title":"MATHEMATICAL MODEL OF COMPUTER SYSTEM RELIABILITY IN RESIDUAL CLASSES","authors":"V. Krasnobayev, Serhii Koshman, S. Nikolsky, D. Kovalchuk","doi":"10.20998/2522-9052.2022.4.03","DOIUrl":"https://doi.org/10.20998/2522-9052.2022.4.03","url":null,"abstract":"The subject of the article is the construction of a mathematical model of the reliability of a computer system (CS) that operates in a system of residual classes (RNS). This mathematical model is based on the use of structural sliding reservation. The purpose of the article is to increase the reliability of the CS, which operates in the system of residual classes, as well as to calculate and compare the reliability, in terms of the probability of failure-free operation, of the CS in the RNS and the ternary computing system, which operates in the positional binary number system (PBNS). Tasks: to analyze the influence of the number system used on the reliability of the CS; to investigate the properties of the RNS and determine their influence on the structure of the CS in the RNS; build a mathematical model of reliability and, on its basis, perform the calculation and comparative analysis of the reliability of the CS in the RNS and the tripled CS in the PBNS. Research methods: methods of analysis and synthesis of computer systems, number theory, coding theory in RNS, reliability theory. The following results are obtained. The paper shows that the provision of a given level of reliability in the design of the CS using the RNS is due to the presence of various types of redundancy at the same time: structural, informational, temporal, functional and load. In RNS, these types of redundancy can be effectively used to improve the reliability of the CS. The CS in the RNS represents a computational structure that is identical in structure and principle of operation to the sliding structural redundancy model in the PBNS in the case of a loaded (hot) mode of operation of the redundant elements. Proceeding from this, the paper presents a mathematical model of the reliability of the CS in the RNS. In this paper, the calculation and comparative analysis of the reliability of a tripled computing structure in a PBNS with an ideal majority element and a CS in an RNS with an ideal reliability automaton are carried out. Conclusions. As shown by the results of calculations and comparative analysis in some time intervals of operation, the probability of non-failure operation of the CS in the RNS is higher than the probability of non-failure operation of the aircraft in the PBNS with a tripled majority structure. This implies the effective use of the RNS to improve the reliability of the CS.","PeriodicalId":34701,"journal":{"name":"Suchasni informatsiini sistemi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46530682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Gadetska, V. Dubnitskiy, A. Khodyrev, I. Shkodina
{"title":"Excel-oriented calculator for financial flows stability diagnostics under batch data processing by chebyshev polynomials","authors":"S. Gadetska, V. Dubnitskiy, A. Khodyrev, I. Shkodina","doi":"10.20998/2522-9052.2022.4.05","DOIUrl":"https://doi.org/10.20998/2522-9052.2022.4.05","url":null,"abstract":"Purpose of work. Development of algorithms and software support of EXCEL-oriented methods for arraying of regression equations, using Chebyshev polynomials. Results. The work shows how aggravating geopolitical instability and effect of other pressure factors on the condition of economic systems in numerous countries leads to severe vulnerability of their financial systems. The result is slowing down of world economic growth, accelerated inflation pressure and business uncertainty. Under these circumstances the diagnostics of changes in directions, amounts, rates, regularity of business financial flows becomes quite important. Temporal variation of financial system influential parameters may be presented in the form of regression polynomials. In the present work Chebyshev polynomials were applied for their determination. This method was implemented in software products whose usage is limited by licensing restrictions. Therefore, the development of EXCEL-oriented software product applicable to formulation of regression equations using Chebyshev polynomials may be considered an urgent task. The work specifies calculation algorithms for Chebyshev regression polynomials up to fifth power inclusive, as well as transcribes block diagrams of their implementing algorithms. The determination of data packet, its index and data flows are also described. In order to compare the quality of Chebyshev polynomials in different powers a concept was introduced of relative error chain decilog. The work assumes that any discrepancy between indices of two adjacent flows means violation of process stability. The moment of stability violation corresponds to the highest number in pair of packets. Algorithm block diagram and numerical application example of our proposed method are shown.","PeriodicalId":34701,"journal":{"name":"Suchasni informatsiini sistemi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42012648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DIAGNOSIS METHODS FOR MECHANISMS AND MACHINES BASED ON EMPIRICAL MODE DECOMPOSITION OF A VIBROSIGNAL AND THE WILCOXON TEST","authors":"Andrey Zuev, A. Ivashko, D. Lunin","doi":"10.20998/2522-9052.2022.4.07","DOIUrl":"https://doi.org/10.20998/2522-9052.2022.4.07","url":null,"abstract":"Methods for diagnosing mechanisms and machines based on the analysis of vibration signals are considered. In particular, the comparison of various algorithms for analyzing vibration signals in the time and frequency domains was made, methods for selecting diagnostic features and methods for secondary processing were analyzed. The purpose of the study is to develop algorithms for selecting the vibration signal envelope based on empirical mode decomposition and decomposition of the signal into intrinsic mode functions, algorithms for the spectral estimation of envelopes and to choose a criterion for making a decision on object classification. It is proposed to choose the non-parametric Wilcoxon signed-rank test to determine the statistical significance of the difference between the parameters of normal and faulty objects. The multichannel microcontroller system for collecting data from an accelerometer and transmitting it to a computer via a local Wi-Fi network, including a number of independent data gathering nodes connected to a common distributed computing system, has been developed and experimentally studied. The computer processing of the recorded vibration signals for serviceable and faulty mechanisms was performed, including data decoding, Hilbert-Huang transform, spectral analysis using the Welch and Yule-Walker methods, and the choice of a diagnostic feature that provides maximum reliability of recognition. Based on the results of the work, it was determined that the empirical mode decomposition makes it possible to obtain vibration signal envelopes suitable for further diagnostics. Recommendations are developed for choosing the intrinsic mode function and the spectral analysis algorithm, it is determined that the first intrinsic mode function is the most informative for the mechanism under study. In accordance with the Wilcoxon criterion, the degree of diagnostic reliability was numerically determined in the analysis of the spectral power density of the vibration signal and the amplitude of peaks, and the comparison of probabilities of error-free recognition for various modifications of the algorithm was made.","PeriodicalId":34701,"journal":{"name":"Suchasni informatsiini sistemi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48258735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mathematical model of the passage of audio signals in network-based audio analytics systems","authors":"A. Poroshenko","doi":"10.20998/2522-9052.2022.4.04","DOIUrl":"https://doi.org/10.20998/2522-9052.2022.4.04","url":null,"abstract":"Relevance. Nowadays, more and more audio and video analytics systems work together. But in many cases, it is necessary to quickly transfer the audio stream. Therefore, the task of reducing delays in transmission of audio streams in network-based audio analytics systems becomes relevant. The object of research is the process of audio signal transmission. The subject of research is mathematical models of audio and video streams in network systems. The purpose of this paper is to develop a mathematical model for the passage of audio signals in network-based audio analytics systems. Research results. The statement of the problem of optimizing the network of connecting lines according to the criterion of minimum capital costs is proposed. Optimization equations for a unidirectional three-node basic structure are compiled based on the problem of minimizing capital costs. Optimization equations are obtained for a bidirectional three-node basic structure. Obtained optimization equations are generalized to any structure of a network of connecting lines. The direction of further research is the development of an approximate method for quickly solving optimization equations for a network of connecting lines and assessing the adequacy of the developed model.","PeriodicalId":34701,"journal":{"name":"Suchasni informatsiini sistemi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44221640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
O. Barabash, O. Bandurka, O. Svynchuk, Halyna Tverdenko
{"title":"METHOD OF IDENTIFICATION OF TREE SPECIES COMPOSITION OF FORESTS ON THE BASIS OF GEOGRAPHIC INFORMATION DATABASE","authors":"O. Barabash, O. Bandurka, O. Svynchuk, Halyna Tverdenko","doi":"10.20998/2522-9052.2022.4.01","DOIUrl":"https://doi.org/10.20998/2522-9052.2022.4.01","url":null,"abstract":"\u0000 \u0000 \u0000Monitoring of the forests with the help of remote sensing of the Earth systems is actual on the present stage of people development. Existing systems of research do not allow to use geographic information databases and don't include the spectrum of exploration that are presented in our work. The aim of this article is to develop the method of identification of tree species composition of forests on the basis of geographic information database in the integration with correlation analysis. It will give the possibility to find the most negative things that influence on the condition of forest ecosystems and neutralize them at the first stage of their influence. Satellite images that are received from the satellites Landsat 5 and 8 are used to make the database. Tree species composition of Mozhariv forest during 20 years is analyzed as an example in this article. Classification of tree species composition of forests using space images is made on the basis of Bayes classifier. There is a special geographic information database for further data processing and identification of tree species composition is developed. Forest is analyzed on the number of trees in each species during continuous time measures (in 2000, 2010 and 2020) in this article. Results of the work are presented with the help of graphics. Correlation analysis, which helps to make the analysis of tightness of connections between changes trees in number and different forest criteria, is made to identify tree species composition of forest. Developed method together with well-known methods of monitoring of forests help us to make effective application for analysis of tree species composition of forest changes and to make better existing information systems including different quality demands. Peculiarity of developed information system is in using of the data processing module as a part of geographic information system and implementing correlation analysis with identification of factors that influence each other. It helps to increase quality in management and monitoring of forest resources. Geographic information becomes available for users. \u0000 \u0000 \u0000","PeriodicalId":34701,"journal":{"name":"Suchasni informatsiini sistemi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42664325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ANALYSIS OF MARСOVIAN SYSTEMS WITH A GIVEN SET OF SELECTED STATES","authors":"L. Raskin, L. Sukhomlyn, R. Korsun","doi":"10.20998/2522-9052.2022.4.08","DOIUrl":"https://doi.org/10.20998/2522-9052.2022.4.08","url":null,"abstract":"Analysis of stationary Marcovian systems is traditionally performed using systems of linear Kolmogorov differential equations. Such systems make it possible to determine the probability of the analyzed system being in each of its possible states at an arbitrary time. This standard task becomes more complicated if the set of possible states of systems is heterogeneous and some special subset can be distinguished from it, in accordance with the specifics of the system functioning. Subject of the study is technology development for such systems analysis. In accordance with this, the purpose of the work is to find the distribution law of the random duration of such a system's stay on a set of possible states until it falls into a selected subset of these states. Method for solving the problem is proposed based on splitting the entire set of possible states of the system into two subsets. The first of them contains a selected subset of states, and the second contains all the other states of the system. Now a subset of states is allocated from the second subset, from which a direct transition to the states of the first subset is possible. Next, a system of differential equations describing the transitions between the formed subsets is formed. The solution of this system of equations gives the desired result – distribution of the random duration of the system's stay until the moment of the first hit in the selected subset of states. The method allows solving a large number of practical problems, for example, in the theory of complex systems reliability with many different failure states. In particular, finding the law of the uptime duration distribution, calculating the average duration of uptime.","PeriodicalId":34701,"journal":{"name":"Suchasni informatsiini sistemi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41463892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
L. Raskin, Yuriy Ivanchikhin, L. Sukhomlyn, Iaroslav Sviatkin, R. Korsun
{"title":"EVALUATION MODEL OF THE RECOVERY PROCESSES OF NON-MARKOVIAN SYSTEMS, CONSIDERING THE ELEMENTS UNRELIABILITY UNDER ARBITRARY DISTRIBUTION LAWS","authors":"L. Raskin, Yuriy Ivanchikhin, L. Sukhomlyn, Iaroslav Sviatkin, R. Korsun","doi":"10.20998/2522-9052.2022.3.04","DOIUrl":"https://doi.org/10.20998/2522-9052.2022.3.04","url":null,"abstract":"The subject of the study is the reliability of recoverable non–Markovian systems, functioning of which is described by arbitrary distribution laws. The purpose of the article is to develop a mathematical model of the functioning of modern computer systems under arbitrary laws of the distribution of stay duration in each of the states, taking into account the recovery system and the provision of spare elements. The main task is to develop an adequate model of the system functioning process, taking into account the non-Markovian character of the processes occurring in the system, its possible large dimension, and the presence of a hierarchical recovery system. Based on this model, a method for calculating the density of the system recovery time distribution has been developed. At the same time, a universal four-parameter distribution is proposed to describe random processes occurring in the system. Using this approximation, the calculation of the desired parameter of the recovery flow is performed by solving the Volterra integral equation with a difference kernel.","PeriodicalId":34701,"journal":{"name":"Suchasni informatsiini sistemi","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68225252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A vector method for finding sequences in big data","authors":"Hanna Khakhanova","doi":"10.20998/2522-9052.2022.3.02","DOIUrl":"https://doi.org/10.20998/2522-9052.2022.3.02","url":null,"abstract":"A technological software solution is proposed for metric search and identification of logical-temporal patterns of a business data flow by creating additional vector data structures and a parallel method for their processing. The subject of research is the methods of searching and identifying logical-temporal patterns in big data. The purpose of the study is to increase the efficiency of searching and recognizing logical-temporal patterns that semantically form business functionality in an 8-hour frame of screenshots with \"garbage\" data. Applied methods: apparatus of set theory and Boolean algebra, metric models for determining parameters for sets of binary vectors, elements of probability theory, theory of algorithms, software modeling. The results obtained: a method for searching and recognizing patterns based on a vector problem of character sequences that identify patterns in big data streams using unitary coding of information primitives and data; vector models are unitary-encoded data structures for describing a big data flow as Cartesian products of a set of primitive-string-markers and a discrete sequence of implementation of a given time frame. The practical significance of the work: the implementation of the vector method, which made it possible to create a pattern recognition program in a big data stream with a probability of 0.77%.","PeriodicalId":34701,"journal":{"name":"Suchasni informatsiini sistemi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48260672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
B. Tomashevsky, S. Yevseiev, S. Pohasii, S. Milevskyi
{"title":"MECHANISMS FOR ENSURING THE SECURITY OF CHANNELS OF A PROSPECTIVE MANAGEMENT SYSTEM","authors":"B. Tomashevsky, S. Yevseiev, S. Pohasii, S. Milevskyi","doi":"10.20998/2522-9052.2022.3.10","DOIUrl":"https://doi.org/10.20998/2522-9052.2022.3.10","url":null,"abstract":"The development of military (state) control systems in modern conditions of hybrid warfare requires the possibility of rapid expansion of both functionality and scaling of the physical and logical basis of management, increasing the range of digitization and use of both military and civilian communication channels to manage troops and weapons. Not only the computing power of the enemy, the means of suppressing and / or blocking the communication channels of the control system, but also the development of quantum technologies that place new and more stringent requirements on security mechanisms based on symmetric and asymmetric cryptography algorithms. According to NIST, a full-scale quantum computer breaks both symmetric and asymmetric cryptosystems in polynomial time, significantly reducing their resilience. The paper proposes mechanisms of post-quantum cryptography, which allow to ensure the stability of not only communication channels, but also elements of the structure of the control system. The basis of post-quantum encryption algorithms is the combination of algorithms (schemes) of crypto-code structures with cryptosystems on unprofitable codes (multi-channel cryptography), as well as the possibility of combining them with digital steganography methods. This approach provides the ability to hide elements of management commands, and the use of different channels provides the ability to hide individual elements of cryptograms.","PeriodicalId":34701,"journal":{"name":"Suchasni informatsiini sistemi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41863923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}