Reproduce “Load Balancing with Partial Queue Information - Threshold Optimality and Indexability” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Sathwik Chadaga, Eytan Modiano
The authors develop a Whittle-index dispatch policy for partially observed queues, representing each server by its last observed backlog and the time since that observation. They prove indexability for the finite-queue model and for blocking queues only when K ≤ 2 or β ≤ 0.5. In simulations, the policy beats myopic dispatch and is competitive with full-information JSQ.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.