Performance of a Server Cluster with Parallel Processing and Randomized Load Balancing

Thomas Bonald (1, 2) , Céline Comte (1, 2)

1 LTCI - Laboratoire Traitement et Communication de l'Information
2 LINCS - Laboratory of Information, Network and Communication Sciences

We consider a cluster of servers where each incoming job is assigned d servers chosen uniformly at random, for some fixed d ≥ 2. Jobs are served in parallel and the resource allocation is balanced fairness. We provide a recursive formula for computing the exact mean service rate of each job. The complexity is polynomial in the number of servers.

Mots clés: Load balancing; balanced fairness; recursive formula

Domaines: Réseaux et télécommunications [cs.NI]; Performance et fiabilité [cs.PF]

Thomas Bonald, Céline Comte. Performance of a Server Cluster with Parallel Processing and Randomized Load Balancing. [Research Report] Telecom ParisTech. 2016. ⟨hal-01306343⟩