Zero-automatic queues - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Zero-automatic queues

Résumé

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.

Dates et versions

hal-00165286 , version 1 (25-07-2007)

Identifiants

Citer

Thu-Ha Dao-Thi, Jean Mairesse. Zero-automatic queues. EPEW 2005, 2005, Versailles, France. pp.64-78, ⟨10.1007/11549970_6⟩. ⟨hal-00165286⟩
39 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More