Proportional fairness in multi-carrier system: upper bound and approximation algorithms

Megumi Kaneko, Petar Popovski, Joachim Dahl

IEEE Communications Letters · 2006 · 38 citations · 8 references

Concepts

Abstract

The solution for the optimal multi-carrier (MC) proportional fair scheduling (PFS) is prohibitively complex to obtain. In this letter we obtain an upper bound on the achievable proportional fairness (PF) performance in the case of finite PFS window size. Next, three approximation algorithms are proposed. The first one is computationally complex, but achieves near-optimal PF. The two others achieve a good tradeoff between throughput and PF with low complexity

References

8