A Novel AOS Virtual Channels Scheduling Algorithm Based on Frame Urgency

We propose a novel AOS virtual channels scheduling algorithm based on frame urgency. Compared to the conventional scheduling algorithms, the proposed algorithm considers not only the time that frames have been waiting for in virtual channel buffers, but also the maximum time delay that the scheduling module allowed. Frame Urgency is then defined as the difference of the two factors multiplies the priority of the virtual channel. At any scheduling time point, Frame which is of the highest urgency is transmitted. Experiments show that the proposed algorithm outperforms the conventional algorithm greatly, and it is more fit for diverse data transmission over space links.