2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.PR2004★ 2 cited
Functional central limit theorems for a large network in which customers join the shortest of several queues
Carl Graham
We consider N single server infinite buffer queues with service rate β. Customers arrive at rate Nα, choose L queues uniformly, and join the shortest. We study the processes R^N fo…
math.PR2003
Out of equilibrium functional central limit theorems for a large network where customers join the shortest of several queues
Carl Graham
Customers arrive at rate N times alpha on a network of N single server infinite buffer queues, choose L queues uniformly, join the shortest one, and are served there in turn at rat…
math.PR2003★ 1 cited
A functional central limit theorem in equilibrium for a large network in which customers join the shortest of several queues
Carl Graham
We consider N single server infinite buffer queues with service rate beta. Customers arrive at rate N times alpha,choose L queues uniformly, and join the shortest one. The stabilit…