Provable fairness for TDMA scheduling

Marcin Bienkowski, Jaroslaw Byrka, Krzysztof Chrobak, Tomasz Jurdzinski, Dariusz Kowalski

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

Abstract

We consider the task of assigning time slots on a user-dependent and time-varying wireless channel. This scheduling problem occurs in cellular networks due to the presence of channel fading and user mobility. We introduce a simple notion of global fairness, where each of n users is guaranteed a 1/(n + ε) fraction of its total possible throughput, for some approximation parameter ε ≥ 0, and study its limitations from theoretical and experimental perspectives. We formally prove that a slight modification of the standard proportional fair algorithm satisfies the global fairness constraint. To the best of our knowledge, this is the first formal analysis providing global fairness property to the channel in any execution and any channel conditions. As confirmed by our simulations, our global fairness constraint is in fact satisfied by a wide class of algorithms. Our framework allows optimization of an arbitrary metric subject to the global fairness constraint. In particular, we have analyzed a variant of the provably fair algorithm that optimizes the total throughput. It turned out that the channel utilization of this algorithm is significantly better than that of the classical Proportional Fair algorithm.

Original languageEnglish (US)
Title of host publication2015 IEEE Conference on Computer Communications, IEEE INFOCOM 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1320-1327
Number of pages8
ISBN (Electronic)9781479983810
DOIs
StatePublished - Aug 21 2015
Externally publishedYes
Event34th IEEE Annual Conference on Computer Communications and Networks, IEEE INFOCOM 2015 - Hong Kong, Hong Kong
Duration: Apr 26 2015May 1 2015

Publication series

NameProceedings - IEEE INFOCOM
Volume26
ISSN (Print)0743-166X

Conference

Conference34th IEEE Annual Conference on Computer Communications and Networks, IEEE INFOCOM 2015
CountryHong Kong
CityHong Kong
Period4/26/155/1/15

Fingerprint

Time division multiple access
Scheduling
Throughput
Fading channels

Keywords

  • fairness
  • Proportional Fair algorithms
  • throughput
  • Wireless channel

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Bienkowski, M., Byrka, J., Chrobak, K., Jurdzinski, T., & Kowalski, D. (2015). Provable fairness for TDMA scheduling. In 2015 IEEE Conference on Computer Communications, IEEE INFOCOM 2015 (pp. 1320-1327). [7218508] (Proceedings - IEEE INFOCOM; Vol. 26). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFOCOM.2015.7218508

Provable fairness for TDMA scheduling. / Bienkowski, Marcin; Byrka, Jaroslaw; Chrobak, Krzysztof; Jurdzinski, Tomasz; Kowalski, Dariusz.

2015 IEEE Conference on Computer Communications, IEEE INFOCOM 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 1320-1327 7218508 (Proceedings - IEEE INFOCOM; Vol. 26).

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

