Approximate projection based global proportional fairness scheduling

Hui Zhou, Pingyi Fan, Khaled Letaief, Xiang Gen Xia

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

3 Citations (Scopus)

Abstract

Nowadays proportional fairness (PF) scheduling has attracted much attention in various wireless systems. But most previous work just considers the systems with only one base station (or data center), which just achieves local PF. In this paper we consider the problem of achieving global PF for the multiple base station multiple user scenario. Compared with previous works in the literature, the main contributions of this paper are threefold: (1) The PF rule is employed in the multiple base station multiple user case. Here we propose an approximate gradient projection based PF scheduling scheme, GP-PF, to approach the global PF optimality. And the convergence of the proposed algorithm is proved. (2) We study the communication and computation complexity of GP-PF and show that the developed GP-PF algorithm can be implemented either in a user selection mode, or in a random accessing way. And GP-PF applies to distributed systems in the sense that it does not need any inter base station cooperation at all. (3) By simulation, it is shown that global PF leads to higher throughput and greater fairness for users than local PF.

Original languageEnglish
Title of host publication2010 IEEE International Conference on Communications, ICC 2010
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event2010 IEEE International Conference on Communications, ICC 2010 - Cape Town, South Africa
Duration: 23 May 201027 May 2010

Other

Other2010 IEEE International Conference on Communications, ICC 2010
CountrySouth Africa
CityCape Town
Period23/5/1027/5/10

Fingerprint

Base stations
Scheduling
Throughput
Communication

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Zhou, H., Fan, P., Letaief, K., & Xia, X. G. (2010). Approximate projection based global proportional fairness scheduling. In 2010 IEEE International Conference on Communications, ICC 2010 [5502829] https://doi.org/10.1109/ICC.2010.5502829

Approximate projection based global proportional fairness scheduling. / Zhou, Hui; Fan, Pingyi; Letaief, Khaled; Xia, Xiang Gen.

2010 IEEE International Conference on Communications, ICC 2010. 2010. 5502829.

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

Zhou, H, Fan, P, Letaief, K & Xia, XG 2010, Approximate projection based global proportional fairness scheduling. in 2010 IEEE International Conference on Communications, ICC 2010., 5502829, 2010 IEEE International Conference on Communications, ICC 2010, Cape Town, South Africa, 23/5/10. https://doi.org/10.1109/ICC.2010.5502829
Zhou H, Fan P, Letaief K, Xia XG. Approximate projection based global proportional fairness scheduling. In 2010 IEEE International Conference on Communications, ICC 2010. 2010. 5502829 https://doi.org/10.1109/ICC.2010.5502829
Zhou, Hui ; Fan, Pingyi ; Letaief, Khaled ; Xia, Xiang Gen. / Approximate projection based global proportional fairness scheduling. 2010 IEEE International Conference on Communications, ICC 2010. 2010.
@inproceedings{ca6c4d86756b45dda8ddf2f8e6e70a48,
title = "Approximate projection based global proportional fairness scheduling",
abstract = "Nowadays proportional fairness (PF) scheduling has attracted much attention in various wireless systems. But most previous work just considers the systems with only one base station (or data center), which just achieves local PF. In this paper we consider the problem of achieving global PF for the multiple base station multiple user scenario. Compared with previous works in the literature, the main contributions of this paper are threefold: (1) The PF rule is employed in the multiple base station multiple user case. Here we propose an approximate gradient projection based PF scheduling scheme, GP-PF, to approach the global PF optimality. And the convergence of the proposed algorithm is proved. (2) We study the communication and computation complexity of GP-PF and show that the developed GP-PF algorithm can be implemented either in a user selection mode, or in a random accessing way. And GP-PF applies to distributed systems in the sense that it does not need any inter base station cooperation at all. (3) By simulation, it is shown that global PF leads to higher throughput and greater fairness for users than local PF.",
author = "Hui Zhou and Pingyi Fan and Khaled Letaief and Xia, {Xiang Gen}",
year = "2010",
doi = "10.1109/ICC.2010.5502829",
language = "English",
isbn = "9781424464043",
booktitle = "2010 IEEE International Conference on Communications, ICC 2010",

}

TY - GEN

T1 - Approximate projection based global proportional fairness scheduling

AU - Zhou, Hui

AU - Fan, Pingyi

AU - Letaief, Khaled

AU - Xia, Xiang Gen

PY - 2010

Y1 - 2010

N2 - Nowadays proportional fairness (PF) scheduling has attracted much attention in various wireless systems. But most previous work just considers the systems with only one base station (or data center), which just achieves local PF. In this paper we consider the problem of achieving global PF for the multiple base station multiple user scenario. Compared with previous works in the literature, the main contributions of this paper are threefold: (1) The PF rule is employed in the multiple base station multiple user case. Here we propose an approximate gradient projection based PF scheduling scheme, GP-PF, to approach the global PF optimality. And the convergence of the proposed algorithm is proved. (2) We study the communication and computation complexity of GP-PF and show that the developed GP-PF algorithm can be implemented either in a user selection mode, or in a random accessing way. And GP-PF applies to distributed systems in the sense that it does not need any inter base station cooperation at all. (3) By simulation, it is shown that global PF leads to higher throughput and greater fairness for users than local PF.

AB - Nowadays proportional fairness (PF) scheduling has attracted much attention in various wireless systems. But most previous work just considers the systems with only one base station (or data center), which just achieves local PF. In this paper we consider the problem of achieving global PF for the multiple base station multiple user scenario. Compared with previous works in the literature, the main contributions of this paper are threefold: (1) The PF rule is employed in the multiple base station multiple user case. Here we propose an approximate gradient projection based PF scheduling scheme, GP-PF, to approach the global PF optimality. And the convergence of the proposed algorithm is proved. (2) We study the communication and computation complexity of GP-PF and show that the developed GP-PF algorithm can be implemented either in a user selection mode, or in a random accessing way. And GP-PF applies to distributed systems in the sense that it does not need any inter base station cooperation at all. (3) By simulation, it is shown that global PF leads to higher throughput and greater fairness for users than local PF.

UR - http://www.scopus.com/inward/record.url?scp=77955400050&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955400050&partnerID=8YFLogxK

U2 - 10.1109/ICC.2010.5502829

DO - 10.1109/ICC.2010.5502829

M3 - Conference contribution

AN - SCOPUS:77955400050

SN - 9781424464043

BT - 2010 IEEE International Conference on Communications, ICC 2010

ER -