【摘要】 作为一种典型的AQM算法,SRED采用一种负载相关的概率来丢弃报文,使得路由器队列长度处于一个较低的稳定值,从而获得相对稳定的网络延时.但SRED算法在设计初始丢弃概率函数时不能保证函数曲线的平稳过渡,这将导致路由器队列长度不稳定以及不必要地丢弃报文.对SRED算法的缺陷进行了理论分析,在此基础上设计了一种增强的SRED算法:E-SRED;同时,分析了AQM机制在IBM的网络处理器NP4GS3中的实现机制,提出了E-SRED算法在NP上的实现方案,给出了方案实现的完整伪码描述.图4,参11.更多还原

【Abstract】 As a classical active queue management algorithm,SRED pre-emptively discards packets with a load-dependent dropping probability to make the router’s buffer occupation stabilized at a low level when the buffer in router seems congested,so it can acquire comparably steady network delay.But SRED algorithm’s early drop probability function curve changes suddenly which will result in the instability of queue length in router and dropping packets unnecessarily.The authors analyze the limitation of SRED and designd an enhanced SRED algorithm: E-SRED;At the same time,we studied the flow control mechanism of IBM’s network processor-NP4GS3,proposed a project of how to implement the E-SRED algorithm on NP4GS3 and presented the pseudo code of the project.4figs.,11refs.更多还原