Bienkowski, M, Byrka, J, Chrobak, K, Jurdzinski, T & Kowalski, D 2015, Provable fairness for TDMA scheduling. in 2015 IEEE Conference on Computer Communications, IEEE INFOCOM 2015., 7218508, Proceedings - IEEE INFOCOM, vol. 26, Institute of Electrical and Electronics Engineers Inc., pp. 1320-1327, 34th IEEE Annual Conference on Computer Communications and Networks, IEEE INFOCOM 2015, Hong Kong, Hong Kong, 4/26/15. https://doi.org/10.1109/INFOCOM.2015.7218508
Bienkowski M, Byrka J, Chrobak K, Jurdzinski T, Kowalski D. Provable fairness for TDMA scheduling. In 2015 IEEE Conference on Computer Communications, IEEE INFOCOM 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 1320-1327. 7218508. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2015.7218508
Bienkowski, Marcin ; Byrka, Jaroslaw ; Chrobak, Krzysztof ; Jurdzinski, Tomasz ; Kowalski, Dariusz. / Provable fairness for TDMA scheduling. 2015 IEEE Conference on Computer Communications, IEEE INFOCOM 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 1320-1327 (Proceedings - IEEE INFOCOM).
@inproceedings{52ec82d6bdfe44b1bb5255427dea2e6c,
title = "Provable fairness for TDMA scheduling",
abstract = "We consider the task of assigning time slots on a user-dependent and time-varying wireless channel. This scheduling problem occurs in cellular networks due to the presence of channel fading and user mobility. We introduce a simple notion of global fairness, where each of n users is guaranteed a 1/(n + ε) fraction of its total possible throughput, for some approximation parameter ε ≥ 0, and study its limitations from theoretical and experimental perspectives. We formally prove that a slight modification of the standard proportional fair algorithm satisfies the global fairness constraint. To the best of our knowledge, this is the first formal analysis providing global fairness property to the channel in any execution and any channel conditions. As confirmed by our simulations, our global fairness constraint is in fact satisfied by a wide class of algorithms. Our framework allows optimization of an arbitrary metric subject to the global fairness constraint. In particular, we have analyzed a variant of the provably fair algorithm that optimizes the total throughput. It turned out that the channel utilization of this algorithm is significantly better than that of the classical Proportional Fair algorithm.",
keywords = "fairness, Proportional Fair algorithms, throughput, Wireless channel",
author = "Marcin Bienkowski and Jaroslaw Byrka and Krzysztof Chrobak and Tomasz Jurdzinski and Dariusz Kowalski",
year = "2015",
month = "8",
day = "21",
doi = "10.1109/INFOCOM.2015.7218508",
language = "English (US)",
series = "Proceedings - IEEE INFOCOM",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1320--1327",
booktitle = "2015 IEEE Conference on Computer Communications, IEEE INFOCOM 2015",

}

TY - GEN

T1 - Provable fairness for TDMA scheduling

AU - Bienkowski, Marcin

AU - Byrka, Jaroslaw

AU - Chrobak, Krzysztof

AU - Jurdzinski, Tomasz

AU - Kowalski, Dariusz

PY - 2015/8/21

Y1 - 2015/8/21

N2 - We consider the task of assigning time slots on a user-dependent and time-varying wireless channel. This scheduling problem occurs in cellular networks due to the presence of channel fading and user mobility. We introduce a simple notion of global fairness, where each of n users is guaranteed a 1/(n + ε) fraction of its total possible throughput, for some approximation parameter ε ≥ 0, and study its limitations from theoretical and experimental perspectives. We formally prove that a slight modification of the standard proportional fair algorithm satisfies the global fairness constraint. To the best of our knowledge, this is the first formal analysis providing global fairness property to the channel in any execution and any channel conditions. As confirmed by our simulations, our global fairness constraint is in fact satisfied by a wide class of algorithms. Our framework allows optimization of an arbitrary metric subject to the global fairness constraint. In particular, we have analyzed a variant of the provably fair algorithm that optimizes the total throughput. It turned out that the channel utilization of this algorithm is significantly better than that of the classical Proportional Fair algorithm.

AB - We consider the task of assigning time slots on a user-dependent and time-varying wireless channel. This scheduling problem occurs in cellular networks due to the presence of channel fading and user mobility. We introduce a simple notion of global fairness, where each of n users is guaranteed a 1/(n + ε) fraction of its total possible throughput, for some approximation parameter ε ≥ 0, and study its limitations from theoretical and experimental perspectives. We formally prove that a slight modification of the standard proportional fair algorithm satisfies the global fairness constraint. To the best of our knowledge, this is the first formal analysis providing global fairness property to the channel in any execution and any channel conditions. As confirmed by our simulations, our global fairness constraint is in fact satisfied by a wide class of algorithms. Our framework allows optimization of an arbitrary metric subject to the global fairness constraint. In particular, we have analyzed a variant of the provably fair algorithm that optimizes the total throughput. It turned out that the channel utilization of this algorithm is significantly better than that of the classical Proportional Fair algorithm.

KW - fairness

KW - Proportional Fair algorithms

KW - throughput

KW - Wireless channel

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

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

U2 - 10.1109/INFOCOM.2015.7218508

DO - 10.1109/INFOCOM.2015.7218508

M3 - Conference contribution

AN - SCOPUS:84954499444

T3 - Proceedings - IEEE INFOCOM

SP - 1320

EP - 1327

BT - 2015 IEEE Conference on Computer Communications, IEEE INFOCOM 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -