Wszystkie pola: sieci kolejkowe - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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ł

Zmień widok

na półce

Skocz do pozycji: 2.

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ł

Zmień widok

na półce

Skocz do pozycji: 3.

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ł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Asymptotic analysis of a closed G-network of unreliable nodes
Autorzy:: Rusilko, Tatiana
Powiązania:: https://bibliotekanauki.pl/articles/2175521.pdf
Data publikacji:: 2022
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
unreliable queueing systems
positive customer
negative customer
birth-death process
asymptotic analysis
queueing network
sieć G
proces narodzin i śmierci
analiza asymptotyczna
sieci kolejkowe
Opis:: A closed exponential queueing G-network of unreliable multi-server nodes was studied under the asymptotic assumption of a large number of customers. The process of changing the number of functional servers in network nodes was considered as the birth-death process. The process of changing the number of customers at the nodes was considered as a continuous-state Markov process. It was proved that its probability density function satisfies the Fokker-Planck-Kolmogorov equation. The system of differential equations for the first-order and second-order moments of this process was derived. This allows us to predict the expectation, the variance and the pairwise correlation of the number of customers in the G-network nodes both in the transient and steady state.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2022, 21, 2; 91--102
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 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

Skocz do pozycji: 6.

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ł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "sieci kolejkowe" wg kryterium: Wszystkie pola

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język