Consideration for per-flow queuing and scheduling algorithms

Zhenming Lei · Journal of Chongqing University of Posts and Telecommunications · 2004

Queue scheduling and queue management are the most important functional parts in packet processing under integrated service, but much work has been paid to the performance improvement for scheduling recently while few has been done on per-flow queue management. In this paper, we take the packet processing as a whole, and develop an effective per-flow queue management scheme PRED (potential-based RED) based on the implementation of SPFQ(starting potential-based fair queueing). Through rigid simulations, we find such a combination of PRED-SPFQ exhibits much better performance in fairness and stability for the whole packet processing than other combinations.

Read the paper · More papers on PaperTik