A Computationally Efficient Scheduling Algorithm Capable of Controlling Throughput-Fairness Tradeoff 


Vol. 35,  No. 2, pp. 121-127, Feb.  2010


PDF
  Abstract

In this paper, we propose a computationally efficient scheduling algorithm that can arbitrarily control the throughput-fairness tradeoff in a multiuser wireless communication environment. As a new scheduling criterion, we combine linearly two well-known scheduling criteria such as one of achieving the maximum sum throughput and the other of achieving the maximum fairness, so as to control the relative proportion of the throughput and the fairness according to a control factor. For linear combining two different criteria, their optimization directivenesses and the units should be unified first. To meet these requirements, we choose an instantaneous channel capacity as a scheduling criterion for maximizing the sum throughput and the average serving throughput for maximizing the fairness. Through a unified linear combining of two optimization objectives with the control factor, it can provide various throughput-fairness tradeoffs according to the control factors. For further simplification, we exploit a high signal-to-noise ratio (SNR) approximation of the instantaneous channel capacity. Through computer simulations, we evaluate the throughput and fairness performances of the proposed algorithm according to the control factors, assuming an independent Rayleigh fading multiuser channel. We also evaluate the proposed algorithm employing the high SNR approximation. From simulation results, we could see that the proposed algorithm can control arbitrarily the throughput-fairness performance between the performance of the scheduler aiming to the maximum sum throughput and that of the scheduler aiming to the maximum fairness. Finally, we see that the high SNR approximation can give a satisfactory performance in this situation.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Lee and S. K. Oh, "A Computationally Efficient Scheduling Algorithm Capable of Controlling Throughput-Fairness Tradeoff," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 2, pp. 121-127, 2010. DOI: .

[ACM Style]

Min Lee and Seong Keun Oh. 2010. A Computationally Efficient Scheduling Algorithm Capable of Controlling Throughput-Fairness Tradeoff. The Journal of Korean Institute of Communications and Information Sciences, 35, 2, (2010), 121-127. DOI: .

[KICS Style]

Min Lee and Seong Keun Oh, "A Computationally Efficient Scheduling Algorithm Capable of Controlling Throughput-Fairness Tradeoff," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 2, pp. 121-127, 2. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880