双服务器分组调度算法

分组调度算法对于确保分组交换系统的QoS具有重要意义。时延，公平性，计算复杂度是微量分组度算法的主要指标。本文提出了一种双服务器分组调度算法，该算法在两种不同的工作状态下分别采用两种服务规则决定分组的服务次序。其中一种服务规则用来确保分组的时延，另一种服务规则在时延得到保障的情况下对系统的公平性进行改善，这两种规则计算都不复杂。因此本文提出的算法具有时延低，公平性较好，计算复杂度低的特点。

The bi-server packet scheduling algorithm

The packet scheduling algorithms play an important role in guaranteeing QoS in packet-switched net- works. The properties of the scheduling algorithm are usually in the form of bounds on delay, fairness and com- puting complexity. A new scheduling discipline using hi-server is presented in this paper. The concerned two servers determine the output order of packets in different condition. One server is to guarantee packet delay, the other is to improve fairness when all connections' delay requirements are met. The computing complexity in these two servers is low. So this algorithm has nice performance of delay, fairness and complexity.