FRR: a proportional and worst-case fair round robin scheduler

In this paper, we propose an O(1) complexity round robin scheduler, called fair round robin (FRR), that provides good fairness and delay properties. Unlike existing O(1) complexity round robin schedulers that can only achieve long term fairness, FRR not only provides proportional fairness, but also maintains a constant normalized worst-case fair index as defined in Bennett and Zhang´s work. This means that FRR guarantees both short term and long term fairness among all backlogged flows.