摘要：This paper explores the impact of changes to the packet capacities of queue nodes on the performance of congestion algorithms. The dynamic random early drop (DRED) algorithm is crucial in managing congestion, predicting it, and selecting the optimal packet number. Two performance measures were employed to evaluate the effect of varying packet capacities, namely throughput and average queuing delay. Plasticity and efficacy of varying capacities of queue nodes was examined, and varying packet capacities of queue nodes were compared to assess performance. The first queue node performed more effectively than the second queue node in terms of throughput, while the second queue node outperformed the third queue node on both measures.
