论文部分内容阅读
研究在路由器中实现RED(randomearlydetection)算法与共享式缓存管理相结合的新机制。根据每个当前活跃的队列的平均队列长度和整个共享缓存区的平均队列长度来动态调整RED算法的参数,提出了支持RED算法的共享缓存管理策略RED-DT(dynamicthreshold),并进一步对其优化,提出RED-ODT(optimaldynamicthreshold)策略。在均衡负载和非均衡负载下进行了仿真实验,将结果与以往的研究结果进行比较后发现:其丢包率更小,缓存利用率更高,同时兼顾公平性。RED-DT和RED-ODT保持了RED机制的优点,并且利于在路由器中实现。
This paper studies the new mechanism of combining RED (randomearlydetection) algorithm with shared cache management in routers. According to the average queue length of each currently active queue and the average queue length of the entire shared buffer, the parameters of the RED algorithm are dynamically adjusted, and a RED-DT (Dynamic Cache Threshold) supporting the RED algorithm is proposed and further optimized , Proposed RED-ODT (optimaldynamicthreshold) strategy. The simulation experiments under equal load and unbalanced load are carried out. The results are compared with the previous research results. It is found that the packet loss rate is smaller, the buffer utilization rate is higher, and the fairness is taken into account. RED-DT and RED-ODT keep the advantages of the RED mechanism, and help to achieve in the router.