Optimizing beyond the carrier by carrier proportional fair scheduler

Alexander X. Han, I. Tai Lu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The multi-carrier proportional fair scheduling (MC-PFS) problem in a multi-user system has been shown to be NP-hard. Carrier by carrier proportional fair scheduling (CC-PFS) is commonly used instead to allocate resources in real-time. Considering the sub-optimal nature of CC-PFS and its popularity, this paper formulates the optimization beyond CC-PFS as a constrained maximum sum rate problem (with users' data rates scheduled by CC-PFS as the constraint) and tackles the problem in two ways. Firstly, the problem is shown to be equivalent to the well-studied generalized assignment problem (GAP) under the assumption of infinitely backlogged data. By considering traffic arrivals, the problem becomes a nonlinear integer programming problem which can be solved by outer approximation (OA) algorithms. Secondly, the problem is shown to be equivalent to a classical trading problem, and a low complexity heuristic algorithm that can be run in real-time is developed based on trading resource blocks (RBs). Using a system scheduling many video call users, we show that in about half of the time slots, the sum rate can be improved over CC-PFS while each user transmits at least as many bits as scheduled by CC-PFS. The heuristic algorithm captures about 30% of the throughput improvement found by OA. Finally, the reason for the improvements over CC-PFS is found to be traffic arrival.

Original languageEnglish (US)
Title of host publication2011 34th IEEE Sarnoff Symposium, SARNOFF 2011
DOIs
StatePublished - 2011
Event2011 34th IEEE Sarnoff Symposium, SARNOFF 2011 - Princeton, NJ, United States
Duration: May 3 2011May 4 2011

Publication series

Name2011 34th IEEE Sarnoff Symposium, SARNOFF 2011

Other

Other2011 34th IEEE Sarnoff Symposium, SARNOFF 2011
CountryUnited States
CityPrinceton, NJ
Period5/3/115/4/11

Keywords

  • CC-PFS
  • GAP
  • MC-PFS
  • OFDMA
  • carrier by carrier
  • multi-carrier
  • multi-user
  • proportional fair
  • trading resource blocks
  • traffic arrival

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Optimizing beyond the carrier by carrier proportional fair scheduler'. Together they form a unique fingerprint.

  • Cite this

    Han, A. X., & Lu, I. T. (2011). Optimizing beyond the carrier by carrier proportional fair scheduler. In 2011 34th IEEE Sarnoff Symposium, SARNOFF 2011 [5876485] (2011 34th IEEE Sarnoff Symposium, SARNOFF 2011). https://doi.org/10.1109/SARNOF.2011.5876485