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ę "Matalytski, M." wg kryterium: Autor


Tytuł:
About one method of finding expected incomes in HM-queueing network with positive customers and signals
Autorzy:
Matalytski, M.
Powiązania:
https://bibliotekanauki.pl/articles/122974.pdf
Data publikacji:
2016
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
HM-queueing network
positive and negative customers
signals
expected incomes
ransient regime
kolejkownie sieci
systemy kolejkowe
pozytywny klient
negatywny klient
teoria kolejek
Opis:
In the paper an open Markov HM(Howard-Matalytski)-Queueing Network (QN) with incomes, positive customers and signals (G(Gelenbe)-QN with signals) is investigated. The case is researched, when incomes from the transitions between the states of the network are random variables (RV) with given mean values. In the main part of the paper a description is given of G-network with signals and incomes, all kinds of transition probabilities and incomes from the transitions between the states of the network. The method of finding expected incomes of the researched network was proposed, which is based on using of found approximate and exact expressions for the mean values of random incomes. The variances of incomes of queueing systems (QS) was also found. A calculation example, which illustrates the differences of expected incomes of HM-networks with negative customers and QN without them and also with signals, has been given. The practical significance of these results consist of that they can be used at forecasting incomes in computer systems and networks (CSN) taking into account virus penetration into it and also at load control in such networks.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 1; 87-98
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of Markov HM-Queueing Networks with FIFO discipline at the transient regime and its application
Autorzy:
Matalytski, M.
Powiązania:
https://bibliotekanauki.pl/articles/122796.pdf
Data publikacji:
2015
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
HM queueing network
closed and open queueing network
same types of customers and different types of customers
many-server queues
mean number of customers
Opis:
In the paper Markov Queueing Networks (QN) are considered with the same types and different types of customers and incomes, FIFO discipline, which are probabilistic models of different Information Nets and Systems (INS). The incomes from the state transition of the network depend on servicing times of customers in the Queueing Systems (QS). The purpose of the research are design and development of methods and techniques of finding the probability-cost characteristics in such QN as effective analysis tools of INS. A closed Markov HM-network with the same types of customers has been investigated. Approximate expressions for the expected incomes of the QS were obtained. The method of finding the mean number of the customers was proposed. The analysis of an open HM-network with different types of customers and many-server queues has been carried out in the second part of the paper. Customers during the transition between QS can change its type. Approximate expressions for the expected incomes of the QS for each type of customer have been also obtained. A method for finding the mean number of servicing lines was described.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2015, 14, 3; 65-77
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł
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ł
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ł
Tytuł:
Application of HM-networks with inpatient claims in finding the memory capacity in information systems
Autorzy:
Matalytski, M.
Zajac, P.
Powiązania:
https://bibliotekanauki.pl/articles/122508.pdf
Data publikacji:
2017
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
НМ-networks
information systems
inpatient claims
capacities of claims
system informacyjny
sieci kolejkowe
pojemność pamięci
Opis:
To solve the problem of determining the memory capacity of the information systems (IS), the use of the stochastic model is proposed, based on the use of НМ (Howard-Matalytski) - queueing networks with revenues. This model allows one to take into account time dependencies of the message processing from their capacities, the possibility changes of the messages capacities over time and also the possibility of leaving messages from queues in nodes of IS, without getting into them appropriate processing. The expressions for the mean (expected) values of total message capacities in the IS nodes have been obtained.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2017, 16, 3; 47-59
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ł
Tytuł:
Asymptotic analysis of the closed queueing structure with time-dependent service parameters and single-type messages
Autorzy:
Matalytski, M.
Rusilko, T.
Pankov, A.
Powiązania:
https://bibliotekanauki.pl/articles/122305.pdf
Data publikacji:
2013
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
queueing network
differential equation
asymptotic analysis
Opis:
A closed queueing structure is considered in the paper; the number of single-type messages is not constant and depends on time. The route of messages is given by an arbitrary stochastic matrix of transition probabilities. An asymptotic analysis of this structure in case of large number of service requests is conducted. The service parameters of each queueing system of this structure, as well as the probability of messages transition between systems, depend on time. A system of ordinary differential equations to calculate the average relative number of messages in each queueing system, depending on the time, was obtained.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 2; 73-80
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Diffusion approximation of the network with limited number of same type customers and time dependent service parameters
Autorzy:
Matalytski, M.
Kopats, D.
Powiązania:
https://bibliotekanauki.pl/articles/122463.pdf
Data publikacji:
2016
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
queueing network
birth and death process
asymptotic analysis
sieci kolejkowe
analiza asymptotyczna
proces losowy
Opis:
The article presents research of an open queueing network (QN) with the same types of customers, in which the total number of customers is limited. Service parameters are dependent on time, and the route of customers is determined by an arbitrary stochastic transition probability matrix, which is also dependent on time. Service times of customers in each line of the system is exponentially distributed. Customers are selected on the service according to FIFO discipline. It is assumed that the number of customers in one of the systems is determined by the process of birth and death. It generates and destroys customers with certain service times of rates. The network state is described by the random vector, which is a Markov random process. The purpose of the research is an asymptotic analysis of its process with a big number of customers, obtaining a system of differential equations (DE) to find the mean relative number of customers in the network systems at any time. A specific model example was calculated using the computer. The results can be used for modelling processes of customer service in the insurance companies, banks, logistics companies and other organizations.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 2; 77-84
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Expected volumes of requests in systems of the queueing network with a limited number of waiting places
Autorzy:
Zając, P.
Matalytski, M.
Powiązania:
https://bibliotekanauki.pl/articles/121834.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
sieci HM
sieci kolejkowe
system kolejkowy
bezprzewodowy punkt dostępu
HM-networks
queueing network
single-line queueing system
queueing system
queuing time
limited queue
demands total volume
wireless access point
volume of requests
Opis:
We present a method of finding the expected volume of requests in HM-network with homogeneous requests and bypass of the queueing systems of requests. The case was considered when the volume changes associated with the transitions between the states of the network are deterministic functions, depending on the state of the network and time, and the systems are single line. It is assumed that the probability of the states of the network systems, the parameters of the entrance flow of the requests and the service depend on the time.
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2017, 22; 141-160
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Finding of the expected income of the closed queueing structure and its application in transport logistics
Autorzy:
Matalytski, M.
Kiturko, O.
Powiązania:
https://bibliotekanauki.pl/articles/122798.pdf
Data publikacji:
2013
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
transport logistics
closed queueing structure
Opis:
Research of the closed exponential queueing structure with one-type messages and the income is conducted. The differential equation in partial derivatives for an income distribution density is received. The ordinary differential equation for its expected income is constructed at particular starting conditions. The offered method of its decision in a case when the intensity of the service of messages, the number of messages in networks, the number of lines of the service in systems, the matrix of probabilities of transitions of messages and the income from transitions between conditions of the closed queueing structure (CQS) depend on time is described. An example when change of parameters has seasonal nature is reviewed. Results of this article can be applied at the prediction of the income of the logistic transport system (LTS).
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 1; 85-92
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Finding the expected revenues in Markov networks with positive and negative customers at a stationary regime
Autorzy:
Matalytski, M.
Kopats, D.
Powiązania:
https://bibliotekanauki.pl/articles/122624.pdf
Data publikacji:
2018
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
G-network
positive and negative customers
signals
expected revenues
stationary regime
sieć G
pozytywny klient
negatywny klient
system kolejkowy
Opis:
Finding the expected revenues in the queueing systems (QS) of open Markov G-networks of two types, with positive and negative customers and with positive customers and signals, has been described in the paper. A negative customer arriving to the system destroys one positive customer if at least one is available in the system, thus reducing the number of positive customers in the system by one. The signal, coming into an empty system (where there are no positive customers), does not have any impact on the network and immediately disappears from it. Otherwise, if the system is not empty, when it receives a signal, the following events can occur: the incoming signal instantly moves the positive customer from one QS into another with a certain probability, or with the other probability, the signal is triggered as a negative customer.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 1; 49-60
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł
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ł
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ł

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