Zero-Automatic Queues

Zero-Automatic Queues

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 simple...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Dao-Thi, Thu-Ha, Mairesse, Jean
Format: Tagungsbericht
Sprache:eng
Schlagworte:
1 queue
Applied sciences
Computer Science
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Computer systems performance. Reliability
Discrete Mathematics
Exact sciences and technology
Mathematics
Probability
product form
quasi-reversibility
queue
Software
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/11549970_6