Queueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanism
This article is devoted to some aspects of using the renovation mechanism (different types of renovation are considered, definitions and brief overview are also given) with one or several thresholds as the mathematical models of active queue management mechanisms. The attention is paid to the queuin...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Peoples’ Friendship University of Russia (RUDN University)
2020-12-01
|
Series: | Discrete and Continuous Models and Applied Computational Science |
Subjects: | |
Online Access: | http://journals.rudn.ru/miph/article/viewFile/25178/18848 |
_version_ | 1818534478356676608 |
---|---|
author | Hilquias Viana Carvalho Cravid Ivan S. Zaryadov Tatiana A. Milovanova |
author_facet | Hilquias Viana Carvalho Cravid Ivan S. Zaryadov Tatiana A. Milovanova |
author_sort | Hilquias Viana Carvalho Cravid |
collection | DOAJ |
description | This article is devoted to some aspects of using the renovation mechanism (different types of renovation are considered, definitions and brief overview are also given) with one or several thresholds as the mathematical models of active queue management mechanisms. The attention is paid to the queuing systems in which a threshold mechanism with renovation is implemented. This mechanism allows to adjust the number of packets in the system by dropping (resetting) them from the queue depending on the ratio of a certain control parameter with specified thresholds at the moment of the end of service on the device (server) (in contrast to standard RED-like algorithms, when a possible drop of a packet occurs at the time of arrivals of next packets in the system). The models with one, two and three thresholds with different types of renovation are under consideration. It is worth noting that the thresholds determine not only from which place in the buffer the packets are dropped, but also to which the reset of packets occurs. For some of the models certain analytical and numerical results are obtained (the references are given), some of them are only under investigation, so only the mathematical model and current results may be considered. Some results of comparing classic RED algorithm with renovation mechanism are presented. |
first_indexed | 2024-12-11T18:12:09Z |
format | Article |
id | doaj.art-ede4922d6c194d109d90572cf4a74b6d |
institution | Directory Open Access Journal |
issn | 2658-4670 2658-7149 |
language | English |
last_indexed | 2024-12-11T18:12:09Z |
publishDate | 2020-12-01 |
publisher | Peoples’ Friendship University of Russia (RUDN University) |
record_format | Article |
series | Discrete and Continuous Models and Applied Computational Science |
spelling | doaj.art-ede4922d6c194d109d90572cf4a74b6d2022-12-22T00:55:32ZengPeoples’ Friendship University of Russia (RUDN University)Discrete and Continuous Models and Applied Computational Science2658-46702658-71492020-12-0128430531810.22363/2658-4670-2020-28-4-305-31819539Queueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanismHilquias Viana Carvalho Cravid0Ivan S. Zaryadov1Tatiana A. Milovanova2Peoples’ Friendship University of Russia (RUDN University)Peoples’ Friendship University of Russia (RUDN University); Institute of Informatics Problems, FRC CSC RASPeoples’ Friendship University of Russia (RUDN University)This article is devoted to some aspects of using the renovation mechanism (different types of renovation are considered, definitions and brief overview are also given) with one or several thresholds as the mathematical models of active queue management mechanisms. The attention is paid to the queuing systems in which a threshold mechanism with renovation is implemented. This mechanism allows to adjust the number of packets in the system by dropping (resetting) them from the queue depending on the ratio of a certain control parameter with specified thresholds at the moment of the end of service on the device (server) (in contrast to standard RED-like algorithms, when a possible drop of a packet occurs at the time of arrivals of next packets in the system). The models with one, two and three thresholds with different types of renovation are under consideration. It is worth noting that the thresholds determine not only from which place in the buffer the packets are dropped, but also to which the reset of packets occurs. For some of the models certain analytical and numerical results are obtained (the references are given), some of them are only under investigation, so only the mathematical model and current results may be considered. Some results of comparing classic RED algorithm with renovation mechanism are presented.http://journals.rudn.ru/miph/article/viewFile/25178/18848random early detectionactive queue managementqueu- ing systemgeneral renovationthreshold mechanismdrop functioncongestion control |
spellingShingle | Hilquias Viana Carvalho Cravid Ivan S. Zaryadov Tatiana A. Milovanova Queueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanism Discrete and Continuous Models and Applied Computational Science random early detection active queue management queu- ing system general renovation threshold mechanism drop function congestion control |
title | Queueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanism |
title_full | Queueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanism |
title_fullStr | Queueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanism |
title_full_unstemmed | Queueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanism |
title_short | Queueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanism |
title_sort | queueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanism |
topic | random early detection active queue management queu- ing system general renovation threshold mechanism drop function congestion control |
url | http://journals.rudn.ru/miph/article/viewFile/25178/18848 |
work_keys_str_mv | AT hilquiasvianacarvalhocravid queueingsystemswithdifferenttypesofrenovationmechanismandthresholdsasthemathematicalmodelsofactivequeuemanagementmechanism AT ivanszaryadov queueingsystemswithdifferenttypesofrenovationmechanismandthresholdsasthemathematicalmodelsofactivequeuemanagementmechanism AT tatianaamilovanova queueingsystemswithdifferenttypesofrenovationmechanismandthresholdsasthemathematicalmodelsofactivequeuemanagementmechanism |