Zero-automatic queues

Authors:
Thu-Ha Dao-Thi;Jean Mairesse
Affiliations:
LIAFA, CNRS-Université Paris 7, France;LIAFA, CNRS-Université Paris 7, France
Venue:
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Year:
2005

Citing 1
Cited 2

G-networks with multiple classes of negative and positive customers

Theoretical Computer Science

Zero-automatic networks

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
G-networks with synchronised arrivals

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We 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 0-automatic queues are quasi-reversible. 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.