Theoretical analysis of PF scheduling with bursty traffic model in OFDMA systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review


  • Guowei Zhang
  • Jing Xu
  • Ligang Liu
  • Yang Yang
  • Qiang Li
  • Matti Hamalainen

Research units

  • Chinese Academy of Sciences


Existing researches on the theoretical analysis for Proportional Fair (PF) scheduling are mostly based on the full buffer assumption while the user always has a bursty traffic in reality. In this paper, an analytical framework for PF scheduling in an Orthogonal Frequency Division Multiple Access (OFDMA) wireless network is proposed, and the user traffic is set to follow a poisson arrival process. Detailed analysis for each user's Resource Block (RB) competition status is carried out, and an M/M/1 queuing model is adopted for the packet transmission process of each user, with which the analytical expressions for user throughput and packet latency are obtained. Simulation in a single-cell OFDMA network is carried out and the comparision between simulation and analysis results confirms the accuracy of our analysis.


Original languageEnglish
Title of host publication2017 IEEE International Conference on Communications, ICC 2017
Publication statusPublished - 28 Jul 2017
MoE publication typeA4 Article in a conference publication
EventIEEE International Conference on Communications - Paris, France
Duration: 21 May 201725 May 2017


ConferenceIEEE International Conference on Communications
Abbreviated titleICC

    Research areas

  • Bursty traffic, Orthogonal Frequency Division Multiple Access (OFDMA), Packet latency, Proportional fair (PF) scheduling

ID: 16820383