Ergodic Theorems for Stochastic Operators and Discrete Event Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 1998

Ergodic Theorems for Stochastic Operators and Discrete Event Networks

Abstract

We present a survey of the main ergodic theory techniques which are used in the study of iterates of monotone and homogeneous stochastic operators. It is shown that ergodic theorems on discrete event networks (queueing networks and/or Petri nets) are a generalization of these stochastic operator theorems. Kingman's subadditive ergodic Theorem is the key tool for deriving what we call first order ergodic results. We also show how to use backward constructions (also called Loynes schemes in network theory) in order to obtain second order ergodic results. We propose a review of systems entering the framework insisting on two models, precedence constraints networks and Jackson type networks
Fichier principal
Vignette du fichier
idempJER.pdf (427.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00074049 , version 1 (24-05-2006)
inria-00074049 , version 2 (27-07-2007)

Identifiers

  • HAL Id : inria-00074049 , version 2

Cite

François Baccelli, Jean Mairesse. Ergodic Theorems for Stochastic Operators and Discrete Event Networks. Cambridge University Press. Idempotency, Cambridge University Press, pp.171-208, 1998, Publications of the Newton Institute, 0 521 55344. ⟨inria-00074049v2⟩

Collections

INRIA INRIA2
134 View
308 Download

Share

Gmail Facebook X LinkedIn More