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ę "Ziółkowski, Marcin" wg kryterium: Autor


Wyświetlanie 1-2 z 2
Tytuł:
Multi–server loss queueing system with random volume customers, non–identical servers and a limited sectorized memory buffer
Autorzy:
Ziółkowski, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/27311432.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
multi–server queueing system with heterogeneous servers
queueing systems with random volume customers
sectorized memory buffer
loss probability
Stieltjes convolution
wieloserwerowy system kolejkowy z serwerami heterogenicznymi
prawdopodobieństwo straty
splot Stieltjesa
bufor pamięci sektorowany
system kolejkowy z losowymi klientami
Opis:
In the present paper, the model of multi–server queueing system with random volume customers, non–identical (heterogeneous) servers and a sectorized memory buffer has been investigated. In such system, the arriving customers deliver some portions of information of a different type which means that they are additionally characterized by some random volume vector. This multidimensional information is stored in some specific sectors of a limited memory buffer until customer ends his service. In analyzed model, the arrival flow is assumed to be Poissonian, customers’ service times are independent of their volume vectors and exponentially distributed but the service parameters may be different for every server. Obtained results include general formulae for the steady–state number of customers distribution and loss probability. Special cases analysis and some numerical computations are attached as well.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 5; art. no. e146764
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Single–server queueing system with limited queue, random volume customers and unlimited sectorized memory buffer
Autorzy:
Ziółkowski, Marcin
Tikhonenko, Oleg
Powiązania:
https://bibliotekanauki.pl/articles/2173725.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
single-server queueing system
queueing systems with random volume customers
sectorized memory buffer
total volume vector
Laplace-Stieltjes transform
system kolejkowy z jednym serwerem
system kolejkowy z losowymi klientami
bufor pamięci sektorowany
wektor objętości całkowity
transformata Laplace'a-Stieltjesa
Opis:
In the present paper, we analyze the model of a single–server queueing system with limited number of waiting positions, random volume customers and unlimited sectorized memory buffer. In such a system, the arriving customer is additionally characterized by a non– negative random volume vector whose indications usually represent the portions of unchanged information of a different type that are located in sectors of unlimited memory space dedicated for them during customer presence in the system. When the server ends the service of a customer, information immediately leaves the buffer, releasing resources of the proper sectors. We assume that in the investigated model, the service time of a customer is dependent on his volume vector characteristics. For such defined model, we obtain a general formula for steady–state joint distribution function of the total volume vector in terms of Laplace-Stieltjes transforms. We also present practical results for some special cases of the model together with formulae for steady–state initial moments of the analyzed random vector, in cases where the memory buffer is composed of at most two sectors. Some numerical computations illustrating obtained theoretical results are attached as well.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 6; art. no. e143647
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    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