IEEE Communications Letters · 2006 · 38 citations · 8 references
BusinessComputer ScienceOptimizationQueuing TheorySchedulingPerformance OptimizationResource SchedulingScheduling OptimizationScheduling TheoryFair Resource AllocationFair Resource SharingFair SchedulingFairnessThroughput-aware SchedulingUpper Bound ComputationUpper Bound Performance
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
8
Opportunistic beamforming using dumb antennas
Pramod Viswanath, D.N.C. Tse, R. Laroia · 2003 · 2.2K citations