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


Wyświetlanie 1-7 z 7
Tytuł:
Probabilistic elements in analysis of performance of multiprocessor systems
Autorzy:
Taborek, K.
Hrynkiewicz, E.
Powiązania:
https://bibliotekanauki.pl/articles/201505.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
arbitration circuit
multiprocessor system
performance analysis
queueing model
arbitraż
system wieloprocesorowy
analiza wydajności
model kolejkowy
Opis:
The paper presents important probabilistic elements that should be taken into consideration in the analysis of performance of classical multiprocessor systems. These elements represent the following quantities: modified arrival rate for processor requests and a few probabilities, which determine the frequency of certain events when a multiprocessor system is working. There are four peculiar events: service of another job, existence of the queue, a processor request while the given task is waiting into the queue and the return of another task into the queue while the given task is waiting in the queue. The first three events happen more often when a system consists of less number of processors, whereas the fourth event happens more often when more processors work in a system. Including (or not) the probabilities of these events to the analysis of performance of multiprocessor systems exerts its much influence on the precision of computations. All the mentioned quantities were described in detail. Formulas for these quantities were derived. Examples of applications of the formulas to the prediction of performance of various multiprocessor systems were presented.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 4; 765-771
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of a single server queue in a multi-phase random environment with working vacations and customers’ impatience
Autorzy:
Bouchentouf, Amina Angelika
Guendouzi, Abdelhak
Houalef, Meriem
Majid, Shakir
Powiązania:
https://bibliotekanauki.pl/articles/2175837.pdf
Data publikacji:
2022
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
queueing model
multi-phase random environment
working vacation policies
impatient customer
probability generating function
Opis:
In this paper, we analyze an M/M/1 queueing system under both single and multiple working vacation policies, multiphase random environment, waiting server, balking and reneging. When the system is in operative phase j = 1, 2, . . . , K, customers are served one by one. Whenever the system becomes empty, the server waits a random amount of time before taking a vacation, causing the system to move to working vacation phase 0 at which new arrivals are served at a lower rate. Using the probability generating function method, we obtain the distribution for the steady-state probabilities of the system. Then, we derive important performance measures of the queueing system. Finally, some numerical examples are illustrated to show the impact of system parameters on performance measures of the queueing system.
Źródło:
Operations Research and Decisions; 2022, 32, 2; 16--33
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On truncations for weakly ergodic inhomogeneous birth and death processes
Autorzy:
Zeifman, A.
Satin, Y.
Korolev, V.
Shorgin, S.
Powiązania:
https://bibliotekanauki.pl/articles/330983.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
birth process
death process
weak ergodicity
truncation
forward Kolmogorov system
nonstationary Markovian queueing model
proces narodzin
proces śmierci
obcinanie
system Kołmogorowa
model Markowa
Opis:
We investigate a class of exponentially weakly ergodic inhomogeneous birth and death processes. We consider special transformations of the reduced intensity matrix of the process and obtain uniform (in time) error bounds of truncations. Our approach also guarantees that we can find limiting characteristics approximately with an arbitrarily fixed error. As an example, we obtain the respective bounds of the truncation error for an Mt/Mt/S queue for any number of servers S. Arbitrary intensity functions instead of periodic ones can be considered in the same manner.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 503-518
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Approximation models for the evaluation of TCP/AQM networks
Autorzy:
Marek, Dariusz
Domański, Adam
Domańska, Joanna
Szyguła, Jakub
Czachórski, Tadeusz
Klamka, Jerzy
Filus, Katarzyna
Powiązania:
https://bibliotekanauki.pl/articles/2173690.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
diffusion approximation
active queue management
AQM
congestion control
dropping packets
fluid flow approximation
FFA
non-integer order PIγ controller
G/G/1/N queueing model
przybliżenie dyfuzji
aktywne zarządzanie kolejką
kontrola zatorów
upuszczanie pakietów
przybliżenie przepływu płynu
model kolejkowania G/G/1/N
Opis:
The article proposes a model in which Diffusion Approximation is used to analyse the TCP/AQM transmission mechanism in a multinode computer network. In order to prevent traffic congestion, routers implement AQM (Active Queue Management) algorithms. We investigate the influence of using RED-based AQM mechanisms and the fractional controller PIγ on the transport layer. Additionally, we examine the cases in which the TCP and the UDP flows occur and analyse their mutual influence. Both transport protocols used are independent and work simultaneously. We compare our solution with the Fluid Flow approximation, demonstrating the advantages of Diffusion Approximation.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e141986
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An influence of service discipline on characteristics of a single-server queue with non-homogeneous customers
Autorzy:
Tikhonenko, O.
Gola, A.
Ziółkowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/122059.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
single-server queueing system
customers loss probability
analytical model
simulation
queueing theory
system kolejkowy z jednym serwerem
prawdopodobieństwo utraty klientów
model analityczny
symulacja
teoria kolejkowania
Opis:
For single-server queueing systems with non-homogeneous customers having some random space requirements we compare processor-sharing and FIFO disciplines and investigate their influence on the total sum of space requirements characteristics (when this sum is not limited, i.e. V = ∞) and customers loss probability (when this sum is limeted, i.e. V < ∞), using analytical modeling and simulation.
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2010, 15; 191-200
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the law of the iterated logarithm in hybrid multiphase queueing systems
Autorzy:
Minkevičius, Saulius
Powiązania:
https://bibliotekanauki.pl/articles/1181931.pdf
Data publikacji:
2020
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
operations research
model
computer network
queueing network
performance evaluationi
iterated logarithm
Opis:
The model of a hybrid multiphase queueing system (HMQS) has been developed to measure the performance of complex computer networks working under conditions of heavy traffic. Two probability limit theorems (laws of the iterated logarithm, LIL) are presented for a queue length of jobs in HMQS.
Źródło:
Operations Research and Decisions; 2020, 30, 4; 57-64
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł
    Wyświetlanie 1-7 z 7

    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