A distributed pricing algorithm for achieving network-wide proportional fairness

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

Research output: Contribution to journalArticle

Abstract

Proportional fairness (PF) scheduling achieves a balanced tradeoff between throughput and fairness and has attracted great attention recently. However, most previous work on PF only considers the single cell scenario. This paper focuses on the problem of achieving network-wide PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using the dual method. By decomposing the dual objective function, we get a distributed pricing based algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still apply in the presence of time-varying rates. 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 the proposed distributed network-wide PF scheduling algorithm achieves almost the same performance as the centralized one. Compared with traditional local PF (LPF) scheduling, the network-wide PF scheduling achieves higher throughput, lower throughput oscillation, and greater fairness.

Original languageEnglish
Pages (from-to)1338-1350
Number of pages13
JournalWireless Communications and Mobile Computing
Volume12
Issue number15
DOIs
Publication statusPublished - 25 Oct 2012
Externally publishedYes

Fingerprint

Scheduling
Throughput
Base stations
Costs
Scheduling algorithms
Communication

Keywords

  • distributed algorithm
  • pricing
  • proportional fairness
  • scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Information Systems

Cite this

A distributed pricing algorithm for achieving network-wide proportional fairness. / Zhou, Hui; Fan, Pingyi; Xia, Xiang Gen; Letaief, Khaled.

In: Wireless Communications and Mobile Computing, Vol. 12, No. 15, 25.10.2012, p. 1338-1350.

Research output: Contribution to journalArticle

@article{061af49c4eaf41c690ca6615a0d0ca73,
title = "A distributed pricing algorithm for achieving network-wide proportional fairness",
abstract = "Proportional fairness (PF) scheduling achieves a balanced tradeoff between throughput and fairness and has attracted great attention recently. However, most previous work on PF only considers the single cell scenario. This paper focuses on the problem of achieving network-wide PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using the dual method. By decomposing the dual objective function, we get a distributed pricing based algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still apply in the presence of time-varying rates. 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 the proposed distributed network-wide PF scheduling algorithm achieves almost the same performance as the centralized one. Compared with traditional local PF (LPF) scheduling, the network-wide PF scheduling achieves higher throughput, lower throughput oscillation, and greater fairness.",
keywords = "distributed algorithm, pricing, proportional fairness, scheduling",
author = "Hui Zhou and Pingyi Fan and Xia, {Xiang Gen} and Khaled Letaief",
year = "2012",
month = "10",
day = "25",
doi = "10.1002/wcm.1062",
language = "English",
volume = "12",
pages = "1338--1350",
journal = "Wireless Communications and Mobile Computing",
issn = "1530-8669",
publisher = "John Wiley and Sons Ltd",
number = "15",

}

TY - JOUR

T1 - A distributed pricing algorithm for achieving network-wide proportional fairness

AU - Zhou, Hui

AU - Fan, Pingyi

AU - Xia, Xiang Gen

AU - Letaief, Khaled

PY - 2012/10/25

Y1 - 2012/10/25

N2 - Proportional fairness (PF) scheduling achieves a balanced tradeoff between throughput and fairness and has attracted great attention recently. However, most previous work on PF only considers the single cell scenario. This paper focuses on the problem of achieving network-wide PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using the dual method. By decomposing the dual objective function, we get a distributed pricing based algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still apply in the presence of time-varying rates. 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 the proposed distributed network-wide PF scheduling algorithm achieves almost the same performance as the centralized one. Compared with traditional local PF (LPF) scheduling, the network-wide 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 work on PF only considers the single cell scenario. This paper focuses on the problem of achieving network-wide PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using the dual method. By decomposing the dual objective function, we get a distributed pricing based algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still apply in the presence of time-varying rates. 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 the proposed distributed network-wide PF scheduling algorithm achieves almost the same performance as the centralized one. Compared with traditional local PF (LPF) scheduling, the network-wide PF scheduling achieves higher throughput, lower throughput oscillation, and greater fairness.

KW - distributed algorithm

KW - pricing

KW - proportional fairness

KW - scheduling

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

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

U2 - 10.1002/wcm.1062

DO - 10.1002/wcm.1062

M3 - Article

AN - SCOPUS:84866431361

VL - 12

SP - 1338

EP - 1350

JO - Wireless Communications and Mobile Computing

JF - Wireless Communications and Mobile Computing

SN - 1530-8669

IS - 15

ER -