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ę "system kolejkowy" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    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ł
    Tytuł:
    From exhaustive vacation queues to preemptive priority queues with general interarrival times
    Autorzy:
    Fiems, D.
    De Vuyst, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/330948.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    queueing system
    preemptive priority
    server interruption
    server breakdown
    exhaustive vacations
    system kolejkowy
    zawieszenie serwera
    awaria serwera
    Opis:
    We consider the discrete-time G/GI/1 queueing system with multiple exhaustive vacations. By a transform approach, we obtain an expression for the probability generating function of the waiting time of customers in such a system. We then show that the results can be used to assess the performance of G/GI/1 queueing systems with server breakdowns as well as that of the low-priority queue of a preemptive MX+G/GI/1 priority queueing system. By calculating service completion times of low-priority customers, various preemptive breakdown/priority disciplines can be studied, including preemptive resume and preemptive repeat, as well as their combinations. We illustrate our approach with some numerical examples.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 4; 695-704
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of an MAP/PH/1 queue with flexible group service
    Autorzy:
    Brugno, A.
    D’Apice, C.
    Dudin, A.
    Manzo, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/330419.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    queueing system
    batch service
    multirate service
    stationary distribution
    optimization
    system kolejkowy
    usługa wsadowa
    usługa wielotaryfowa
    rozkład stacjonarny
    Opis:
    A novel customer batch service discipline for a single server queue is introduced and analyzed. Service to customers is offered in batches of a certain size. If the number of customers in the system at the service completion moment is less than this size, the server does not start the next service until the number of customers in the system reaches this size or a random limitation of the idle time of the server expires, whichever occurs first. Customers arrive according to a Markovian arrival process. An individual customer’s service time has a phase-type distribution. The service time of a batch is defined as the maximum of the individual service times of the customers which form the batch. The dynamics of such a system are described by a multi-dimensional Markov chain. An ergodicity condition for this Markov chain is derived, a stationary probability distribution of the states is computed, and formulas for the main performance measures of the system are provided. The Laplace–Stieltjes transform of the waiting time is obtained. Results are numerically illustrated.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2017, 27, 1; 119-131
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of an MMAP/PH1, PH2/N/∞ queueing system operating in a random environment
    Autorzy:
    Kim, C.
    Dudin, A.
    Dudin, S.
    Dudina, O.
    Powiązania:
    https://bibliotekanauki.pl/articles/330607.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    random environment
    marked Markovian arrival process
    phase type distribution
    Laplace–Stieltjes transform
    rozkład fazowy
    transformata Laplace'a-Stieltjesa
    system operacyjny
    system kolejkowy
    Opis:
    A multi-server queueing system with two types of customers and an infinite buffer operating in a random environment as a model of a contact center is investigated. The arrival flow of customers is described by a marked Markovian arrival process. Type 1 customers have a non-preemptive priority over type 2 customers and can leave the buffer due to a lack of service. The service times of different type customers have a phase-type distribution with different parameters. To facilitate the investigation of the system we use a generalized phase-type service time distribution. The criterion of ergodicity for a multi-dimensional Markov chain describing the behavior of the system and the algorithm for computation of its steady-state distribution are outlined. Some key performance measures are calculated. The Laplace–Stieltjes transforms of the sojourn and waiting time distributions of priority and non-priority customers are derived. A numerical example illustrating the importance of taking into account the correlation in the arrival process is presented.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 485-501
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of AQM queues with queue size based packet dropping
    Autorzy:
    Chydziński, A.
    Chróst, Ł.
    Powiązania:
    https://bibliotekanauki.pl/articles/907529.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    system kolejkowy
    porzucanie pakietu
    wielkość rozproszenia
    aktywne zarządzanie kolejką
    single-server queue
    packet dropping
    queue size distribution
    active queue management
    Opis:
    Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that include some commonly used blocking probabilities (dropping functions).
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2011, 21, 3; 567-577
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A queueing system with heterogeneous impatient customers and consumable additional items
    Autorzy:
    Baek, J.
    Dudina, O.
    Kim, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/907646.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    marked Markovian arrival process
    consumable additional items
    phase type distribution
    impatient customer
    Markowski proces zgłoszeń
    system kolejkowy
    rozkład fazowy
    klient niecierpliwy
    Opis:
    A single-server queueing system with a marked Markovian arrival process of heterogeneous customers is considered. Type-1 customers have limited preemptive priority over type-2 customers. There is an infinite buffer for type-2 customers and no buffer for type-1 customers. There is also a finite buffer (stock) for consumable additional items (semi-products, half-stocks, etc.) which arrive according to the Markovian arrival process. Service of a customer requires a fixed number of consumable additional items depending on the type of the customer. The service time has a phase-type distribution depending on the type of the customer. Customers in the buffer are impatient and may leave the system without service after an exponentially distributed amount of waiting time. Aiming to minimize the loss probability of type-1 customers and maximize throughput of the system, a threshold strategy of admission to service of type-2 customers is offered. Service of type-2 customer can start only if the server is idle and the number of consumable additional items in the stock exceeds the fixed threshold. Stationary distributions of the system states and the waiting time are computed. In the numerical example, we show some interesting effects and illustrate a possibility of application of the presented results for solution of optimization problems.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2017, 27, 2; 367-384
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning
    Autorzy:
    Woźniak, M.
    Kempa, W. M.
    Gabryel, M.
    Nowicki, R. K.
    Powiązania:
    https://bibliotekanauki.pl/articles/330346.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    finite buffer queue
    evolutionary strategy
    object positioning
    queueing system
    busy period
    idle time
    single vacation
    strategia ewolucyjna
    pozycjonowanie obiektu
    system kolejkowy
    czas bezczynności
    Opis:
    In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments are presented. A cost optimization problem is solved using an evolutionary strategy for a class of queueing systems described by exponential and Erlang distributions.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 887-900
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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