Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  active queue management
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Analysis of AQM queues with queue size based packet dropping

100%
Chydziński A., Chróst Ł.
International Journal of Applied Mathematics and Computer Science
|
2011
|
tom 21
|
nr 3
567-577
EN
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).
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

The use of a non-integer order PI controller with an active queue management mechanism

100%
Domański A., Domańska J., Czachórski T., Klamka J.
International Journal of Applied Mathematics and Computer Science
|
2016
|
tom 26
|
nr 4
777-789
EN
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.
3
Content available remote

A RED modified weighted moving average for soft real-time application

100%
Domańska J., Domański A., Augustyn D., Klamka J.
International Journal of Applied Mathematics and Computer Science
|
2014
|
tom 24
|
nr 3
697-707
EN
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.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.