一种支持优先级标记处理的主动队列管理机制

An Active Queue Management Mechanism Supporting the Priority Marking

随着Internet流量的日益增加,依赖平均队列长度管理拥塞控制的RED（random early detection）队列管理算法有其内在的缺点,即使结合IETF（Internet engineering task force）明确的拥塞通知ECN（explicit congestionnotification）也不能有效地阻止包丢失.在分析比较RED算法和BLUE算法的基础上,提出了一种加强的主动队列管理机制——EBLUE（enhanced BLUE）,然后结合EBLUE研究了TCP的拥塞控制机制,并且利用令牌桶在网络入口点对注入网络的流量进行标记,以提供最小带宽保证.最后在NS网络仿真环境下对EBLUE的丢包率、链路带宽使用效率等方面进行了仿真实验和性能评价.实验结果证明所提出的机制可以有效地支持带宽预留服务.

With the increasing of Internet traffic, the RED (random early detection) algorithm depending on the average queue length has inherent flaws. RED cannot efficiently prevent the packet loss even if it combines with explicit congestion notification (ECN). Based on comparison between RED and BLUE, an enhanced active queue management mechanism, EBLUE (enhanced BLUE), is presented. The TCP congestion control with EBLUE is researched, and the token bucket is used to mark priority traffic at the network entry in order to provide the minimum rate guarantees. Finally, under the NS environment, the simulated experiment and performance evaluation are done in packet loss percent and link efficiency for EBLUE by comparing the mechanism with relative ones. The experimental results show that this mechanism can support bandwidth reservation services efficiently.