A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Randomized load balancing networks arise in a variety of applications, and allow for efficient sharing of resources, while being relatively easy to implement. We consider a network of parallel queues in which incoming jobs with independent and identically distributed service times are assigned to the shortest queue among a randomly chosen subset of d queues, and leave the network on completion of service. Prior work on dynamical properties of this model has focused on the case of exponentialarXiv:1707.02005v2 fatcat:fj2jzpzkmfaobinfeitwlfnaay