Author:
Dao-Thi Thu-Ha,Mairesse Jean
Abstract
We introduce and study a new model: zero-automatic queues. Roughly, zero-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 zero-automatic queues have a product form stationary distribution and a Poisson output process. When considering the two simplest and extremal cases of zero-automatic queues, we recover the simple M/M/1 queue and Gelenbe's G-queue with positive and negative customers.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Zero-Automatic Networks;Discrete Event Dynamic Systems;2008-09-16