Analysis of dynamical queue scheduling algorithm with service loop duration restriction for network switches
- High-Loaded
- Accepted
November 14, 16:30
Room II|II зал
Add to gCal Add to iCal/Outlook
Discuss the presentation
Queue dynamical scheduling algorithms are proposed for network switches supporting Quality of Service and making fewer jitter values spread in conditions of self-similarity.
![](https://2019.secrus.org/wp-content/uploads/2019/08/sitnikov.png)
![](/wp-content/themes/secr/img/ru.png)