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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-11 z 11
    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 RED modified weighted moving average for soft real-time application
    Autorzy:
    Domańska, J.
    Domański, A.
    Augustyn, D. R.
    Klamka, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/330599.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    active queue management
    soft real time
    dropping packets
    aktywne zarządzanie kolejkami
    czas rzeczywisty miękki
    Opis:
    The popularity of TCP/IP has resulted in an increase in usage of best-effort networks for real-time communication. Much effort has been spent to ensure quality of service for soft real-time traffic over IP networks. The Internet Engineering Task Force has proposed some architecture components, such as Active Queue Management (AQM). The paper investigates the influence of the weighted moving average on packet waiting time reduction for an AQM mechanism: the RED algorithm. The proposed method for computing the average queue length is based on a difference equation (a recursive equation). Depending on a particular optimality criterion, proper parameters of the modified weighted moving average function can be chosen. This change will allow reducing the number of violations of timing constraints and better use of this mechanism for soft real-time transmissions. The optimization problem is solved through simulations performed in OMNeT++ and later verified experimentally on a Linux implementation.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 697-707
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Methods for estimating vehicle queues at a marine terminal: A computational comparison
    Autorzy:
    Chen, G.
    Yang, Z. Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/330523.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    truck queue
    container terminal
    queueing theory
    simulation
    regression
    teoria kolejek
    symulacja
    regresja
    terminal kontenerowy
    Opis:
    A long queue of vehicles at the gate of a marine terminal is a common traffic phenomenon in a port-city, which sometimes causes problems in urban traffic. In order to be able to solve this issue, we firstly need accurate models to estimate such a vehicle queue length. In this paper, we compare the existing methods in a case study, and evaluate their advantages and disadvantages. Particularly, we develop a simulation-based regression model, using the micro traffic simulation software PARAMIC. In simulation, it is found that the queue transient process follows a natural logarithm curve. Then, based on these curves, we develop a queue length estimation model. In the numerical experiment, the proposed model exhibits better estimation accuracy than the other existing methods.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 611-619
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The use of a non-integer order PI controller with an active queue management mechanism
    Autorzy:
    Domański, A.
    Domańska, J.
    Czachórski, T.
    Klamka, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/331094.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    active queue management
    PI controller
    dropping packets
    fractional calculus
    aktywne zarządzanie kolejkami
    regulator PI
    pochodna ułamkowa
    Opis:
    In this paper the performance of a fractional order PI controller is compared with that of RED, a well-known active queue management (AQM) mechanism. The article uses fluid flow approximation and discrete-event simulation to investigate the influence of the AQM policy on the packet loss probability, the queue length and its variability. The impact of self-similar traffic is also considered.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 777-789
    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 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ł
    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ł:
    The IoT gateway with active queue management
    Autorzy:
    Domański, Adam
    Domańska, Joanna
    Czachórski, Tadeusz
    Klamka, Jerzy
    Szyguła, Jakub
    Marek, Dariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/1838178.pdf
    Data publikacji:
    2021
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    active queue management
    PI controller
    dropping packets
    fractional calculus
    IoT gateway
    aktywne zarządzanie kolejkami
    regulator PI
    pochodna ułamkowa
    Internet Rzeczy
    Opis:
    As the traffic volume from various Internet of things (IoT) networks increases significantly, the need for adapting the quality of service (QoS) mechanisms to the new Internet conditions becomes essential. We propose a QoS mechanism for the IoT gateway based on packet classification and active queue management (AQM). End devices label packets with a special packet field (type of service (ToS) for IPv4 or traffic class (TC) for IPv6) and thus classify them as priority for real-time IoT traffic and non-priority for standard IP traffic. Our AQM mechanism drops only non-priority packets and thus ensures that real-time traffic packets for critical IoT systems are not removed if the priority traffic does not exceed the maximum queue capacity. This AQM mechanism is based on the PIα controller with non-integer integration order. We use fluid flow approximation and discrete event simulation to determine the influence of the AQM policy on the packet loss probability, queue length and its variability. The impact of the long-range dependent (LRD) traffic is also considered. The obtained results show the properties of the proposed mechanism and the merits of the PIα controller.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2021, 31, 1; 165-178
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A discrete-time system with service control and repairs
    Autorzy:
    Atencia, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/331340.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    discrete time queue
    unreliable server
    negative customers
    busy period
    sojourn times
    continuous time counterpart
    serwer niepewny
    odbiorca ujemny
    system czasu dyskretnego
    Opis:
    This paper discusses a discrete-time queueing system with starting failures in which an arriving customer follows three different strategies. Two of them correspond to the LCFS (Last Come First Served) discipline, in which displacements or expulsions of customers occur. The third strategy acts as a signal, that is, it becomes a negative customer. Also examined is the possibility of failures at each service commencement epoch. We carry out a thorough study of the model, deriving analytical results for the stationary distribution. We obtain the generating functions of the number of customers in the queue and in the system. The generating functions of the busy period as well as the sojourn times of a customer at the server, in the queue and in the system, are also provided. We present the main performance measures of the model. The versatility of this model allows us to mention several special cases of interest. Finally, we prove the convergence to the continuous-time counterpart and give some numerical results that show the behavior of some performance measures with respect to the most significant parameters of the system.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 471-484
    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ł
    Tytuł:
    A multi-source fluid queue based stochastic model of the probabilistic offloading strategy in a MEC system with multiple mobile devices and a single MEC server
    Autorzy:
    Zheng, Huan
    Jin, Shunfu
    Powiązania:
    https://bibliotekanauki.pl/articles/2055156.pdf
    Data publikacji:
    2022
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    mobile edge computing
    probabilistic offloading strategy
    multi-source fluid queue
    birth and death process
    cumulative distribution function
    przetwarzanie mobilne
    proces narodzin i śmierci
    dystrybuanta
    Opis:
    Mobile edge computing (MEC) is one of the key technologies to achieve high bandwidth, low latency and reliable service in fifth generation (5G) networks. In order to better evaluate the performance of the probabilistic offloading strategy in a MEC system, we give a modeling method to capture the stochastic behavior of tasks based on a multi-source fluid queue. Considering multiple mobile devices (MDs) in a MEC system, we build a multi-source fluid queue to model the tasks offloaded to the MEC server. We give an approach to analyze the fluid queue driven by multiple independent heterogeneous finite-state birth-and-death processes (BDPs) and present the cumulative distribution function (CDF) of the edge buffer content. Then, we evaluate the performance measures in terms of the utilization of the MEC server, the expected edge buffer content and the average response time of a task. Finally, we provide numerical results with some analysis to illustrate the feasibility of the stochastic model built in this paper.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2022, 32, 1; 125--138
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    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ł
      Wyświetlanie 1-11 z 11

      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