Fluid limits for interacting queues in sparse dynamic graphs

Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden

Consider a network of $n$ single-server queues where tasks arrive independently at each server at rate $\hat{I}{»}_n$. The servers are connected by a graph that is resampled at rate $\hat{I}{¼}_n$…