面向变长分组的多优先级动态域值缓存管理算法

Buffer Management Algorithm Oriented to Length-Varied Packets with Dynamic Thresholds for Multiple Priorities

缓存管理是高性能路由器需要解决的技术难题之一 ,一个好的缓存管理算法可以提高路由器的缓存资源利用率并降低分组丢失率 .本文首先介绍了面向定长信元的几种典型动态域值缓存管理算法———DT算法与最佳DT算法以及多优先级DT算法 .然后提出了一种适用于高性能路由器的多优先级最佳DT算法 ,并面向变长分组进行了仿真模拟 .该算法继承了最佳DT算法缓存资源利用率高的优点 ,在多优先级情况下分组丢失率很低 ,模拟分析结果表明该算法的综合性能相当出色 .

Buffer management is one of the important and difficult problems in high performance routers and switches.One excellent buffer management scheme can improve the resource utilization and decrease the number of discard packets.We first discuss some buffer management schemes and algorithms oriented to fixed length cells with dynamic thresholds-DT and Optimal DT,and DT for multiple loss priorities.Then we put forward the optimal DT for multiple loss priorities that can be applied in high performance routers and simulate it orienting to varying-length packets.It receives the advantage of full use of buffer,owned by the Optimal DT,with fewer number of discard packets in the case of multiple priorities,and the simulation analysis indicates that its performance is quite excellent.