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ę "sieci kolejkowe" wg kryterium: Temat


Wyświetlanie 1-3 z 3
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ł:
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ł
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ł
    Wyświetlanie 1-3 z 3

    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