Application of HM-networks with positive and negative heterogeneous requests for finding memory volume in information systems

• Autorzy: Matalytski Mikhail , Zajac Pawel , Kopats Dmitry

Identyfikatory

DOI

10.17512/jamcm.2020.1.06

• Języki publikacji: EN

Abstrakty

EN

To determine the memory volume of information systems (IS), it was proposed to use a stochastic model, based on the use of a queueing network with bypasses, known as an HM-network. This model includes the servicing of heterogeneous requests along with their volumes, the ability to change the volume of such requests with their passage of time and the possibility of finding computer viruses in them, and therefore servicing requests can be interrupted at some random time. The expressions were obtained for the expected total values of the volume of requests in IS nodes.

Słowa kluczowe

EN

HM-network; information systems; volumes of requests; positive heterogeneous request; negative heterogeneous request

PL

sieć HM; sieć kolejkowa; system informacyjny; pojemność pamięci

• Wydawca: Wydawnictwo Politechniki Częstochowskiej
• Czasopismo: Journal of Applied Mathematics and Computational Mechanics
• Rocznik: 2020
• Tom: Vol. 19, nr 1
• Strony: 67--77
• Opis fizyczny: Bibliogr. 9 poz., tab.

Twórcy

autor

Matalytski Mikhail

• Institute of Mathematics, Czestochowa University of Technology Czestochowa, Poland

autor

Zajac Pawel

• Institute of Mathematics, Czestochowa University of Technology Czestochowa, Poland

autor

Kopats Dmitry

• Faculty of Mathematics and Computer Science, Grodno State Univercity Grodno, Belarus

Bibliografia

• [1] Tikhonenko, O. (2006). Metody probalistyczne analizy systemow informacyjnych. Warszawa: Akademicka Oficyna Wydawnicza EXIT.
• [2] Matalytski, M., & Naumenko, V. (2016). Stochastic Networks with Nonstandard Moving Customers. Grodno: GrSu (In Russian).
• [3] Matalytski, M., & Naumenko, V. (2015). Zastosowanie HM-sieci kolejkowych dla wyznaczenia objętości pamięci systemow informacyjnych. Studia Informatica, 35(3), 63-69.
• [4] Matalytski, M., & Zajac, P. (2017). Finding of expected volumes of request in systems of the queueing network with limited amount of spaces of expectations. Studia Informatica, 38(1B), 89-104.
• [5] Matalytski, M., & Zajac, P. (2017). Application of HM-networks with impatient claims in finding the memory capacity in the information systems. Journal of Applied Mathematics and Computational Mechanics, 16(3), 47-59.
• [6] Matalytski, M., Zajac, P., & Kopats, D. (2018). Application of HM-networks with unreliable systems for finding the memory capacity in the information systems. Journal of Applied Mathematics and Computational Mechanics, 17(2), 51-63.
• [7] Gelenbe, E. (1991). Product form queueing networks with negative and positive customers. Journal of Applied Probability, 28, 656-663.
• [8] Fourneau, J.M. (1996). G-networks with multiple classes of negative and positive customers. Theoretical Computer Science, 155(1), 141-156.
• [9] Gelenbe, E. (2002). G-Networks: Multiple Classes of Positive Customers, Signals, and Product Form. Results Performance Evaluation of Complex Systems: Techniques and Tools. Lecture Notes in Computer Science, 1-16.

Uwagi

Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2020).