Analytical Model of a Weighted Round Robin Service System

Abstract

This paper presents a mathematical description of Weighted Round Robin service strategy, on which basis all the perspective QoS tools that serve to manage congestion in converged packet networks work. On the basis of the presented mathematical model, it is possible to suitably configure the operational parameters (maximum queue length, distribution of the available transfer capacity) of these tools according to required values of packet delays. The implementation of the analytical model is demonstrated on a real network segment using advanced network data traffic emulator.

Analysis of WRR scheduling algorithm frame size impact on CQ switch performance

“…In this paper, we will analyze performance of CQ switch with WRR scheduling algorithm [10]. Performance of this scheduling algorithm will be compared with performance of a Longest Queue First (LQF) [6] and Frame-Based Round Robin Matching (FBRR) [6] scheduling algorithms.…”

“…Only with very high granularity a noticeable difference between these algorithms occurs. If we take into account that our previous research pointed FBRR 10 scheduling algorithm as the one that provides lowest latency, results obtained for WRR algorithm makes it a serious candidate for CQ implementation, especially with larger frame size.…”

Performance analysis of crosspoint queued crossbar switch with weighted round robin scheduling algorithm under unbalanced bursty traffic

“…In this paper, we have analyzed the performance of CQ switch with following scheduling algorithms: Longest Queue First (LQF) [6], Frame-Based Round Robin (FBRR) [6] and Weighted Round Robin (WRR) [7]. The special focus will be paid to WRR scheduling algorithm, because it is an algorithm with QoS support, and according to our knowledge it was not analyzed within CQ switch in available literature.…”