Numerical Analysis of Improved Access Restriction Algorithms in a GI/G/1/N System


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

Resumo

The paper is devoted to the description and experimental analysis of the new active queue management strategies. Construction of strategies is based on developing the idea of the dropping function, which is used in the classic series of RED accesses restriction algorithms. Three modifications of the dropping function are used: with randomization of parameters, with abandonment of structuring and with account for the service time of tasks. The G/G/1/N queue system, for which results of numerical experiments are given, has been chosen as an object of management. In all experiments, the efficiency of the strategies (according to various criteria) has been increased as the mentioned improvements have been implemented. The advantage of new algorithms is particularly evident in the cases of high loads.

Sobre autores

M. Konovalov

Informatics and Control, Federal Research Center

Email: razumchik_r@mail.ru
Rússia, Moscow, 119333

R. Razumchik

Informatics and Control, Federal Research Center; Peoples Friendship University of Russia (RUDN University)

Autor responsável pela correspondência
Email: razumchik_r@mail.ru
Rússia, Moscow, 119333; Moscow, 117198

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Pleiades Publishing, Inc., 2018