| Title | Performance Evaluation of the Modified HTB Algorithm |
| Publication Type | Conference Paper |
| Year of Publication | 2020 |
| Authors | Monakhov, Yuri, Kuznetsova, Anna, Monakhov, Mikhail, Telny, Andrey, Bednyatsky, Ilya |
| Conference Name | 2020 Dynamics of Systems, Mechanisms and Machines (Dynamics) |
| Date Published | Nov. 2020 |
| Publisher | IEEE |
| ISBN Number | 978-1-7281-8096-0 |
| Keywords | Bandwidth, composability, delays, HTB, Kernel, Linux, Linux operating system, Linux Operating System Security, Metrics, network availability, Packet loss, pubcrawl, QoS, resilience, Resiliency, scheduling algorithm, Standards, Testing, Traffic Control, traffic prioritization |
| Abstract | In this article, authors present the results of testing the modified HTB traffic control algorithm in an experimental setup. The algorithm is implemented as a Linux kernel module. An analysis of the experimental results revealed the effect of uneven packet loss in priority classes. In the second part of the article, the authors propose a solution to this problem by applying a distribution scheme for the excess of tokens, according to which excess class tokens are given to the leaf with the highest priority. The new modification of the algorithm was simulated in the AnyLogic environment. The results of an experimental study demonstrated that dividing the excess tokens of the parent class between daughter classes is less effective in terms of network performance than allocating the excess tokens to a high-priority class during the competition for tokens between classes. In general, a modification of the HTB algorithm that implements the proposed token surplus distribution scheme yields more consistent delay times for the high-priority class. |
| URL | https://ieeexplore.ieee.org/document/9306189 |
| DOI | 10.1109/Dynamics50954.2020.9306189 |
| Citation Key | monakhov_performance_2020 |
Performance Evaluation of the Modified HTB Algorithm