In PSPF algorithm, the short packet can preempt the transmission time of the long packet and be served first.
在PSPF算法中，短包可以抢占长包的传输时间而获得优先服务。
When the cells with different priorities compete for resources, the cells with high priority should be served first, and the cells with low priority should wait in the buffer.
当不同优先级的信元在争抢资源时，应该保证优先级高的信元先得到服务，优先级低的信元在缓冲器中等待。
When the cells with different priorities compete for resources, the cells with high priority should be served first, and the cells with low priority should wait in the buffer.
当不同优先级的信元在争抢资源时，应该保证优先级高的信元先得到服务，优先级低的信元在缓冲器中等待。
应用推荐