Autor: Zajac, Paweł - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Application of HM-network with positive and negative claims for finding of memory volumes in information systems
Autorzy:: Matalytski, Mikhail
Zając, Paweł
Powiązania:: https://bibliotekanauki.pl/articles/122992.pdf
Data publikacji:: 2019
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: HM-networks
information systems
volume of claim
positive claims
negative claims
sieci HM
systemy informacyjne
roszczenie pozytywne
roszczenie negatywne
Opis:: To solve the problem of determining the volume of memory of information systems (IS), it was suggested to use a stochastic model based on the use of HM (Howard-Matalytski) - a queueing network with revenues. This model allows you to take into account the dependencies of the processing times of messages (claims) on their volumes, the possibility of changing the volume of messages over time, and also the possibility of getting computer viruses into it. In such cases the processing of messages in nodes can be interrupted for some random time. Expressions are obtained for the mean (expected) values of the total message volumes in the IS nodes.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 1; 41-51
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Application of HM-networks with positive and negative heterogeneous requests for finding memory volume in information systems
Autorzy:: Matalytski, Mikhail
Zajac, Pawel
Kopats, Dmitry
Powiązania:: https://bibliotekanauki.pl/articles/1839809.pdf
Data publikacji:: 2020
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: HM-network
information systems
volumes of requests
positive heterogeneous request
negative heterogeneous request
sieć HM
sieć kolejkowa
system informacyjny
pojemność pamięci
Opis:: 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.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 1; 67-77
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Application of HM-networks with positive and negative heterogeneous requests for finding memory volume in information systems
Autorzy:: Matalytski, Mikhail
Zajac, Pawel
Kopats, Dmitry
Powiązania:: https://bibliotekanauki.pl/articles/122732.pdf
Data publikacji:: 2020
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: HM-network
information systems
volumes of requests
positive heterogeneous request
negative heterogeneous request
sieć HM
sieć kolejkowa
system informacyjny
pojemność pamięci
Opis:: 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.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 1; 67-77
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja