Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems
Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems
We consider the following distributed service model: jobs with unit mean, exponentially distributed, and independent processing times arrive as a Poisson process of rate λ N, with 0<λ<1, and are immediately dispatched to one of several queues associated with N identical servers with unit processing rate. We assume that the …