The coexistence of heterogeneous congestion control algorithms causes network unfairness and performance degradation. However, existing solutions suffer from the following issues: poor isolation reduces the overall performance, while sensitivity to tuning complicates deployment. In this work, we propose Warbler, a machine learning-driven active queue management (AQM) framework. Warbler classifies flows based on traffic characteristics and utilizes machine learning to adaptively control the bandwidth allocation to improve fairness. We implemented and evaluated the Warbler prototype on a programmable switch. The experimental results show that Warbler significantly improves the network performance, achieving a near-optimal Jain’s fairness index of 0.99, while reducing the delay to 60% of the baseline, cutting jitter by half, and saving 43% of buffer usage. In terms of scalability, it supports 10,000 concurrent long flows with latency below 0.7 s. The Warbler has a low cost and strong adaptability with no need for precise tuning, demonstrating its potential in dealing with heterogeneous CCAs.
Compared to Arikan’s kernel, large-kernel polar codes exhibit higher polarization rates and superior error correction performance. The critical steps of exact successive cancellation (SC) decoding for such codes can be implemented via trellis-based computations to reduce complexity. However, the complexity remains high for large kernels. This paper proposes a permutation-based trellis optimization scheme. The approach builds on the Massey minimal trellis and reorders its time axis to find a permutation that minimizes the number of trellis edges, thereby further reducing the exact SC decoding complexity. For smaller kernels (–), an exhaustive search is conducted to identify the optimal trellis. For larger kernels (–), where an exhaustive search becomes infeasible due to the factorial growth of the permutation space, an ant colony optimization (ACO)-based method is employed to find a near-optimal permutation. Simulation results show that the permutation-optimized trellis lowers the direct SC decoding complexity drastically. Furthermore, compared to the -expression, the -formula and original Massey trellis methods, it achieves multiplication operation reductions of up to 99.2%, 58.1%, and 56.5%, respectively. The improvement is particularly beneficial for large kernels, where traditional decoding methods become computationally prohibitive.