一种网络延迟精确控制的调度算法

在网络数据传输调度中，基于最早时限优先（EDF）的算法具有单点最优的延迟界限控制能力。现有的各种EDF改进算法，主要着眼于提供延迟上界的保证能力，而当采用机顶盒之类的缓冲能力较弱的设备作为客户终端时，还需要网络提供精确的延迟下界控制能力。在原有EDF改进算法的基础上提出了精确延迟界控制的最早时限优先算法。该算法不但能同时保证延迟上界和下界，还使得节点可以独立地决定为数据流分配的缓冲区大小，并增加了节点允许抖动量的取值范围，从而提高了节点数据的转发效率。

Scheduling algorithm for precision delay bounds

The scheduling algorithms based on Earliest Deadline First (EDF) have best control capability of delay bounds in packet switch network. Most of variants of EDF concentrate the guarantee of upper delay bounds. For the terminals with poor buffer resources, lower delay bounds also need to be provided by network. A new algorithm, PD EDF, based on some improved EDF algorithms was proposed to provide precision delay bounds. This new algorithm empowers any node to decide the buffer size for data streams independently and improves the data transmitting efficiency of node by increasing the scope of value ε.