摘要
研究在路由器中实现RED(randomearlydetection)算法与共享式缓存管理相结合的新机制。根据每个当前活跃的队列的平均队列长度和整个共享缓存区的平均队列长度来动态调整RED算法的参数,提出了支持RED算法的共享缓存管理策略RED-DT(dynamicthreshold),并进一步对其优化,提出RED-ODT(optimaldynamicthreshold)策略。在均衡负载和非均衡负载下进行了仿真实验,将结果与以往的研究结果进行比较后发现:其丢包率更小,缓存利用率更高,同时兼顾公平性。RED-DT和RED-ODT保持了RED机制的优点,并且利于在路由器中实现。
This paper analyzes the deployment of the RED (random early detection) algorithm in routers with shared buffers. A buffer management scheme named RED-DT (dynamic threshold) was developed which dynamically adjusts the RED parameter based on the estimated average lengths of both the effective queue and the whole shared buffer. Further, the optimized scheme RED-ODT (optimal dynamic threshold) was proposed. Simulations with uniform and nonuniform traffic loads showed that, compared with previous work, the current schemes have a lower packet drop ratio and better buffer utilization and fairness. The simulation results show that the scheme is more effective than previous schemes and should be deployed in routers.
出处
《清华大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2004年第7期978-980,992,共4页
Journal of Tsinghua University(Science and Technology)
基金
国家自然科学基金资助项目(60173007
60173009)
国家"八六三"高技术项目(2002AA103011-1
2003AA115110)
