On the performance of back-pressure scheduling schemes with logarithmic weight

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


Recently, significant advances have been made in wireless scheduling toward high-performance networks, leading to development of throughput-optimal scheduling schemes. Beyond throughput performance, however, scheduling with good delay performance has remained open except for a small class of network systems. In this paper, we extend the well-known back-pressure scheduling scheme by using logarithmic weight and improve the delay performance without any loss of throughput performance under multi-hop traffic. We provide rigorous analysis for throughput performance of the proposed solution, and evaluate delay performance through simulations.

Original languageEnglish
Article number6015600
Pages (from-to)3632-3637
Number of pages6
JournalIEEE Transactions on Wireless Communications
Issue number11
Publication statusPublished - 2011 Nov
Externally publishedYes

Bibliographical note

Funding Information:
Manuscript received January 29, 2011; revised April 22, 2011; accepted July 12, 2011. The associate editor coordinating the review of this letter and approving it for publication was S. Liew. C. Joo is with the School of Electrical and Computer Engineering, UNIST, Ulsan, Korea (e-mail: changheejoo@gmail.com). This work was in part supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF), funded by the Ministry of Education, Science, and Technology (No. 2011-0008549). Digital Object Identifier 10.1109/TWC.2011.083111.110194


  • Back-pressure scheduling
  • delay performance
  • logarithmic weight
  • max weight scheduling
  • multi-hop traffic

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'On the performance of back-pressure scheduling schemes with logarithmic weight'. Together they form a unique fingerprint.

Cite this