Queue maximum proportional fair scheduling for saturated and non-saturated regimes

A new cross-layer proportional fair scheduling algorithm suited for delay tolerant traffic in both saturated and non-saturated regimes is presented. Unlike the classical proportional fair scheduling algorithm where the instantaneous rate is normalized by the past average throughput, in the proposed algorithm the normalization is done with respect to the past maximal values. And unlike cumulative distribution function (CDF) based fair scheduling, the knowledge of the CDF of users´ rates is not required in the proposed solution. In saturated regime, the proposed algorithm outperforms the classical ones. Moreover, in the non-saturated regime it even outperforms the multiuser diversity scheduling in term of spectral efficiency and classical fair schedulers in term of fairness.