MMSE-based throughput control algorithm for generalized PF scheduling

Heejin Joung; Cheol Mun; Jong Gwan Yook

doi:10.1109/LCOMM.2012.082012.120651

MMSE-based throughput control algorithm for generalized PF scheduling

Heejin Joung, Cheol Mun, Jong Gwan Yook

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper, we propose a minimum mean square error (MMSE)-based throughput control algorithm for generalized proportional fair (PF) scheduling. The algorithm determines mobile users' scheduling parameters so that the mean square error between expected throughputs and demanded throughputs is minimized. To do this, we simplify a function that predicts users' throughput, formulate a quadratically constrained quadratic problem, and find scheduling parameters that satisfy the first order necessary conditions of the problem.

Original language	English
Article number	6287512
Pages (from-to)	1584-1587
Number of pages	4
Journal	IEEE Communications Letters
Volume	16
Issue number	10
DOIs	https://doi.org/10.1109/LCOMM.2012.082012.120651
Publication status	Published - 2012

Bibliographical note

Funding Information:
This work was supported in part by a grant from the Academic Research Program of Chungju National University in 2010 and the Ministry of Knowledge Economy (MKE), Korea, under the Information Technology Research Center (ITRC) Support Program supervised by the National IT Industry Promotion Agency (NIPA) [NIPA-2011-(C1090-1121-0005)]. Digital Object Identifier 10.1109/LCOMM.2012.082012.120651

All Science Journal Classification (ASJC) codes

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2012.082012.120651

Cite this

@article{051fdfeac16849e493583265b7a06d32,

title = "MMSE-based throughput control algorithm for generalized PF scheduling",

abstract = "In this paper, we propose a minimum mean square error (MMSE)-based throughput control algorithm for generalized proportional fair (PF) scheduling. The algorithm determines mobile users' scheduling parameters so that the mean square error between expected throughputs and demanded throughputs is minimized. To do this, we simplify a function that predicts users' throughput, formulate a quadratically constrained quadratic problem, and find scheduling parameters that satisfy the first order necessary conditions of the problem.",

author = "Heejin Joung and Cheol Mun and Yook, {Jong Gwan}",

note = "Funding Information: This work was supported in part by a grant from the Academic Research Program of Chungju National University in 2010 and the Ministry of Knowledge Economy (MKE), Korea, under the Information Technology Research Center (ITRC) Support Program supervised by the National IT Industry Promotion Agency (NIPA) [NIPA-2011-(C1090-1121-0005)]. Digital Object Identifier 10.1109/LCOMM.2012.082012.120651",

year = "2012",

doi = "10.1109/LCOMM.2012.082012.120651",

language = "English",

volume = "16",

pages = "1584--1587",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - MMSE-based throughput control algorithm for generalized PF scheduling

AU - Joung, Heejin

AU - Mun, Cheol

AU - Yook, Jong Gwan

N1 - Funding Information: This work was supported in part by a grant from the Academic Research Program of Chungju National University in 2010 and the Ministry of Knowledge Economy (MKE), Korea, under the Information Technology Research Center (ITRC) Support Program supervised by the National IT Industry Promotion Agency (NIPA) [NIPA-2011-(C1090-1121-0005)]. Digital Object Identifier 10.1109/LCOMM.2012.082012.120651

PY - 2012

Y1 - 2012

N2 - In this paper, we propose a minimum mean square error (MMSE)-based throughput control algorithm for generalized proportional fair (PF) scheduling. The algorithm determines mobile users' scheduling parameters so that the mean square error between expected throughputs and demanded throughputs is minimized. To do this, we simplify a function that predicts users' throughput, formulate a quadratically constrained quadratic problem, and find scheduling parameters that satisfy the first order necessary conditions of the problem.

AB - In this paper, we propose a minimum mean square error (MMSE)-based throughput control algorithm for generalized proportional fair (PF) scheduling. The algorithm determines mobile users' scheduling parameters so that the mean square error between expected throughputs and demanded throughputs is minimized. To do this, we simplify a function that predicts users' throughput, formulate a quadratically constrained quadratic problem, and find scheduling parameters that satisfy the first order necessary conditions of the problem.

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

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

U2 - 10.1109/LCOMM.2012.082012.120651

DO - 10.1109/LCOMM.2012.082012.120651

M3 - Article

AN - SCOPUS:84867864338

SN - 1089-7798

VL - 16

SP - 1584

EP - 1587

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 10

M1 - 6287512

ER -

MMSE-based throughput control algorithm for generalized PF scheduling

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this