State-dependent proportional fair scheduling algorithms for wireless forward link data services

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

6 Citations (Scopus)

Abstract

For wireless forward link data services, the proportional fair algorithm (PFA) incorporating opportunistic scheduling was originally designed to maintain service fairness among users as well as to exploit channel fluctuations in fading environments. The operation of PFA necessitates throughput monitoring for each user, in general through exponentially smoothing received services. In the paper, we adapt the PFA for use in more generic traffic conditions where the number of active users may change with time and data for a user may arrive intermittently. Our approach is not only to simply stop throughput monitoring for idle users but also to further accommodate in throughput monitoring changes in the number of active users. Moreover, we use in throughput monitoring different smoothing factors depending on the state of backlogged data loads, in order to exploit the variation of multiuser diversity gain. Consequently, our PFA, taking into account both channel state and system queue fluctuations, presents several favorable performance features.

Original languageEnglish
Title of host publicationINFOCOM 2008
Subtitle of host publication27th IEEE Communications Society Conference on Computer Communications
Pages331-335
Number of pages5
DOIs
Publication statusPublished - 2008 Sep 15
EventINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications - Phoenix, AZ, United States
Duration: 2008 Apr 132008 Apr 18

Publication series

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

Other

OtherINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
CountryUnited States
CityPhoenix, AZ
Period08/4/1308/4/18

Fingerprint

Scheduling algorithms
Telecommunication links
Throughput
Monitoring
Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Tsai, J. T. (2008). State-dependent proportional fair scheduling algorithms for wireless forward link data services. In INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications (pp. 331-335). [4509906] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2007.311

State-dependent proportional fair scheduling algorithms for wireless forward link data services. / Tsai, Jung Tsung.

INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications. 2008. p. 331-335 4509906 (Proceedings - IEEE INFOCOM).

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

Tsai, JT 2008, State-dependent proportional fair scheduling algorithms for wireless forward link data services. in INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications., 4509906, Proceedings - IEEE INFOCOM, pp. 331-335, INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications, Phoenix, AZ, United States, 08/4/13. https://doi.org/10.1109/INFOCOM.2007.311
Tsai JT. State-dependent proportional fair scheduling algorithms for wireless forward link data services. In INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications. 2008. p. 331-335. 4509906. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2007.311
Tsai, Jung Tsung. / State-dependent proportional fair scheduling algorithms for wireless forward link data services. INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications. 2008. pp. 331-335 (Proceedings - IEEE INFOCOM).
@inproceedings{d128c35377e640ccb64230049d44ffe7,
title = "State-dependent proportional fair scheduling algorithms for wireless forward link data services",
abstract = "For wireless forward link data services, the proportional fair algorithm (PFA) incorporating opportunistic scheduling was originally designed to maintain service fairness among users as well as to exploit channel fluctuations in fading environments. The operation of PFA necessitates throughput monitoring for each user, in general through exponentially smoothing received services. In the paper, we adapt the PFA for use in more generic traffic conditions where the number of active users may change with time and data for a user may arrive intermittently. Our approach is not only to simply stop throughput monitoring for idle users but also to further accommodate in throughput monitoring changes in the number of active users. Moreover, we use in throughput monitoring different smoothing factors depending on the state of backlogged data loads, in order to exploit the variation of multiuser diversity gain. Consequently, our PFA, taking into account both channel state and system queue fluctuations, presents several favorable performance features.",
author = "Tsai, {Jung Tsung}",
year = "2008",
month = "9",
day = "15",
doi = "10.1109/INFOCOM.2007.311",
language = "English",
isbn = "9781424420261",
series = "Proceedings - IEEE INFOCOM",
pages = "331--335",
booktitle = "INFOCOM 2008",

}

TY - GEN

T1 - State-dependent proportional fair scheduling algorithms for wireless forward link data services

AU - Tsai, Jung Tsung

PY - 2008/9/15

Y1 - 2008/9/15

N2 - For wireless forward link data services, the proportional fair algorithm (PFA) incorporating opportunistic scheduling was originally designed to maintain service fairness among users as well as to exploit channel fluctuations in fading environments. The operation of PFA necessitates throughput monitoring for each user, in general through exponentially smoothing received services. In the paper, we adapt the PFA for use in more generic traffic conditions where the number of active users may change with time and data for a user may arrive intermittently. Our approach is not only to simply stop throughput monitoring for idle users but also to further accommodate in throughput monitoring changes in the number of active users. Moreover, we use in throughput monitoring different smoothing factors depending on the state of backlogged data loads, in order to exploit the variation of multiuser diversity gain. Consequently, our PFA, taking into account both channel state and system queue fluctuations, presents several favorable performance features.

AB - For wireless forward link data services, the proportional fair algorithm (PFA) incorporating opportunistic scheduling was originally designed to maintain service fairness among users as well as to exploit channel fluctuations in fading environments. The operation of PFA necessitates throughput monitoring for each user, in general through exponentially smoothing received services. In the paper, we adapt the PFA for use in more generic traffic conditions where the number of active users may change with time and data for a user may arrive intermittently. Our approach is not only to simply stop throughput monitoring for idle users but also to further accommodate in throughput monitoring changes in the number of active users. Moreover, we use in throughput monitoring different smoothing factors depending on the state of backlogged data loads, in order to exploit the variation of multiuser diversity gain. Consequently, our PFA, taking into account both channel state and system queue fluctuations, presents several favorable performance features.

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

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

U2 - 10.1109/INFOCOM.2007.311

DO - 10.1109/INFOCOM.2007.311

M3 - Conference contribution

AN - SCOPUS:51349127832

SN - 9781424420261

T3 - Proceedings - IEEE INFOCOM

SP - 331

EP - 335

BT - INFOCOM 2008

ER -