Wszystkie pola: queueing systems - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Calculating steady-state probabilities of queueing systems using hyperexponential approximation
Autorzy:: Zhernovyi, Yuriy
Kopytko, Bohdan
Powiązania:: https://bibliotekanauki.pl/articles/122829.pdf
Data publikacji:: 2019
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: non-Markovian queueing system
hyperexponential approximation
complex and paradoxical parameters of distribution
system kolejkowy
aproksymacja
rozkład hiperesponencjalny
Opis:: This article proposes an analysis of the results of the application of hyperexponential approximations with parameters of the paradoxical and complex type for calculating the steady-state probabilities of the G/G/n/m queueing systems with the number of channels n = 1, 2 and 3. The steady-state probabilities are solutions of a system of linear algebraic equations obtained by the method of fictitious phases. Approximation of arbitrary distributions is carried out using the method of moments. We verified the obtained numerical results using potential method and simulation models, constructed by means of GPSS World.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 2; 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: 2.

Tytuł:: Recurrence relations for two-channel closed queueing systems with Erlangian service times
Autorzy:: Kopytko, B.
Zhernovyi, K.
Powiązania:: https://bibliotekanauki.pl/articles/122421.pdf
Data publikacji:: 2018
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: two-channel closed queueing system
Erlangian service times
fictitious phase method
recurrence relations
system kolejkowania dwukanałowy
czas obsługi Erlanga
rozkład Erlanga
Opis:: This paper proposes a method for determining the steady-state characteristics of two-channel closed queueing systems with an exponential distribution of the time generation of service requests and the Erlang distributions of the service times. Recurrence relations for computing the steady-state distribution of the number of customers in the system are deduced. The obtained algorithms are tested on examples using simulation models in the GPSS World environment.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 1; 37-48
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ł:: Steady-state characteristics of three-channel queueing systems with Erlangian service times
Autorzy:: Kopytko, B.
Zhernovyi, K.
Powiązania:: https://bibliotekanauki.pl/articles/122266.pdf
Data publikacji:: 2016
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: three-channel queueing system
Poisson input
Erlangian service times
random dropping of customers
fictitious phase method
recurrence relations
trójkanałowy system kolejkowania
metoda fazy fikcyjnej
równanie rekurencyjne
Opis:: We propose a method of study the M/E₂/3/∞ queueing systems: standard system and systems with the threshold and hysteretic strategies of the random dropping of customers in order to control the input flow. Recurrence relations to compute the stationary distribution of the number of customers and the steady-state characteristics are obtained. The developed algorithms are tested on examples using simulation models constructed with the assistance of the GPSS World tools.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 3; 75-87
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ł:: Calculating steady-state probabilities of single-channel closed queueing systems using hyperexponential approximation
Autorzy:: Zhernovyi, Yuriy
Kopytko, Bohdan
Powiązania:: https://bibliotekanauki.pl/articles/1839796.pdf
Data publikacji:: 2020
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: single-channel closed queueing system
arbitrary distributions
hyperexponential approximation
system kolejkowania
rozkład prawdopodobieństwa
aproksymacja wykładnicza
Opis:: In this paper we propose a method for calculating steady-state probability distributions of the single-channel closed queueing systems with arbitrary distributions of customer generation times and service times. The approach based on the use of fictitious phases and hyperexponential approximations with parameters of the paradoxical and complex type by the method of moments. We defined conditions for the variation coefficients of the gamma distributions and Weibull distributions, for which the best accuracy of calculating the steady-state probabilities is achieved in comparison with the results of simulation modeling.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 1; 113-120
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ł:: Calculating steady-state probabilities of single-channel closed queueing systems using hyperexponential approximation
Autorzy:: Zhernovyi, Yuriy
Kopytko, Bohdan
Powiązania:: https://bibliotekanauki.pl/articles/122348.pdf
Data publikacji:: 2020
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: single-channel closed queueing system
arbitrary distributions
hyperexponential approximation
system kolejkowania
rozkład prawdopodobieństwa
aproksymacja wykładnicza
Opis:: In this paper we propose a method for calculating steady-state probability distributions of the single-channel closed queueing systems with arbitrary distributions of customer generation times and service times. The approach based on the use of fictitious phases and hyperexponential approximations with parameters of the paradoxical and complex type by the method of moments. We defined conditions for the variation coefficients of the gamma distributions and Weibull distributions, for which the best accuracy of calculating the steady-state probabilities is achieved in comparison with the results of simulation modeling.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 1; 113-120
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ł:: M/M/n/(m,V) queueing systems with a rejection mechanism based on AQM
Autorzy:: Ziółkowski, M.
Małek, J.
Powiązania:: https://bibliotekanauki.pl/articles/122605.pdf
Data publikacji:: 2013
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: Markovian process
queueing systems with non-homogeneous customers
active queue management introduction
Opis:: M/M/n/(m,V) queueing systems with service time independent of customer volume are well known models used in computer science. In real computer systems (computer networks etc.) we often deal with the overload problem. In computer networks we solve the problem using AQM techniques, which are connected with introducing some accepting function that lets us reject in random way some part of the arriving customers. It causes reduction of each customer's mean waiting time and let us avoid jams in consequence. Unfortunately, in this way the loss probability increases. In this paper we investigate the analogous model based on some generalization of M/M/n/(m,V) queueing system. We obtain formulas for a stationary number of customers distribution function and loss probability and we do some computations in special cases.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 1; 121-130
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: 7.

