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

Authors:
Jeongsim Kim;Bara Kim;Jerim Kim;Yun Han Bae
Affiliations:
Department of Mathematics Education, Chungbuk National University, 52 Naesudong-ro, Heungdeok-gu, Cheongju, Chungbuk, 361-763, Republic of Korea;Department of Mathematics, Korea University, 145, Anam-ro, Seongbuk-gu, Seoul, 136-701, Republic of Korea;Department of Mathematics, Korea University, 145, Anam-ro, Seongbuk-gu, Seoul, 136-701, Republic of Korea;Department of Mathematics Education, Sangmyung University, 7, Hongji-dong, Jongno-gu, Seoul, 110-743, Republic of Korea
Venue:
Performance Evaluation
Year:
2013

Citing 8
Cited 1

Stability Analysis of the Cambridge Ring

Queueing Systems: Theory and Applications
A framework for opportunistic scheduling in wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES

Probability in the Engineering and Informational Sciences
User-level performance of channel-aware scheduling algorithms in wireless data networks

IEEE/ACM Transactions on Networking (TON)
Flow-level performance and capacity of wireless networks with user mobility

Queueing Systems: Theory and Applications
A modeling framework for optimizing the flow-level scheduling with time-varying channels

Performance Evaluation
Value of information in optimal flow-level scheduling of users with Markovian time-varying channels

Performance Evaluation
Dynamic server allocation to parallel queues with randomly varying connectivity

IEEE Transactions on Information Theory

Scheduling of users with markovian time-varying transmission rates

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

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.