Over the last few decades ago, the study of active queue management (AQM) has resulted in numerous improved algorithms for performing congestion control at the router. The most influential AQM algorithm, however, remains Random Early Detection (RED). A significant problem with RED is that the drop policy component implemented therein is characterized by the use of a solitary linear function, which alone is insufficient for combating network congestion as it ends up in large delay when heavy traffic workload occurs. To overcome this problem, therefore, in this paper, the packet dropping policy of RED is revisited with a focus on designing two new alternative approaches, namely, Amended RED (AmRED) and RED-Quadratic Exponential (RED-QE). Simulation evaluations were conducted in a discrete-event simulation platform (i.e., ns-3) using different scenarios to prove the effectiveness of AmRED and RED-QE against two contemporary AQM algorithms. Simulation reports suggested that RED-QE exhibits superiority. Both AmRED and RED-QE algorithms are amenable to implementation in network routers, considering that only the packet dropping probability profile of RED’s implementation requires very little rectification.

在过去的几十年前，对主动队列管理 (AQM) 的研究已经产生了许多用于在路由器上执行拥塞控制的改进算法。然而，最有影响力的 AQM 算法仍然是随机早期检测 (RED)。 RED的一个显着问题是，其中实现的丢弃策略组件的特点是使用孤立的线性函数，单独的线性函数不足以对抗网络拥塞，因为当发生大流量工作负载时，它会导致大的延迟。因此，为了克服这个问题，本文重新审视了 RED 的丢包策略，重点设计了两种新的替代方法，即修正 RED (AmRED) 和 RED 二次指数 (RED-QE)。在离散事件仿真平台（即 ns-3）中使用不同场景进行仿真评估，以证明 AmRED 和 RED-QE 针对两种当代 AQM 算法的有效性。模拟报告表明 RED-QE 表现出优越性。 AmRED 和 RED-QE 算法都适合在网络路由器中实现，因为仅 RED 实现的数据包丢失概率配置文件需要很少的纠正。