基于ARED排队算法的定性探讨  

The Qualitative Study of ARED Queue Algorithms in Network

作　　者：刘晏兵[1] 刘蕾[1] 

机构地区：[1]重庆邮电学院计算机系,重庆400065

出　　处：《计算机科学》2004年第9期60-61,共2页Computer Science

基　　金：重庆市科委应用基础项目;重庆市中青年教师基金

摘　　要：队列管理和拥塞避免机制是实现网络IP服务质量(QoS)的保证。ARED是一种拥塞避免技术,它在平均队列长度超过最小阈值时,以非零几率丢弃数据分组,尽量不使网络到达拥塞状态,从而克服了全局同步现象,提高了网络性能。本文对ARED算法及参数进行了定性分析,这对组建未来通信网路由器具有参考的作用。IP Quality of Service (QoS)guarantee is realized by managing queue and avoiding congestion in network. In this paper, ARED is a technology of avoiding congestion. When the average queue length is longer than the minimum threshold,ARED will deposal some packets in a nonzero prob congestion ability and intend to prevent the network from congestion. ARED overcomes the global synchronization,improves the performance of networks. This paper makes the Quantitative Analysis of ARED Character in Network,witch is important reference to future telecommunication router.

关 键 词：拥塞避免 排队算法 平均队列长度 队列管理 网络性能 路由器 同步 IP服务质量 通信网 数据分组 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TN915[自动化与计算机技术—计算机科学与技术]