Numerical Analysis of Improved Access Restriction Algorithms in a GI/G/1/N System
- 作者: Konovalov M.1, Razumchik R.1,2
-
隶属关系:
- Informatics and Control, Federal Research Center
- Peoples Friendship University of Russia (RUDN University)
- 期: 卷 63, 编号 6 (2018)
- 页面: 616-625
- 栏目: Mathematical Models and Computational Methods
- URL: https://journals.rcsi.science/1064-2269/article/view/199879
- DOI: https://doi.org/10.1134/S1064226918060141
- ID: 199879
如何引用文章
详细
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.
作者简介
M. Konovalov
Informatics and Control, Federal Research Center
Email: razumchik_r@mail.ru
俄罗斯联邦, Moscow, 119333
R. Razumchik
Informatics and Control, Federal Research Center; Peoples Friendship University of Russia (RUDN University)
编辑信件的主要联系方式.
Email: razumchik_r@mail.ru
俄罗斯联邦, Moscow, 119333; Moscow, 117198