Autor: Naumenko, V. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Investigation of G-network with random delay of signals at nonstationary behaviour
Autorzy:: Matalytski, M.
Naumenko, V.
Powiązania:: https://bibliotekanauki.pl/articles/122322.pdf
Data publikacji:: 2014
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
negative messages
transient behavior
signals with random delay
DDoS-attack
sieć G
stan nieustalony
atak DDoS
Opis:: The object of this research is an open queueing G-network with signals with random delay. The purpose of the research is investigation of such a network at the transient behavior. It is considered the case when the intensity of the incoming flow of positive and negative messages and service intensity of messages do not depend on time. All the systems in the network are one-line. It is described the model of computer system DDoS-attacks, the effect of penetration of the virus in a computer network in the form of G-network with random delay of signals. Approximate expressions are obtained for the time-dependent probabilities of states and the average characteristics of the network. Examples are calculated.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2014, 13, 3; 155-166
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

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ł

Zmień widok

na półce

Skocz do pozycji: 3.

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ł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Investigation of G-network with signals at transient behavior
Autorzy:: Matalytski, M.
Naumenko, V.
Powiązania:: https://bibliotekanauki.pl/articles/122904.pdf
Data publikacji:: 2014
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-queueing network
transient behavior
state probabilities
generating function
stan nieustalony
funkcja generująca
Opis:: G-queueing network with positive messages and signals at transient behavior is considered. A system of difference-differential equations for the state probabilities of the network is obtained. To find them and the average characteristics of the network a technique was applied based on the use of apparatus of multivariate generating functions. An expression for the generating function was obtained. An example is calculated.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2014, 13, 1; 75-86
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: Analysis of the queueing network with a random bounded waiting time of positive and negative customers at a non-stationary regime
Autorzy:: Matalytski, M.
Naumenko, V.
Powiązania:: https://bibliotekanauki.pl/articles/122455.pdf
Data publikacji:: 2017
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
positive and negative customers
random bounded waiting time of customers
non-stationary regime
generation function
non-stationary state probabilities
expected revenues
sieć G
pozytywny klient
negatywny klient
teoria kolejek
czas oczekiwania
Opis:: In the first part of the article, an investigation of an open Markov queueing network with positive and negative customers (G-networks) has been carried out. The network receives two exponential arrivals of positive and negative customers. Negative customers do not receive service. The waiting time of customers of both types in each system is bounded by a random variable having an exponential distribution with different parameters. When the waiting time of a negative customer in the queue is over it reduces the number of positive customers per unit if the system has positive customers. The Kolmogorov system of difference-differential equations for non-stationary state probabilities has been derived. The method for finding state probabilities of an investigated network, based on the use of apparatus of multidimensional generating functions has been proposed. Expressions for finding the mean number of positive and negative customers in the network systems have also been found. In the second part the same network has been investigated, but with revenues. The case when revenues from the network transitions between states are random variables with given mean values has been considered. A method for finding expected revenues of the network systems has been proposed. Obtained results may be used for modeling of computer viruses in information systems and networks and also for forecasting of costs, considering the viruses penetration.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2017, 16, 1; 97-108
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: Simulation modeling of HM-networks with consideration of positive and negative messages
Autorzy:: Naumenko, V.
Matalytski, M.
Powiązania:: https://bibliotekanauki.pl/articles/122640.pdf
Data publikacji:: 2015
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: HM-network
incomes
negative messages
simulation modeling
HM-sieci
dochody
modelowanie symulacyjne
Opis:: In the article an open Queueing Network (QN) with positive and negative messages and incomes, which can be used in modeling of the behavior of viruses at the Information Systems and Networks (ISN), and also at forecasting costs taking into account virus penetration, was analyzed. Some numerical and analytical results were described on the analysis of exponential QN of the above type. It was given an algorithm of simulation modeling (SM) of HM-networks with positive and negative messages, based on the 0-point, which allows you to find incomes in such networks with arbitrary distribution of service times of positive messages. The results of the SM have been compared with the proposed analytical and numerical results. Sufficiently high accuracy of these methods was shown.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2015, 14, 2; 49-60
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 7.

Tytuł:: Application of a z-transforms method for investigation of Markov G-networks
Autorzy:: Matalytski, M.
Naumenko, V.
Powiązania:: https://bibliotekanauki.pl/articles/122773.pdf
Data publikacji:: 2014
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: open G-network
positive and negative messages
expected incomes
z-transforms method
dochody oczekiwane
Opis:: The purpose of this research paper is to find the expected incomes in open Markov queueing networks with incomes, positive and negative messages at any time by the multidimensional transformations. Investigations were carried out in cases when incomes from the network transitions between the states are deterministic functions not dependent on network states and time. It is assumed that all network systems are one-line. It was proved the theorem on the expression for the multidimensional z-transform. An algorithm was proposed for calculation of expected incomes. It is calculated an example on the PC.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2014, 13, 1; 61-73
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 8.

Tytuł:: Nonstationary analysis of the queueing network with bypass of systems of multi-type and absolute priority messages
Autorzy:: Matalytski, M.
Naumenko, V.
Powiązania:: https://bibliotekanauki.pl/articles/122976.pdf
Data publikacji:: 2013
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: multi-type messages bypass of systems
absolute priority
conditional probabilities of transitions
system of difference-differential equations
probability states
generating function
Opis:: This paper contains an investigation of an open exponential network with bypass of systems of multi-type messages with absolute priority in transient behavior. Messages with priority received by the node with the probability depending on the state system and the type of incoming messages are for service, forcing messages that are serviced or instant changes in the following system, and can leave the network. Network settings: the intensity of the incoming flow and the intensity of service of different types of messages in single-line systems and the conditional probabilities of transitions of messages between the systems are dependent on the time. 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.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 1; 93-105
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 9.

Tytuł:: Finding the probabilistically-temporal characteristics of Markov G-network with batch removal of positive customers
Autorzy:: Matalytski, M.
Naumenko, V.
Kopats, D.
Powiązania:: https://bibliotekanauki.pl/articles/122998.pdf
Data publikacji:: 2016
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
positive and negative customers
customers batch removal
nonstationary regime
generation function
state probabilities
teoria kolejek
systemy kolejkowe
pozytywny klient
Opis:: The investigation of a Markov queueing network with positive and negative customers and positive customers batch removal has been carried out in the article. The purpose of the research is analysis of such a network at the non-stationary regime, finding the time-dependent state probabilities and mean number of customers. In the first part of this article, a description of the G-network operation is provided with one-line queueing systems. When a negative customer arrives to the system, the count of positive customers is reduced by a random value, which is set by some probability distribution. Then for the non-stationary state probabilities a Kolmogorov system was derived of differencedifferential equations. A technique for finding the state probabilities and the mean number of customers of the investigated network, based on the use of an apparatus of multidimensional generating functions has been proposed. The theorem about the expression for the generating function has been given. A model example has been calculated.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 4; 125-136
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 10.

Tytuł:: Analysis of the queueing network with a random waiting time of negative customers at a non-stationary regime
Autorzy:: Naumenko, V.
Matalytski, M.
Kopats, D.
Powiązania:: https://bibliotekanauki.pl/articles/122923.pdf
Data publikacji:: 2016
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
positive customers
negative customers
random waiting time
heavy-traffic regime
state probabilities
mean characteristics
non-stationary regime
sieci kolejkowe
sieć G
pozytywny klient
negatywny klient
czas oczekiwania
równania różniczkowe
Opis:: In the article a queueing network (QN) with positive customers and a random waiting time of negative customers has been investigated. Negative customers destroy positive customers on the expiration of a random time. Queueing systems (QS) operate under a heavy-traffic regime. The system of difference-differential equations (DDE) for state probabilities of such a network was obtained. The technique of solving this system and finding mean characteristics of the network, which is based on the use of multivariate generating functions was proposed.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 3; 111-122
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Naumenko, V." wg kryterium: Autor

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język