Stability of Jackson-type queueing networks, I

Abstract : This paper gives a pathwise construction of Jackson-type queuing networks allowing the derivation of stability and convergence theorems under general statistical assumptions on the driving sequences, namely, it is only assumed that the input process, the service sequences and the routing mechanism are jointly stationary and ergodic in a sense that is made precise in the paper. The main tools for these results are the subadditive ergodic theorem, which is used to derive a strong law of large numbers and basic theorems on monotone stochastic recursive sequences. the techniques which are proposed here apply to other and more general classes of dsicrete event systems, like Petri nets or GSMP's. The paper also provides new results on the Jackson-type networks with i.i.d. driving sequences which were studied in the past.
Type de document :
[Research Report] RR-1945, INRIA. 1993
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 16:11:30
Dernière modification le : samedi 27 janvier 2018 - 01:30:57
Document(s) archivé(s) le : mardi 12 avril 2011 - 15:55:59



  • HAL Id : inria-00074729, version 1



François Baccelli, Serguei Foss. Stability of Jackson-type queueing networks, I. [Research Report] RR-1945, INRIA. 1993. 〈inria-00074729〉



Consultations de la notice


Téléchargements de fichiers