We address the problem of developing a well-performing and implementable scheduler of users with wireless connection to the base station. The main feature of such real-life systems is that the quality conditions of the user channels are time-varying, which turn into the time-varying transmission rate due to different modulation and coding schemes. We assume that this phenomenon follows a Markovian law and most of the discussion is dedicated to the case of three quality conditions of each user, for which we characterize an optimal index policy and show that threshold policies (of giving higher priority to users with higher transmission rate) are not necessarily optimal. For the general case of arbitrary number of quality conditions we design...
Abstract—Randomization is a powerful and pervasive strategy for developing efficient and practical t...
Abstract—We investigate the scheduling of a common resource between several concurrent users when th...
We investigate the scheduling of a common resource between several concurrent users when the feasibl...
We address the problem of developing a well-performing and implementable scheduler of users with wir...
We address the problem of developing a well-performing and implementable scheduler of users with wir...
We address the problem of developing a well-performing and implementable scheduler of users with wir...
In this paper, we design, characterize in closed-form, and evaluate a new index rule for Markovian t...
© 2002-2012 IEEE. Age of information is a new network performance metric that captures the freshness...
We present an “opportunistic ” transmission scheduling policy that exploits time-varying channel con...
We consider the scheduling problem in down-link wireless networks with heterogeneous, Markov-modulat...
This paper investigates the performance of opportunistic schedulers in wireless networks. A base sta...
Abstract—This work investigates a problem of scheduling tasks on a single server in which the rate a...
We consider the problem of scheduling packets over channels with time-varying quality. This problem ...
International audienceWe investigate the scheduling of a common resource between several concurrent ...
This paper deals with the resource allocation problem aimed at maximizing users' perception of quali...
Abstract—Randomization is a powerful and pervasive strategy for developing efficient and practical t...
Abstract—We investigate the scheduling of a common resource between several concurrent users when th...
We investigate the scheduling of a common resource between several concurrent users when the feasibl...
We address the problem of developing a well-performing and implementable scheduler of users with wir...
We address the problem of developing a well-performing and implementable scheduler of users with wir...
We address the problem of developing a well-performing and implementable scheduler of users with wir...
In this paper, we design, characterize in closed-form, and evaluate a new index rule for Markovian t...
© 2002-2012 IEEE. Age of information is a new network performance metric that captures the freshness...
We present an “opportunistic ” transmission scheduling policy that exploits time-varying channel con...
We consider the scheduling problem in down-link wireless networks with heterogeneous, Markov-modulat...
This paper investigates the performance of opportunistic schedulers in wireless networks. A base sta...
Abstract—This work investigates a problem of scheduling tasks on a single server in which the rate a...
We consider the problem of scheduling packets over channels with time-varying quality. This problem ...
International audienceWe investigate the scheduling of a common resource between several concurrent ...
This paper deals with the resource allocation problem aimed at maximizing users' perception of quali...
Abstract—Randomization is a powerful and pervasive strategy for developing efficient and practical t...
Abstract—We investigate the scheduling of a common resource between several concurrent users when th...
We investigate the scheduling of a common resource between several concurrent users when the feasibl...