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 by a centralized dispatcher to one of n First-In-First-Out queues associa...
| Main Authors: | , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Institute for Operations Research and the Management Sciences (INFORMS),
2019-03-04T20:28:40Z.
|
| Subjects: | |
| Online Access: | Get fulltext |