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)
Characterization and computation of restless bandit marginal productivity indices
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Flow-level performance and capacity of wireless networks with user mobility
Queueing Systems: Theory and Applications
Throughput optimality of delay-driven maxweight scheduler for a wireless system with flow dynamics
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A modeling framework for optimizing the flow-level scheduling with time-varying channels
Performance Evaluation
On the optimal trade-off between SRPT and opportunistic scheduling
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics
IEEE/ACM Transactions on Networking (TON)
Convergence of proportional-fair sharing algorithms under general conditions
IEEE Transactions on Wireless Communications
Dynamic server allocation to parallel queues with randomly varying connectivity
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Opportunistic schedulers for optimal scheduling of flows in wireless systems with ARQ feedback
Proceedings of the 24th International Teletraffic Congress
Stability of flow-level scheduling with Markovian time-varying channels
Performance Evaluation
Scheduling of users with markovian time-varying transmission rates
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |
In this paper, we design, characterize in closed-form, and evaluate a new index rule for Markovian time-varying channels, which gives rise to a simple opportunistic scheduling rule for flow-level scheduling in wireless downlink systems. For user channels, we employ the Gilbert-Elliot model with a flow-level interpretation: the channel condition follows a general two-state Markov chain with distinct probabilities of finishing the flow transmission. The index value of the bad channel condition takes into account both the one-period and the steady-state potential improvement of the service completion probability, while the good channel condition gets an absolute priority with the c@m-index (well-known to be throughput-optimal) as the tie-breaking rule. Our computational study confirms near-optimality of the proposed rule in most of the instances, and suggests that information about the channels steady state is often enough to achieve near-optimality.