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

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

Research output: Contribution to journalArticlepeer-review

14 Citations (Scopus)


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
Issue number2
Publication statusPublished - 2013


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

ASJC Scopus subject areas

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


Dive into the research topics of 'Stability of flow-level scheduling with Markovian time-varying channels'. Together they form a unique fingerprint.

Cite this