Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Information Network" wg kryterium: Temat


Wyświetlanie 1-5 z 5
Tytuł:
Investigation of networks with positive and negative messages, many-lines queueing systems and incomes
Autorzy:
Naumenko, V.
Matalytski, M.
Powiązania:
https://bibliotekanauki.pl/articles/122391.pdf
Data publikacji:
2015
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
G-network
negative messages
many-lines systems
expected incomes
information systems and networks
Opis:
The analysis of an open Markov Queueing Network with positive and negative messages, many-lines queueing systems and incomes has been carried out. External arrivals to the network, service times of rates and probabilities of messages transition between queueing systems (QS) depend on time. A method for finding the expected incomes of the network systems, the expressions for the average number of messages at the systems has been proposed.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2015, 14, 1; 79-90
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nonstationary analysis of a queueing network with positive and negative messages
Autorzy:
Matalytski, M.
Naumenko, V.
Powiązania:
https://bibliotekanauki.pl/articles/122613.pdf
Data publikacji:
2013
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
information systems
telecommunications systems
information networks
telecommunications networks
virus
open G-network with negative messages
transient behavior
system of difference-differential equations
probability states
generating function
Opis:
This paper contains an investigation of an open queueing network with positive and negative messages that can be used to model the behavior of viruses in information and telecommunication systems and networks. The purpose of research is investigation of such a network at the transient behavior. We consider the case when the intensity of the incoming flow of positive and negative messages and service intensity of messages do not depend on time. It is assumed that all queueing systems of network are one-line. We obtained a system difference-differential equations for the state probabilities of the network. To find the state probabilities of the network in the transitional behavior applied a methodology based on the use of the apparatus of multidimensional generating functions. We obtained an expression for generating function. An example is calculated.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 2; 61-71
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł
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ł
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ł
    Wyświetlanie 1-5 z 5

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies