Skip to Main content Skip to Navigation
Book sections

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
Document type :
Book sections
Complete list of metadata

https://hal.inria.fr/inria-00074049
Contributor : Jean Mairesse <>
Submitted on : Friday, July 27, 2007 - 2:23:18 PM
Last modification on : Saturday, January 27, 2018 - 1:30:52 AM
Long-term archiving on: : Monday, May 23, 2011 - 4:53:35 PM

Files

idempJER.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00074049, version 2

Collections

Citation

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⟩

Share

Metrics

Record views

392

Files downloads

354