Temat: requests - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Multi-server closed queueing system with limited buffer space
Autorzy:: Tikhonenko, A.
Tikhonenko-Kędziak, A.
Powiązania:: https://bibliotekanauki.pl/articles/122285.pdf
Data publikacji:: 2017
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: total requests capacity
memory space
loss probability
Stieltjes convolution
systemy kolejkowe
splot Stieltjesa
liczba zgłoszeń
pojemność pamięci
Opis:: In the paper, we investigate multi-server closed queueing systems with identical servers and a finite number of terminals. Requests from each terminal are characterized by a random space requirement (volume), the request service time doesn’t depend on its volume and has an exponential distribution. The total requests capacity in the system is limited by a positive value (buffer space memory volume) V. For such systems, stationary requests number distribution and loss probability are determined. The analogous results for open multi-server systems are obtained as a limit case. Some numerical results are attached as well.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2017, 16, 1; 117-125
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ł

Skocz do pozycji: 4.

Tytuł:: Application of HM-networks with unreliable systems for finding the memory capacity in the information systems
Autorzy:: Matalytski, M.
Zajac, P.
Kopats, D.
Powiązania:: https://bibliotekanauki.pl/articles/122815.pdf
Data publikacji:: 2018
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: HM-network
information systems
unreliable service
volumes of requests
pojemność pamięci
nadmierne buforowanie
sieci HM
sieci kolejkowe Howard-Matalytski
sieci kolejkowe
Opis:: 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.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 2; 51-63
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja