该队列长度的活动增加与规模的缩小，大部分资源。
The queue length of activities increased with the reduction in the size of most resources.
呼入连接指令(连接请求)的最大队列长度为50。
The maximum queue length for incoming connection indications (a request to connect) is set to 50.
既然队列长度并不那么重要，这也就不算很长的延迟。
Since queue lengths were not that significant that is not much delay.
提出了一个基于平均队列长度改变速率RED的增强算法。
A method based on the change rate of average queue length to enhance RED is proposed.
创建服务器套接字并绑定在指定端口，使用指定的队列长度。
Creates a server socket and binds it to the specified local port number, with the specified backlog.
这种算法根据平均队列长度和等待时间计算数据包的丢弃概率。
The algorithm calculated packet loss rate according to the average queue length and waiting time.
如果平均磁盘等待队列长度多于磁盘头数量的两倍，则磁盘成为瓶颈。
If the average disk-waiting queue length is more than two times the number of disk heads, there is a bottleneck on the disk.
模型的核心是使节点的队列长度与成正比（为节点的度，为分配参数）。
The core of this model is to make the queue length of node proportional to ( is the degree of node and is an allocation parameter).
该算法通过节点最短队列长度，把网络层、MAC层和物理层协同起来。
It is based on the shortest queue length of nodes and designed by crossing network layer, MAC layer and physical layer.
项目的期限，期间的资源利用，以及队列长度的活动等待服务也报道了。
The duration of the project, the period of utilization of the resources, and the queue length of activities waiting for service are also reported in this paper.
重点在减小任务完成时间的波动等方面，给出了减小队列长度的改进方法。
The improvement method for reduction of queue length was presented with emphasis on reducing the fluctuation of task completion time.
PI算法是基于控制论的主动队列管理算法，具有队列长度抖动小的特点。
PI is the AQM algorithm cased on control theory and has smaller queue length oscillation than RED.
利用M/G/1/K排队模型分析弹性分组环中各类业务缓存中的分组队列长度。
This paper uses M/G/1/K model to analyze the length of RPR queue systems.
然而这种算法使得平均队列长度对于网络的拥塞水平以及RED参数设置非常敏感。
However, the resulting average queue length is quite sensitive to the level of congestion and to the parameter Settings of RED.
它已经表明，在减少尺寸的资源是可以做到在不增加项目的期限和队列长度的活动。
It has been shown that reduction in size of resources is achievable without increasing the duration of the project and queue length of activities.
使用新的负载向量与使用传统的CPU队列长度负载向量相比，系统性能提高近30%。
Using new load index improved system performance approaching 30% compared to using length of CPU queue as load index.
当大小的一个资源被减少到低于最优，队列长度的活动在等待的资源增加，如表3所示。
When the size of a resource was reduced below optimal, the queue length of activities waiting for the resources increased as shown in Table 3.
根据服务时间的分布不同，用排队论的方法分析了系统中包数的分布和队列长度的分布。
Based service time distribution difference, we obtain distribution of packet number and queue of frame in system through queue theory.
在无线通信网络环境下，提出了一种改进的基于平均队列长度和等待时间的随机提前检测算法。
Under the wireless communication network environment, based on the average queue length and waiting time, an improved Random Early Detection (RED) algorithm is proposed.
这种算法根据缓冲区队列长度来调整流媒体的发送速率，有效地避免了拥塞，提高了网络的利用率。
It adjusts streaming media traffic sources' data sending rate by using queues of router. It can effectively prevent congestion and improve the utilization percent of network.
该方法结合随机早探测(RED)算法，通过ARQ发送窗口和分割队列长度以及重传率进行拥塞控制。
According to RED (Random Early Detection) algorithm, this method controls the congestion through the ARQ sending window, the length of segmentation queue and the link-layer retransmission rate.
该协议根据各节点内实时队列长度动态的控制轮询过程，每个轮询周期对具有最长队列的节点进行服务。
This protocol adaptively controls the polling process according to the real-time queue length of each stations and serves the one with the longest queue firstly in each polling cycle.
通过仿真研究表明，自适应控制器能够很好的进行参数调整，并且使网络系统的队列长度保持在平衡点附近。
During the simulation, the adaptive controller parameters can be adjusted well and the queue length of network system can be maintained at equilibrium point.
它不是使用平均队列长度指示缓冲区拥塞状态，而是使用数据报丢弃的频率和队列空闲程度来管理网络拥塞。
It uses packet loss and link utilization history to indicate the congestion, and not relies on average queue length as an estimator of congestion.
请求处理时间和队列长度是一个很好的度量指标，系统管理员通过监控它们来决定是增加服务器，还是关掉多余的服务器。
The request-processing time and the queue length are proper measures for the system administrator to monitor in order to make decisions about adding servers or shutting down superfluous servers.
如果现在运行的服务器超过一个，而队列长度小于5，那么这个脚本就需要进行更多的检查，以决定它是否应该停止一个实例。
If there is more than one server running and the queue is less than 5, the script does some more checking to see if it should terminate an instance.
针对网络模型的不确定性和参数的时变性，该文提出了一种基于输入速率和队列长度变化的模糊控制主动队列管理算法。
Considering the uncertainty of network model and time variability of network parameters, a fuzzy control active queue management algorithm based on input rate and queue variance is proposed.
AQM是指根据队列长度的变化进行提前丢包，对网络拥塞进行早期通告，从而达到减少和避免网络拥塞，提高服务质量。
Active Queue Management (AQM) are algorithms that drop packets and notify congestion in advance to reduce and avoid congestion, increase QOS of Network.
基于上述情况提出一种基于增加部分用户的等待时间从而降低系统中用户的平均等待时间进而缩短系统队列长度的调度算法。
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.
随机早检测算法通过计算TCP流的平均队列长度，进行适当的概率丢弃分组，从而有效地避免了由TCP流导致的网络拥塞。
Through calculating the average queue size, Random Early Detection (RED) algorithm can drop packets with relevant probability, so congestion resulted from TCP flows can be avoided.
应用推荐