Tytuł:: Investigation of networks with positive and negative messages, many-lines queueing systems and incomes
Autorzy:: Naumenko, V.
Matalytski, M.
Powiązania:: https://bibliotekanauki.pl/articles/122391.pdf
Data publikacji:: 2015
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
negative messages
many-lines systems
expected incomes
information systems and networks
Opis:: The analysis of an open Markov Queueing Network with positive and negative messages, many-lines queueing systems and incomes has been carried out. External arrivals to the network, service times of rates and probabilities of messages transition between queueing systems (QS) depend on time. A method for finding the expected incomes of the network systems, the expressions for the average number of messages at the systems has been proposed.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2015, 14, 1; 79-90
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: 8.

Tytuł:: Investigation of G-network with bypasses of queueing systems by positive customers at a non-stationary regime
Autorzy:: Naumenko, Victor
Kopats, Dmitry
Matalytski, Mikhail
Pankov, Andrey
Powiązania:: https://bibliotekanauki.pl/articles/1839756.pdf
Data publikacji:: 2020
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: queuing network
non-stationary regime
negative customers
bypass
sieć kolejkowa
negatywny klient
pozytywny klient
Opis:: An open queuing network (QN) with single-line queuing systems (QS) is considered. QS are characterized by the presence of bypasses and the possibility of coming of negative customers. The network receives two independent elementary streams. The first stream is formed from the ordinary (positive) customers, while the second is composed of negative customers. Arriving of each negative customer to the system destroys exactly one positive customer in the queue, if those are contained. Negative customers do not require maintenance as the service of positive customers in the network systems is carried out in accordance with the FIFO discipline. Positive customers with a probability depending on the state of the node when they are sent to it are added to the queue, and with an additional probability, they immediately bypass it and behave in the future as served. The service in the systems is exponential, the routing of positive customers in the network is Markov, taking into account the possibility of turning the customer into a negative one after sending it to another system.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 3; 85-97
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: 9.

Tytuł:: Calculating steady-state probabilities of single-channel queueing systems with changes of service times depending on the queue length
Autorzy:: Zhernovyi, Yuriy
Kopytko, Bohdan
Powiązania:: https://bibliotekanauki.pl/articles/122726.pdf
Data publikacji:: 2019
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: single-channel queueing system
service times changes depending of the queue length
hyperexponential approximation
rozkład hiperesponencjalny
czas obsługi
system kolejkowania jednokanałowy
długość kolejki
Opis:: In this paper, we propose a method for calculating steady-state probabilities of the G/G/1/m and M/G/1/m queueing systems with service times changes depending of the number of customers in the system. The method is based on the use of fictitious phases and hyperexponential approximations with parameters of the paradoxical and complex type. A change in the service mode can only occur at the moment the service is started. We verified the obtained numerical results using the potential method and simulation models, constructed by means of GPSS World.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 3; 107-117
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: 10.

