The General Renovation as the Active Queue Management Mechanism. Some Aspects and Results

This work is devoted to some aspects of using the general renovation (the definition and brief overview are given) as the active queue management mechanism (like RED (Random Early Detection) algorithms). The attention is paid to the queuing system in which a threshold mechanism and the general renovation mechanism are implemented. This allows to adjust the number of packets in the system by dropping (resetting) the packets from the queue depending on the ratio of a certain control parameter with specified thresholds. But in contrast to standard RED-like systems, a possible reset occurs not at the time of arriving of the next packets in the system, but at the time of the end of service on the device (server). Numerical results for the main probability characteristic (stationary loss probability) are presented. © 2019, Springer Nature Switzerland AG.

Редакторы
-
Сборник материалов конференции
Издательство
Springer Verlag
Номер выпуска
-
Язык
Английский
Страницы
488-502
Статус
Опубликовано
Подразделение
-
Ссылка
-
Номер
-
Том
1141 CCIS
Год
2019
Организации
  • 1 Department of Applied Probability and Informatics, Peoples’ Friendship University of Russia (RUDN University), Miklukho-Maklaya street 6, Moscow, 117198, Russian Federation
  • 2 Institute of Informatics Problems, FRC CSC RAS, IPI FRC CSC RAS, 44-2 Vavilova Street, Moscow, 119333, Russian Federation
  • 3 Laboratory of Information Technologies, Joint Institute for Nuclear Research, Joliot-Curie 6, Moscow region, Dubna, 141980, Russian Federation
Ключевые слова
Active queue management; General renovation; Queuing system; Random early detection; Threshold mechanism
Дата создания
10.02.2020
Дата изменения
10.02.2020
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/56454/