A method based on the change rate of average queue length to enhance RED is proposed.
提出了一个基于平均队列长度改变速率RED的增强算法。
The algorithm calculated packet loss rate according to the average queue length and waiting time.
这种算法根据平均队列长度和等待时间计算数据包的丢弃概率。
However, the resulting average queue length is quite sensitive to the level of congestion and to the parameter Settings of RED.
然而这种算法使得平均队列长度对于网络的拥塞水平以及RED参数设置非常敏感。
The algorithm tune the parameter based on both the tendency of the traffic load and the change rate of the average queue length.
在自适应RED算法的基础上，提出了一种以流量变化趋势为依据，以平均队列长度的变化幅度大小为调节参数的RED算法。
It uses packet loss and link utilization history to indicate the congestion, and not relies on average queue length as an estimator of congestion.
它不是使用平均队列长度指示缓冲区拥塞状态，而是使用数据报丢弃的频率和队列空闲程度来管理网络拥塞。
Under the wireless communication network environment, based on the average queue length and waiting time, an improved Random Early Detection (RED) algorithm is proposed.
在无线通信网络环境下，提出了一种改进的基于平均队列长度和等待时间的随机提前检测算法。
Field tests and user reports show efficiency of this algorithm by 30% increase of average traffic capability, 10% increase of rush hour traffic capability and 40% decrease of average queue length.
现场运行的用户报告表明：本算法有效地缓解了由潮汐交通所带来的隧道单向拥挤，使得隧道的日通行能力提高了30%，高峰期的通行能力提高了10%，隧道两端入口的排队长度减少了40%。
The imbedded Markov chains of the model are presented. In the steady state. the expressions of the average waiting time and the average queue length for every priority class of customers are derived.
我们分析了这种模型的嵌入马氏链，并且求出了在稳定状态下各类顾客平均等待时间和平均队长的表达式。
Therefore, an algorithm is proposed to reduce the queue length in the system by way of lengthening the latency for part of users to reduce the average latency for all the system users.
基于上述情况提出一种基于增加部分用户的等待时间从而降低系统中用户的平均等待时间进而缩短系统队列长度的调度算法。
If the average disk-waiting queue length is more than two times the number of disk heads, there is a bottleneck on the disk.
如果平均磁盘等待队列长度多于磁盘头数量的两倍，则磁盘成为瓶颈。
If the average disk-waiting queue length is more than two times the number of disk heads, there is a bottleneck on the disk.
如果平均磁盘等待队列长度多于磁盘头数量的两倍，则磁盘成为瓶颈。
应用推荐