用于DiffServ的核心无状态的虚拟时钟调度算法

A core stateless virtual clock-based scheduling algorithm applied to DiffServ

提出了一种同时满足对资源进行分配要求和具有良好的可扩展性要求的包调度算法。通过一个基于虚拟时钟的 FIFO 队列来达到公平队列中多个队列的效果,即在不同的流间实现资源的公平分配;同时,由于在核心路由器维持的是一个 FIFO 队列,因此无需进行每流状态的管理和对收到的数据包执行按流分类的工作,这样较之公平队列算法大大地降低了在核心路由器的系统开销,从而满足可扩展性的要求。

A core-stateless virtual clock-based scheduling algorithm was developed, which combined the simplicity and high performance of FIFO and the fair resource allocation of FQ. The basic idea of this algorithm was using virtual clock to compute the anticipated depart time of every packet, and construct a FIFO queue according to the prospect depart time. In other words, using only one FIFO queue to simulate the multi queue in fair queue algorithm. Also because of the only one FIFO queue, which makes it unnecessary for routers to perform per flow state management, thus, scalability is got.