Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "total loss" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Multiline queueing system with random time limitations and limited buffer space
    Autorzy:
    Tikhonenko, O.
    Zając, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/122703.pdf
    Data publikacji:
    2018
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    total demands volume
    system buffer capacity
    loss probability
    Stieltjes convolution
    system kolejkowy
    splot Stieltjesa
    pojemność bufora
    Opis:
    In the paper, we investigate multi-server queueing systems with demands of random space requirements (volumes), in which buffer space is limited by constant value and queueing ore (and) service time are limited by exponentially distributed random variables. For such systems, stationary demands number distribution and loss probability are determined. Some numerical results are attached as well.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 4; 99-106
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Performance evaluation of unreliable system with infinite number of servers
    Autorzy:
    Tikhonenko, O.
    Ziółkowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/201519.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    queueing systems with non-homogeneous customers
    unreliable queueing systems
    total volume
    loss probability
    Laplace–Stieltjes transform
    Opis:
    In the paper, we investigate queueing system M/G/∞ with non-homogeneous customers. By non-homogeneity we mean that each customer is characterized by some arbitrarily distributed random volume. The arriving customers appear according to a stationary Poisson process. Service time of a customer is proportional to his its volume. The system is unreliable, which means that all its servers can break simultaneously and then the repair period goes on for random time having an arbitrary distribution. During this period, customers present in the system and arriving to it are not served. Their service continues immediately after repair period termination. Time intervals of the system in good repair mode have an exponential distribution. For such system, we determine steady-state sojourn time and total volume of customers present in it distributions. We also estimate the loss probability for the similar system with limited total volume. An analysis of some special cases and some numerical examples are attached as well.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 2; 289-297
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multi-server closed queueing system with limited buffer space
    Autorzy:
    Tikhonenko, A.
    Tikhonenko-Kędziak, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/122285.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    total requests capacity
    memory space
    loss probability
    Stieltjes convolution
    systemy kolejkowe
    splot Stieltjesa
    liczba zgłoszeń
    pojemność pamięci
    Opis:
    In the paper, we investigate multi-server closed queueing systems with identical servers and a finite number of terminals. Requests from each terminal are characterized by a random space requirement (volume), the request service time doesn’t depend on its volume and has an exponential distribution. The total requests capacity in the system is limited by a positive value (buffer space memory volume) V. For such systems, stationary requests number distribution and loss probability are determined. The analogous results for open multi-server systems are obtained as a limit case. Some numerical results are attached as well.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2017, 16, 1; 117-125
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Performance evaluation of an M/G/n-type queue with bounded capacity and packet dropping
    Autorzy:
    Tikhonenko, O.
    Kempa, W. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/331288.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    AQM algorithm
    finite buffer
    loss probability
    total packet volume
    queue size distribution
    aktywne zarządzanie kolejką
    prawdopodobieństwo straty
    rozkład wielkości kolejki
    Opis:
    A queueing system of the M/G/n-type, n ≥ 1, with a bounded total volume is considered. It is assumed that the volumes of the arriving packets are generally distributed random variables. Moreover, the AQM-type mechanism is used to control the actual buffer state: each of the arriving packets is dropped with a probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and the loss probability are found. Numerical examples illustrating theoretical formulae are given as well.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 841-854
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Single-server queueing system with external and internal customers
    Autorzy:
    Tikhonenko, O.
    Ziółkowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/199838.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    single-server queueing system with non-homogeneous customers
    random volume customers
    loss probability
    total volume distribution
    Laplace transform
    Laplace-Stieltjes transform
    RAM memory space
    prawdopodobieństwo straty
    transformacja Laplace'a
    transformata Laplace'a-Stieltjesa
    pamięć RAM
    Opis:
    In the paper, we investigate a single-server queueing system with unlimited memory space and non-homogeneous customers (calls) of the two following types: 1) external customers that are served by the system under consideration, 2) internal customers that arrive and interrupt the service process only when an external customer is being served. The external customers appear according to a stationary Poisson process. Customers of each of the above-mentioned types are characterized by some random volume. The customer service time depends arbitrarily on its volume. Two schemes of customer service organization are analyzed. The non-stationary and stationary distributions of the total volume of customers present in the system are determined in terms of Laplace and Laplace-Stieltjes transforms. The stationary first and second moments of total customers volume are also calculated. The obtained results are used to approximate loss characteristics in analogous systems with limited buffer space. Numerical examples illustrating theoretical results are attached as well.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 4; 539-551
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      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