You can assess the effect of any queue by looking at the minimum time items are in the queue, as well as the average time taken to process an item in the queue.
您可以通过查看查询中的最小时间项，以及查询中处理一个项目所需要的平均时间，来访问任意查询的效果。
Under the wireless communication network environment, based on the average queue length and waiting time, an improved Random Early Detection (RED) algorithm is proposed.
在无线通信网络环境下，提出了一种改进的基于平均队列长度和等待时间的随机提前检测算法。
One however probably can combine this data with device queue sizes and average request execution time to get some decent values.
然而一方面，我们可能可以把这个数据与设备排队尺寸以及平均请求执行时间结合起来以得到一些合适的数值。
The algorithm calculated packet loss rate according to the average queue length and waiting time.
这种算法根据平均队列长度和等待时间计算数据包的丢弃概率。
The average time customers had to wait in the queue before being connected to an agent.
客户在连接到座席之前必须在队列中等待的平均时间。
These queue models are resolved and at the same time the average feedback time of the customers who failed in serving and needed feeding back to be served again is resolved.
在服务失败而需要反馈重新服务的情况下得到了顾客平均反馈次数。
Then, local stochastic strategy modeled to calculate interfering time. In addition, let queue to compute times of interference and average interfering time.
再建立局部随机策略来计算堵塞时间，并应用排队论方法计算堵塞次数和平均堵塞时间。
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.
我们分析了这种模型的嵌入马氏链，并且求出了在稳定状态下各类顾客平均等待时间和平均队长的表达式。
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.
我们分析了这种模型的嵌入马氏链，并且求出了在稳定状态下各类顾客平均等待时间和平均队长的表达式。
应用推荐