Whittle Indexability in Egalitarian Processor Sharing Systems

2017/07/08 by Borkar, Vivek S., Pattathil, Sarath · 2 citations
#FOS: Electrical engineering #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · doi:10.48550/arxiv.1707.02440

Abstract

The egalitarian processor sharing model is viewed as a restless bandit and its Whittle indexability is established. A numerical scheme for computing the Whittle indices is provided, along with supporting numerical experiments.

Cited by

• Relay Selection in Wireless Networks as Restless Bandits
• User Association in the Presence of Jamming in Wireless Networks Using the Whittle Index

Related

• A unifying computations of Whittle's Index for Markovian bandits
• Conditions for indexability of restless bandits and an O(K³) algorithm to compute Whittle index
• Two families of indexable partially observable restless bandits and Whittle index computation
• Stationary Performance Analysis of Grishechkin Processor-Sharing Queues: An Integral Equation Approach
• Engines of Parsimony: Part III; Performance Trade-offs for Reversible Computers Sharing Resources