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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

M. G. Konovalov

Informatics and Control, Federal Research Center

Email: razumchik_r@mail.ru
Russian Federation, Moscow, 119333

R. V. Razumchik

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

Author for correspondence.
Email: razumchik_r@mail.ru
Russian Federation, Moscow, 119333; Moscow, 117198


Copyright (c) 2018 Pleiades Publishing, Inc.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies