Stability of flow-level scheduling with Markovian time-varying channels

Jeongsim Kim, Bara Kim, Jerim Kim, Yun Han Bae

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

We consider the flow-level scheduling in wireless networks. The time is slotted and in each time slot the base station selects flows/users to serve. There are multi-class users and channel conditions vary over time. The channel state for each class user is assumed to be modeled as a finite state Markov chain. Using the fluid limit approach, we find the necessary and sufficient conditions for the stability of best rate (BR) scheduling policies. As a result, we show that any BR policy is maximally stable. Our result generalizes the result of Ayesta et al. (in press) [13] and solves the conjecture of Jacko (2011) [16]. We introduce a correlated channel state model and investigate the stability condition for BR policy in this model.

Original languageEnglish
Pages (from-to)148-159
Number of pages12
JournalPerformance Evaluation
Volume70
Issue number2
DOIs
Publication statusPublished - 2013 Jan 1

Fingerprint

Time-varying Channels
Scheduling
Base stations
Fluid Limits
Markov processes
Wireless networks
Scheduling Policy
Multi-class
Stability Condition
Wireless Networks
Fluids
Markov chain
Vary
Necessary Conditions
Generalise
Sufficient Conditions
Model
Policy

Keywords

  • Best rate policy
  • Flow-level scheduling
  • Fluid limits
  • Markovian channel
  • Stability

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software
  • Modelling and Simulation

Cite this

Stability of flow-level scheduling with Markovian time-varying channels. / Kim, Jeongsim; Kim, Bara; Kim, Jerim; Bae, Yun Han.

In: Performance Evaluation, Vol. 70, No. 2, 01.01.2013, p. 148-159.

Research output: Contribution to journalArticle

Kim, Jeongsim ; Kim, Bara ; Kim, Jerim ; Bae, Yun Han. / Stability of flow-level scheduling with Markovian time-varying channels. In: Performance Evaluation. 2013 ; Vol. 70, No. 2. pp. 148-159.
@article{29def90a9f2e41bea68a11b497232ad5,
title = "Stability of flow-level scheduling with Markovian time-varying channels",
abstract = "We consider the flow-level scheduling in wireless networks. The time is slotted and in each time slot the base station selects flows/users to serve. There are multi-class users and channel conditions vary over time. The channel state for each class user is assumed to be modeled as a finite state Markov chain. Using the fluid limit approach, we find the necessary and sufficient conditions for the stability of best rate (BR) scheduling policies. As a result, we show that any BR policy is maximally stable. Our result generalizes the result of Ayesta et al. (in press) [13] and solves the conjecture of Jacko (2011) [16]. We introduce a correlated channel state model and investigate the stability condition for BR policy in this model.",
keywords = "Best rate policy, Flow-level scheduling, Fluid limits, Markovian channel, Stability",
author = "Jeongsim Kim and Bara Kim and Jerim Kim and Bae, {Yun Han}",
year = "2013",
month = "1",
day = "1",
doi = "10.1016/j.peva.2012.08.005",
language = "English",
volume = "70",
pages = "148--159",
journal = "Performance Evaluation",
issn = "0166-5316",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Stability of flow-level scheduling with Markovian time-varying channels

AU - Kim, Jeongsim

AU - Kim, Bara

AU - Kim, Jerim

AU - Bae, Yun Han

PY - 2013/1/1

Y1 - 2013/1/1

N2 - We consider the flow-level scheduling in wireless networks. The time is slotted and in each time slot the base station selects flows/users to serve. There are multi-class users and channel conditions vary over time. The channel state for each class user is assumed to be modeled as a finite state Markov chain. Using the fluid limit approach, we find the necessary and sufficient conditions for the stability of best rate (BR) scheduling policies. As a result, we show that any BR policy is maximally stable. Our result generalizes the result of Ayesta et al. (in press) [13] and solves the conjecture of Jacko (2011) [16]. We introduce a correlated channel state model and investigate the stability condition for BR policy in this model.

AB - We consider the flow-level scheduling in wireless networks. The time is slotted and in each time slot the base station selects flows/users to serve. There are multi-class users and channel conditions vary over time. The channel state for each class user is assumed to be modeled as a finite state Markov chain. Using the fluid limit approach, we find the necessary and sufficient conditions for the stability of best rate (BR) scheduling policies. As a result, we show that any BR policy is maximally stable. Our result generalizes the result of Ayesta et al. (in press) [13] and solves the conjecture of Jacko (2011) [16]. We introduce a correlated channel state model and investigate the stability condition for BR policy in this model.

KW - Best rate policy

KW - Flow-level scheduling

KW - Fluid limits

KW - Markovian channel

KW - Stability

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

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

U2 - 10.1016/j.peva.2012.08.005

DO - 10.1016/j.peva.2012.08.005

M3 - Article

VL - 70

SP - 148

EP - 159

JO - Performance Evaluation

JF - Performance Evaluation

SN - 0166-5316

IS - 2

ER -