Whittle Indexability in Egalitarian Processor Sharing Systems
arXiv:1707.0244023 citations
AI Analysis
It provides a theoretical foundation for applying Whittle index policy to a specific queueing model, which is incremental for researchers in restless bandits and queueing theory.
The paper establishes Whittle indexability for egalitarian processor sharing systems and provides a numerical scheme for computing the indices, supported by experiments.
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.