论文部分内容阅读
作为一种典型的AQM算法,SRED采用一种负载相关的概率来丢弃报文,使得路由器队列长度处于一个较低的稳定值,从而获得相对稳定的网络延时.但SRED算法在设计初始丢弃概率函数时不能保证函数曲线的平稳过渡,这将导致路由器队列长度不稳定以及不必要地丢弃报文.对SRED算法的缺陷进行了理论分析,在此基础上设计了一种增强的SRED算法:E-SRED;同时,分析了AQM机制在IBM的网络处理器NP4GS3中的实现机制,提出了E-SRED算法在NP上的实现方案,给出了方案实现的完整伪码描述.图4,参11.
As a typical AQM algorithm, SRED uses a load-related probability to discard packets so that the router queue length is at a lower stable value, so as to obtain a relatively stable network delay.But the SRED algorithm in the design of the initial drop probability Function can not guarantee the smooth transition of the function curve, which will result in instability of router queue length and unnecessary discarding of packet.After analyzing the flaws of SRED algorithm theoretically, we design an enhanced SRED algorithm: E -SRED. At the same time, the mechanism of AQM in NP4GS3 of IBM is analyzed, and the implementation scheme of E-SRED algorithm in NP is proposed, and a complete pseudocode description of the scheme is given. .