In this paper, we propose an efficient and simple fair
queuing algorithm, called new starting potential fair
queuing (NSPFQ), which has O(1) complexity for virtual
time computation and also has good delay and fairness
properties. NSPFQ introduces a si...
In this paper, we propose an efficient and simple fair
queuing algorithm, called new starting potential fair
queuing (NSPFQ), which has O(1) complexity for virtual
time computation and also has good delay and fairness
properties. NSPFQ introduces a simpler virtual time
recalibration method as it follows a rate-proportional
property. The NSPFQ algorithm recalibrates the system
virtual time to the minimum virtual start time among all
possible virtual start times for head-of-line packets in
backlogged sessions. Through analysis and simulation, we
show that the proposed algorithm has good delay and
fairness properties. We also propose a hardware
implementation framework for the scheduling algorithm.