14 citations · 43 across the 11 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2018★ 14 cited
Power-of--Choices with Memory: Fluid Limit and Optimality
Jonatha Anselmi, Francois Dufour
In multi-server distributed queueing systems, the access of stochastically arriving jobs to resources is often regulated by a dispatcher, also known as load balancer. A fundamental…
math.PR2012★ 1 cited
Closed queueing networks under congestion: non-bottleneck independence and bottleneck convergence
Jonatha Anselmi, Bernardo D'Auria, Neil Walton
We analyze the behavior of closed product-form queueing networks when the number of customers grows to infinity and remains proportionate on each route (or class). First, we focus…