Apr 2, 2019 · Abstract: Scheduling periodic real-time traffic in wireless networks is challenging due to the unreliable wireless channels.

We first formulate the scheduling problem as a Restless Multi- armed Bandit (RMAB) problem. Then, we theoretically prove the indexability of the scheduling ...

We first formulate the scheduling problem as a Restless Multi-armed Bandit (RMAB) problem. Then, we theoretically prove the indexability of the scheduling ...

Scheduling periodic real-time traffic in lossy wireless networks as restless multi-armed bandit. J Xu, C Guo. IEEE Wireless Communications Letters 8 (4), 1129 ...

Formulated as a restless multi-armed bandit problem, the stochastic deadline scheduling problem is shown to be indexable and an upper bound on the ...

Scheduling periodic real-time traffic in wireless networks is challenging due to the unreliable wireless channels. We first formulate the scheduling problem as ...

Scheduling Periodic Real-Time Traffic in Lossy Wireless Networks as Restless Multi-Armed Bandit. IEEE Wireless Communications Letters 8(4): 1129-1132 ...

This paper proposes an algorithm in which the Whittle-like index of each user is computed and the user who has the lowest value is selected for transmission ...

"Scheduling Periodic Real-Time Traffic in Lossy Wireless Networks as Restless Multi-Armed Bandit." IEEE Wireless Communications Letters 8, no. 4 (August ...

... multi-armed bandits with multiple plays. Vol. 2, p. 1408","https://doi.org/10.1109/CDC.1995.480298" "Righter, Rhonda, Shanthikumar, J. George 1998 ...