加权公平队列 meaning in English
wfq weighted fair queueing
Examples
- In ad hoc , based on dcf ( distributed coordination function ) of ieee 802 . 11 , this paper introduces a new mac , which divides the packet into three kinds : non - periodic real - time information , periodic real time information , and non real - time information . the priority of these three information packets demotes in turn
针对交换式以太网qos实现问题，按照网络流量分配优先级、实时性信息分配较高优先级的原则，本文提出考虑优先级的加权公平队列算法( wfqp ) ，即对交换机的数据流进行调度处理，降低实时信息的端到端延迟，从而有效提高实时信息的传输质量。 - Although the congestion control research of host - ends has made great strides , the current queue management mechanism in router is not able to provide end - to - end congestion control mechanism to sustain the above environment , namely , the unfairness of assigned bandwidth or drop - rate for different types of flows and the synchronization of all tcp flows in network . so it is necessary to improve the classical queue management mecnanism such as drop _ tail and red in order to boost the qos ( quality of service ) . this article analyzes the main traits of host - ends congestion control and all kinds of fashionable queue management machanism , which include queue mechanism with absolute priority , weighted fair queue mechanism and class - based queue mechanism
本文分析了主机端的拥塞控制机制和网络中路由器的现有各种队列管理机制：绝对优先级队列机制、加权公平队列( weightedfairqueue ) [ 1 ]机制、基于类的队列( class - basedqueue ) [ 2 ]机制以及red ( randomearlydetection ) [ 3 ]机制的主要特点，并重点针对ietf ( internetengineeringtaskforce )推荐的把red算法与明确的拥塞通告ecn ( explicitcongestionnotification ) [ 4 ]结合的方法进行了分析，发现随着internet流量的日益递增， red机制的依赖平均队列长度来管理拥塞控制的算法并不能有效地阻止包丢失：与drop - tail相比， red确实消除了对阵发流量( tcp )的偏见，但是增加了平滑流量( udp )的丢包概率。