The urgency-based round robin algorithm tries to select the most need packets to be served in the multimedia streams or queues.
基于紧急度的分组调度算法尽可能选出当前各流中最需要被服务的队列。
In PSPF algorithm, the short packet can preempt the transmission time of the long packet and be served first.
在PS PF算法中，短包可以抢占长包的传输时间而获得优先服务。
应用推荐