Achieving network wide proportional fairness

A pricing method

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

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

1 Citation (Scopus)

Abstract

Proportional fairness (PF) scheduling achieves a balanced tradeoff between throughput and fairness and has attracted great attention recently. However, most previous works on PF only consider the single cell scenario. This paper focuses on the problem of achieving global PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using dual method. By decomposing the dual objective function, we get a pricing based PF algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still achieve network wide PF in the presence of time varying rates. We show that the proposed algorithm is suitable for distributed systems in the sense that it does not need any inter base station communication at all. Simulations illustrate that compared with traditional local PF scheduling, global PF scheduling achieves higher throughput, lower throughput oscillation and greater fairness.

Original languageEnglish
Title of host publication2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings
DOIs
Publication statusPublished - 2010
Externally publishedYes
EventIEEE Wireless Communications and Networking Conference 2010, WCNC 2010 - Sydney, NSW, Australia
Duration: 18 Apr 201021 Apr 2010

Other

OtherIEEE Wireless Communications and Networking Conference 2010, WCNC 2010
CountryAustralia
CitySydney, NSW
Period18/4/1021/4/10

Fingerprint

Scheduling
Throughput
Base stations
Costs
Communication

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Zhou, H., Fan, P., Xia, N. G., & Letaief, K. (2010). Achieving network wide proportional fairness: A pricing method. In 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings [5506472] https://doi.org/10.1109/WCNC.2010.5506472

Achieving network wide proportional fairness : A pricing method. / Zhou, Hui; Fan, Pingyi; Xia, Ng Gen; Letaief, Khaled.

2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings. 2010. 5506472.

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

Zhou, H, Fan, P, Xia, NG & Letaief, K 2010, Achieving network wide proportional fairness: A pricing method. in 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings., 5506472, IEEE Wireless Communications and Networking Conference 2010, WCNC 2010, Sydney, NSW, Australia, 18/4/10. https://doi.org/10.1109/WCNC.2010.5506472
Zhou H, Fan P, Xia NG, Letaief K. Achieving network wide proportional fairness: A pricing method. In 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings. 2010. 5506472 https://doi.org/10.1109/WCNC.2010.5506472
Zhou, Hui ; Fan, Pingyi ; Xia, Ng Gen ; Letaief, Khaled. / Achieving network wide proportional fairness : A pricing method. 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings. 2010.
@inproceedings{b13a8ea28774401fb0dcad1b528dd0ff,
title = "Achieving network wide proportional fairness: A pricing method",
abstract = "Proportional fairness (PF) scheduling achieves a balanced tradeoff between throughput and fairness and has attracted great attention recently. However, most previous works on PF only consider the single cell scenario. This paper focuses on the problem of achieving global PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using dual method. By decomposing the dual objective function, we get a pricing based PF algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still achieve network wide PF in the presence of time varying rates. We show that the proposed algorithm is suitable for distributed systems in the sense that it does not need any inter base station communication at all. Simulations illustrate that compared with traditional local PF scheduling, global PF scheduling achieves higher throughput, lower throughput oscillation and greater fairness.",
author = "Hui Zhou and Pingyi Fan and Xia, {Ng Gen} and Khaled Letaief",
year = "2010",
doi = "10.1109/WCNC.2010.5506472",
language = "English",
isbn = "9781424463985",
booktitle = "2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings",

}

TY - GEN

T1 - Achieving network wide proportional fairness

T2 - A pricing method

AU - Zhou, Hui

AU - Fan, Pingyi

AU - Xia, Ng Gen

AU - Letaief, Khaled

PY - 2010

Y1 - 2010

N2 - Proportional fairness (PF) scheduling achieves a balanced tradeoff between throughput and fairness and has attracted great attention recently. However, most previous works on PF only consider the single cell scenario. This paper focuses on the problem of achieving global PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using dual method. By decomposing the dual objective function, we get a pricing based PF algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still achieve network wide PF in the presence of time varying rates. We show that the proposed algorithm is suitable for distributed systems in the sense that it does not need any inter base station communication at all. Simulations illustrate that compared with traditional local PF scheduling, global PF scheduling achieves higher throughput, lower throughput oscillation and greater fairness.

AB - Proportional fairness (PF) scheduling achieves a balanced tradeoff between throughput and fairness and has attracted great attention recently. However, most previous works on PF only consider the single cell scenario. This paper focuses on the problem of achieving global PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using dual method. By decomposing the dual objective function, we get a pricing based PF algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still achieve network wide PF in the presence of time varying rates. We show that the proposed algorithm is suitable for distributed systems in the sense that it does not need any inter base station communication at all. Simulations illustrate that compared with traditional local PF scheduling, global PF scheduling achieves higher throughput, lower throughput oscillation and greater fairness.

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

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

U2 - 10.1109/WCNC.2010.5506472

DO - 10.1109/WCNC.2010.5506472

M3 - Conference contribution

SN - 9781424463985

BT - 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings

ER -