36 citations · 111 across the 23 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
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…
math.OC2012
Network iso-elasticity and weighted -fairness
S. C. Borst, N. S. Walton, A. P. Zwart
When a communication network's capacity increases, it is natural to want the bandwidth allocated to increase to exploit this capacity. But, if the same relative capacity increase o…