- 37 Downloads
We continue the study of zero-automatic queues first introduced in Dao-Thi and Mairesse (Adv Appl Probab 39(2):429–461, 2007). These queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. The simple M/M/1 queue and Gelenbe’s G-queue with positive and negative customers are the two simplest 0-automatic queues. All stable 0-automatic queues have an explicit “multiplicative” stationary distribution and a Poisson departure process (Dao-Thi and Mairesse, Adv Appl Probab 39(2):429–461, 2007). In this paper, we introduce and study networks of 0-automatic queues. We consider two types of networks, with either a Jackson-like or a Kelly-like routing mechanism. In both cases, and under the stability condition, we prove that the stationary distribution of the buffer contents has a “product-form” and can be explicitly determined. Furthermore, the departure process out of the network is Poisson.
KeywordsQueueing theory Jackson network Kelly network Product form Zero-automatic
- Chao X, Miyazawa M, Pinedo M (1999) Queueing networks. Customers, signals, and product form solutions. WileyGoogle Scholar
- Dao-Thi T-H, Mairesse J (2006) Zero-automatic networks. In: Proceedings of valuetools, Pisa, Italy. ACMGoogle Scholar
- Gelenbe E, Pujolle G (1998) Introduction to queueing networks, 2nd edn. Wiley, ChichesterGoogle Scholar
- Ledrappier F (2001) Some asymptotic properties of random walks on free groups. In: Taylor J (ed) Topics in probability and lie groups: boundary theory. CRM Proc. Lect. Notes, vol 28. American Mathematical Society, pp 117–152Google Scholar
- Mairesse J, Mathéus F (2006) Random walks on free products of cyclic groups. To appear in J London Math Soc 2006. Available at arXiv:math.PR/0509211, 2005