首先介绍了队列调度算法在流量控制中的关键地位,然后讨论了现有队列调度算法,如基于优先级的调度算法、轮询调度算法与公平队列调度算法,最后提出了一种新的队列规程,该队列规程融合了优先级调度算法与DRR调度算法。在网络正常情况下,不同业务流公平地共享网络带宽,在网络出现拥塞的情况下,高优先级业务流能够抢占带宽,保证其较低的丢包率,并能够实现两种调度算法的快速切换。
The critical role of the existing queue scheduling algorithms in flow control is described, and these algorithms includes priority-based scheduling algorithm, round-robin scheduling algorithm and fair queuing scheduling algorithm, and then a new queuing discipline in combination of PQ algorithm with DRR algorithm is proposed. Under normal circumstances, different streams fairly share the network bandwidth, and when the network is congested, the streams with higher priority could preocoupy the bandwidth, thus to ensure comparatively lower loss rate, and to achieve fast switch of these two scheduling algorithms.