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ę "HM queueing network" wg kryterium: Temat


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