We study a system of infinitely many queues with Poisson arrivals and exponential service times. Let the net output process be the difference between the departure process and the arrival process. We impose certain ergodicity conditions on the underlying Markov chain governing the customer path. These conditions imply the existence of an invariant measure under which the average net output process is positive and proportional to the time. Starting the system with that measure, we prove that the net output process is a Poisson process plus a perturbation of order 1. This generalizes the classical theorem of Burke which asserts that the departure process is a Poisson process. An analogous result is proven for the net input process.
Publié le : 1994-11-14
Classification:
Queuing networks,
zero range process,
Burke's theorem,
departure process,
net output process,
60K35,
60K25,
90B22,
90B15
@article{1177004907,
author = {Ferrari, P. A. and Fontes, L. R. G.},
title = {The Net Output Process of a System with Infinitely many Queues},
journal = {Ann. Appl. Probab.},
volume = {4},
number = {4},
year = {1994},
pages = { 1129-1144},
language = {en},
url = {http://dml.mathdoc.fr/item/1177004907}
}
Ferrari, P. A.; Fontes, L. R. G. The Net Output Process of a System with Infinitely many Queues. Ann. Appl. Probab., Tome 4 (1994) no. 4, pp. 1129-1144. http://gdmltest.u-ga.fr/item/1177004907/