Application of HM-networks with unreliable systems for finding the memory capacity in the information systems

• Autorzy: Matalytski M. , Zajac P. , Kopats D.

Identyfikatory

DOI

10.17512/jamcm.2018.2.05

• Języki publikacji: EN

Abstrakty

EN

To solve the problem of determining the memory capacity of the information systems (IS), it was proposed to use a stochastic model, based on the use of HM (Howard-Matalytski) - queueing networks with incomes. This model takes into account the servicing of requests along with their volumes, the ability to change the volumes of the requests over time and the possibility of damaging IS nodes and their repairs, so servicing of demands can be interrupted randomly. The expressions are generated for the mean (expected) values of total requests volumes in the IS nodes.

Słowa kluczowe

EN

HM-network; information systems; unreliable service; volumes of requests

PL

pojemność pamięci; nadmierne buforowanie; sieci HM; sieci kolejkowe Howard-Matalytski; sieci kolejkowe

• Wydawca: Wydawnictwo Politechniki Częstochowskiej
• Czasopismo: Journal of Applied Mathematics and Computational Mechanics
• Rocznik: 2018
• Tom: Vol. 17, nr 2
• Strony: 51--63
• Opis fizyczny: Bibliogr. 9 poz.

Twórcy

autor

Matalytski M.

• Institute of Mathematics, Czestochowa University of Technology Częstochowa, Poland

autor

Zajac P.

• Institute of Mathematics, Czestochowa University of Technology Częstochowa, Poland

autor

Kopats D.

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

Bibliografia

• [1] Tikhonenko, O. (2006). Metody personalistyczne analizy systemów informacyjnych. Akademicka Oficyna Wydawnicza EXIT.
• [2] Matalytski, M., Tikhonenko, O., & Koluzaeva, E. (2011). Systems and queueing networks: analysis and application [In Russian: Sistemy i seti massovogo obsluzhivanija: analiz i primenenija]. GrSU.
• [3] Bufferbloat [Electronic resource]: Wikipedia: http://en.wikipedia.org/wiki/Bufferbloat.
• [4] Matalytski, M., & Statkevich, S. (2014). Stochastic network with bounded waiting time of claims and unrealiable service. [In Russian: Stohasticheskie seti s ogranichennym vremenem ozhidanija zajavok i nenadjozhnym obsluzhivaniem]. GrSU.
• [5] Matalytski, M. (2015). Analysis and forecasting of expected incomes in Markov network with bounded waiting time for the claims. Automation and Remote Control, 76(6), 1005-1017.
• [6] Matalytski, M., & Naumenko V. (2015). Zastosowanie HM-sieci kolejkowych dla wyznaczenia objętości pamięci systemów informacyjnych. Studia Informatica, 35(3), 63-69.
• [7] Matalytski, M., & Zajac, P. (2016). Finding of expected volumes of request in systems of the queueing network with limited amount of spaces of expectations. Studia Informatica, 36(1), 89-104.
• [8] Matalytski, M., & Zajac, P. (2017). Expected volumes of requests in systems of the queueing network with a limited number of waiting places. Scientific Issues Jan Długosz University in Częstochowa Mathematics XXII, 141-160.
• [9] 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.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).