Temat: service time - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies
Autorzy:: Gaidamaka, Y.
Pechinkin, A.
Razumchik, R.
Samouylov, K.
Sopin, E.
Powiązania:: https://bibliotekanauki.pl/articles/330114.pdf
Data publikacji:: 2014
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: queueing system
batch arrival
general service time
overload
hysteretic load control
system kolejkowy
czas obsługi
przeciążenie
Opis:: Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system [...] with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered. The expression for an important performance characteristic of each policy (the mean time between changes in the system mode) is presented. Numerical examples that allow comparison of the efficiency of both policies are given.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 519-534
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Transient and stationary characteristics of a packet buffer modelled as an MAP/SM/1/b system
Autorzy:: Rusek, K.
Janowski, L.
Papir, Z.
Powiązania:: https://bibliotekanauki.pl/articles/330560.pdf
Data publikacji:: 2014
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: router interface
Markovian arrival process
semi Markov service time
hidden Markov model
finite buffer queue
packet loss
first passage time
proces Markowiana
model Markowa niejawny
utrata pakietu
Opis:: A packet buffer limited to a fixed number of packets (regardless of their lengths) is considered. The buffer is described as a finite FIFO queuing system fed by a Markovian Arrival Process (MAP) with service times forming a Semi-Markov (SM) process (MAP/SM/1/b in Kendall’s notation). Such assumptions allow us to obtain new analytical results for the queuing characteristics of the buffer. In the paper, the following are considered: the time to fill the buffer, the local loss intensity, the loss ratio, and the total number of losses in a given time interval. Predictions of the proposed model are much closer to the trace-driven simulation results compared with the prediction of the MAP/G/1/b model.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2014, 24, 2; 429-442
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Analysis of an N-policy GI/M/1 queue in a multi-phase service environment with disasters
Autorzy:: Jiang, T.
Ammar, S. I.
Chang, B.
Liu, L.
Powiązania:: https://bibliotekanauki.pl/articles/330836.pdf
Data publikacji:: 2018
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: N-policy
GI/M/1 queue
multiphase service environment
disaster
sojourn time
kolejka GI/M/1
katastrofa
czas pobytu
Opis:: This paper investigates an N-policy GI/M/1 queue in a multi-phase service environment with disasters, where the system tends to suffer from disastrous failures while it is in operative service environments, making all present customers leave the system simultaneously and the server stop working completely. As soon as the number of customers in the queue reaches a threshold value, the server resumes its service and moves to the appropriate operative service environment immediately with some probability. We derive the stationary queue length distribution, which is then used for the computation of the Laplace– Stieltjes transform of the sojourn time of an arbitrary customer and the server’s working time in a cycle. In addition, some numerical examples are provided to illustrate the impact of several model parameters on the performance measures.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2018, 28, 2; 375-386
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "service time" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język