Analisis Komparatif Kinerja Algoritma Scheduler Queue terhadap Quality of Service Bandwidth MikroTik RouterOS v7

Abstract

Internet Protocol (IP) network quality is determined not only by bandwidth capacity but also by the ability to maintain Quality of Service (QoS) parameters such as throughput, delay, jitter, and packet loss. Previous MikroTik research has generally focused on a single scheduler queue method or a comparison of two, so the comparative characteristics of modern Active Queue Management (AQM) algorithms remain underexamined. This study analysed six scheduler queue methods, namely First In First Out (FIFO), Random Early Detection (RED), Stochastic Fair Queueing (SFQ), Per Connection Queue (PCQ), Flow Queue Controlled Delay (FQ-CoDel), and Common Applications Kept Enhanced (CAKE), on MikroTik RouterOS v7 and their effect on QoS under varying traffic loads. A quantitative experimental approach modelled TCP traffic through the Additive Increase Multiplicative Decrease (AIMD) congestion control mechanism and UDP traffic through VoIP and Video profiles, tested across 72 scenarios with five replications each. Data were analysed using descriptive statistics, relative ranking, the Kruskal-Wallis test, and Jain's Fairness Index. The results showed that FIFO, SFQ, and PCQ were prone to bufferbloat, with delay exceeding 50 ms under overload and peaking at 110.38 ms for PCQ on video traffic, whereas CAKE and FQ-CoDel held latency below 6 ms throughout. CAKE achieved the best composite rank (2.70) with the highest TCP throughput (9.86 Mbps) and the lowest delay (2.53 ms), while PCQ attained a perfect Fairness Index (1.00) on UDP traffic. CAKE is recommended for latency-sensitive heterogeneous networks, whereas PCQ remains preferable when fairness of bandwidth distribution among users is the priority.

GS Cited Analysis