Temat: queueing models - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Processor sharing queueing systems with non-homogeneous customers
Autorzy:: Tikhonenko, O.
Powiązania:: https://bibliotekanauki.pl/articles/121919.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:: egalitarian processor sharing
EPS
queueing models
egalitarne współdzielenie procesora
modele kolejkowe
Opis:: We investigate processor sharing queueing systems with non-homogeneous customers having some random space requirements. Such systems have been used to model and solve various practical problems occurring in the design of computer or communicating systems. The above non-homogenity means that each customer (independently of others) has some random space requirement and his length (or amount of work for his service) generally depends on the space requirement. In real systems, a total sum of space requirements of customers presenting in the system is limited by some constant value (memory capacity) V > 0. We estimate loss characteristcs for such a system using queueing models with unlimited memory space.
Źródło:: Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2010, 15; 149-162
2450-9302
Pojawia się w:: Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Impatient customers in Markovian queue with Bernoulli feedback and waiting server under variant working vacation policy
Autorzy:: Bouchentouf, Amina Angelika
Yahiaoui, Lahcene
Kadi, Mokhtar
Majid, Shakir
Powiązania:: https://bibliotekanauki.pl/articles/1181936.pdf
Data publikacji:: 2020
Wydawca:: Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:: queueing models
variant of a multiple working vacation
balking
reneging
retention of reneged customers
simulation
Opis:: This paper deals with customers’ impatience behaviour for single server Markovian queueing system under K-variant working vacation policy, waiting server, Bernoulli feedback, balking, reneging, and retention of reneged customers. Using the probability generating function (PGF) technique, we obtain the steady-state solution of the system. Besides, we prove the stochastic decomposition properties. Useful performance measures of the considered queueing system are derived. A cost model is developed. Then, the parameter optimisation is carried out numerically, using a quadratic fit search method (QFSM). Finally, numerical examples are provided to visualise the analytical results.
Źródło:: Operations Research and Decisions; 2020, 30, 4; 5-28
2081-8858
2391-6060
Pojawia się w:: Operations Research and Decisions
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Stability of preemptive EDF queueing networks
Autorzy:: Kruk, Łukasz
Powiązania:: https://bibliotekanauki.pl/articles/1395935.pdf
Data publikacji:: 2019
Wydawca:: Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:: Multiclass queueing networks
deadlines
preemption
stability
fluid models
fluid limits
Opis:: We show stability of preemptive, strictly subcritical EDF networks with Markovian routing. To this end, we prove that the associated fluid limits satisfy the first-in-system, first-out (FISFO) fluid model equations and thus, by an extension of a result of Bramson (2001), the corresponding fluid models are stable. We also demonstrate that in a preemptive multiclass EDF network, after a time large enough to process all the initial customers to completion, the maximal number of partially served customers in the system over a finite time horizon converges to zero in \(L^1\) under fluid scaling.
Źródło:: Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica; 2019, 73, 2
0365-1029
2083-7402
Pojawia się w:: Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

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

Informacja

Wyszukujesz frazę "queueing models" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język