Tytuł:: Recurrence relations for two-channel queueing systems with Erlangian service times and hysteretic strategy of random dropping of customers
Autorzy:: Zhernovyi, Y.
Kopytko, B.
Powiązania:: https://bibliotekanauki.pl/articles/122986.pdf
Data publikacji:: 2018
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: two-channel queueing system
Erlangian service times
random dropping of customers
fictitious phase method
hysteretic strategy
recurrence relations
steady-state characteristics
czas obsługi Erlanga
strategia histeretyczna
system kolejkowania dwukanałowy
Opis:: This article proposes a method of study the M/E_s/2/m and M/E_s/2/∞ queueing systems with a hysteretic strategy of random dropping of customers. Recurrence relations are obtained to compute the stationary distribution of the number of customers and steadystate characteristics. The constructed algorithms were tested on examples with the use of simulation models constructed with the help of GPSS World.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 2; 93-103
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: 11.

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: 12.

Tytuł:: Formulas for average transition times between states of the Markov birth-death process
Autorzy:: Zhernovyi, Yuriy
Kopytko, Bohdan
Powiązania:: https://bibliotekanauki.pl/articles/2175497.pdf
Data publikacji:: 2021
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: birth-death process
Markov models
mean transition time
mean time spent in the group of states
queueing systems
reliability model
proces narodzin i śmierci
modele Markova
średni czas przejścia
średni czas spędzony w grupie stanów
systemy kolejkowe
model niezawodności
Opis:: In this paper, we consider Markov birth-death processes with constant intensities of transitions between neighboring states that have an ergodic property. Using the exponential distributions properties, we obtain formulas for the mean time of transition from the state i to the state j and transitions back, from the state j to the state i. We found expressions for the mean time spent outside the given state i, the mean time spent in the group of states (0,...,i-1) to the left from state i, and the mean time spent in the group of states (i+1,i+2,...) to the right. We derive the formulas for some special cases of the Markov birth-death processes, namely, for the Erlang loss system, the queueing systems with finite and with infinite waiting room and the reliability model for a recoverable system.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2021, 20, 4; 99--110
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: 13.

Tytuł:: Nonstationary analysis of the queueing network with bypass of systems of multi-type and absolute priority messages
Autorzy:: Matalytski, M.
Naumenko, V.
Powiązania:: https://bibliotekanauki.pl/articles/122976.pdf
Data publikacji:: 2013
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: multi-type messages bypass of systems
absolute priority
conditional probabilities of transitions
system of difference-differential equations
probability states
generating function
Opis:: This paper contains an investigation of an open exponential network with bypass of systems of multi-type messages with absolute priority in transient behavior. Messages with priority received by the node with the probability depending on the state system and the type of incoming messages are for service, forcing messages that are serviced or instant changes in the following system, and can leave the network. Network settings: the intensity of the incoming flow and the intensity of service of different types of messages in single-line systems and the conditional probabilities of transitions of messages between the systems are dependent on the time. We obtained a system difference-differential equations for the state probabilities of the network. To find the state probabilities of the network in the transitional behavior applied a methodology based on the use of the apparatus of multidimensional generating functions.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 1; 93-105
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: 14.

Tytuł:: Nonstationary analysis of a queueing network with positive and negative messages
Autorzy:: Matalytski, M.
Naumenko, V.
Powiązania:: https://bibliotekanauki.pl/articles/122613.pdf
Data publikacji:: 2013
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: information systems
telecommunications systems
information networks
telecommunications networks
virus
open G-network with negative messages
transient behavior
system of difference-differential equations
probability states
generating function
Opis:: This paper contains an investigation of an open queueing network with positive and negative messages that can be used to model the behavior of viruses in information and telecommunication systems and networks. The purpose of research is investigation of such a network at the transient behavior. We consider the case when the intensity of the incoming flow of positive and negative messages and service intensity of messages do not depend on time. It is assumed that all queueing systems of network are one-line. We obtained a system difference-differential equations for the state probabilities of the network. To find the state probabilities of the network in the transitional behavior applied a methodology based on the use of the apparatus of multidimensional generating functions. We obtained an expression for generating function. An example is calculated.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 2; 61-71
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ę "queueing systems" wg kryterium: Wszystkie pola

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język