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ę "nonstationary state probabilities" wg kryterium: Temat


Wyświetlanie 1-2 z 2
Tytuł:
Investigation of G-networks with restart at a non-stationary mode and their application
Autorzy:
Matalytski, Mikhail
Naumenko, Victor
Kopats, Dmitry
Powiązania:
https://bibliotekanauki.pl/articles/122538.pdf
Data publikacji:
2019
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
queueing network
G-network
positive and negative customers
non-stationary regime
multiple type customers
signals
restart
nonstationary state probabilities
successive approximation method
sieć kolejkowa
sieć G
sygnały
metoda aproksymacji
aproksymacja
teoria kolejek
pozytywny klient
negatywny klient
Opis:
This article discusses the question of restarting the script, when restart is used by many users of the information network, which can be modelled as a G-network. Negative claims simulate the crash of the script and the re-sending of the request. Investigation of an open queuing network (QN) with several types of positive customers with the phase type of distribution of their service time and one type of negative customers have been carried out. Negative customers are signals whose effect is to restart one customers in a queue. A technique is proposed for finding the probability of states. It is based on the use of a modified method of successive approximations, combined with the method of a series. The successive approximations converge with time to a stationary distribution of state probabilities, the form of which is indicated in the article, and the sequence of approximations converges to the solution of the difference-differential equations (DDE) system. The uniqueness of this solution is proved. Any successive approximation is representable in the form of a convergent power series with an infinite radius of convergence, the coefficients of which satisfy recurrence relations, which is convenient for computer calculations. A model example illustrating the finding of time-dependent probabilities of network states using the proposed technique is also presented.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 2; 41-51
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ł
    Wyświetlanie 1-2 z 2

    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