Zero-automatic queues and product form

Simple item page
dc.creatorDao-Thi, Thu-Ha
dc.creatorMairesse, Jean
dc.date2007-07-23
dc.date.accessioned2026-07-07T08:19:51Z
dc.date.available2026-07-07T08:19:51Z
dc.descriptionWe introduce and study a new model: 0-automatic queues. Roughly, 0-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. The salient result is that all stable 0-automatic queues have a product form stationary distribution and a Poisson output process. When considering the two simplest and extremal cases of 0-automatic queues, we recover the simple M/M/1 queue, and Gelenbe's G-queue with positive and negative customers.
dc.identifierhttps://arxiv.org/abs/0707.3449
dc.identifierhttp://arxiv.org/abs/0707.3449
dc.identifierAdvances in Applied Probability 39, 2 (2007) 429-461
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134907
dc.subjectDiscrete Mathematics
dc.titleZero-automatic queues and product form
dc.typetext

Files

Collections

arXiv