Strong approximation for the supermarket model (Q2572400)

The supermarket model is a system of \(N\) single-server queues. Customers arrive as a Poisson process of rate \(N\lambda \), where \(\lambda \in (0,1)\). Each customer examines \(d\) queues, chosen randomly from all queues, and joins the shortest of these \(d\) queues, choosing randomly if the shortest queue is not unique. The paper establishes a law of large numbers, a jump process approximation and a central limit theorem for this supermarket model.