The Power of Two Choices on Graphs: the Pair-Approximation is Accurate?

@article{Gast2015ThePO,
  title={The Power of Two Choices on Graphs: the Pair-Approximation is Accurate?},
  author={Nicolas Gast},
  journal={SIGMETRICS Performance Evaluation Review},
  year={2015},
  volume={43},
  pages={69-71}
}
The power of two-choice is a well-known paradigm to improve load balancing where each incoming task is allocated to the least loaded of two servers picked at random among a collection of n servers [6, 4]. We study the power of twochoice in a setting where the two servers are not picked independently at random but are connected by an edge in an underlying graph. Our problem is motivated by systems in which choices are geometrically constrained (see the model of bike-sharing systems introduced in… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…