Batch queues, reversibility and first-passage percolation

Journal article

We consider a model of queues in discrete time, with batch services and arrivals. The case where arrival and service batches both have Bernoulli distributions corresponds to a discrete-time M/M/1 queue, and the case where both have geometric distributions has also been previously studied. We describe a common extension to a more general class where the batches are the product of a Bernoulli and a geometric, and use reversibility arguments to prove versions of Burke's theorem for these models. Extensions to models with continuous time or continuous workload are also described. As an application, we show how these results can be combined with methods of Seppalainen and O'Connell to provide exact solutions for a new class of first-passage percolation problems.

Authors: Martin, J

• Publication status: Published
• Journal: QUEUEING SYSTEMS
• Volume: 62
• Issue: 4
• Pages: 411-427
• Publication date: 2009-02-12
• DOI: 10.1007/s11134-009-9137-6
• EISSN: 1572-9443
• ISSN: 0257-0130
• Language: English
• Keywords: math.PR