A Simple Steady-State Analysis of Load Balancing Algorithms in the Sub-Halfin-Whitt Regime

Abstract

This paper studies the steady-state performance of load balancing algorithms in many-server systems. We consider a system with N identical servers with buffer size b-1 such that b = o (√N), in other words, each server can hold at most b jobs, one job in service and b - 1 jobs in buffer.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 17 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.