Skip to Main content Skip to Navigation
Reports

Asymptotics of Subexponential Max Plus Networks : the Stochastic Event Graph Case

François Baccelli 1 Serguei Foss Marc Lelarge 1
1 TREC - Theory of networks and communications
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt
Abstract : We calculate the exact tail asymptotics of stationary response times for open stochastic event graphs, in the irreducible and reducible cases. These networks admit a representation as (max,plus)-linear systems in a random medium. We study the case of renewal input and i.i.d service times with subexponential distributions. We show that the stationary response times have tail asymptotics of the same order as the integrated tail of service times. The mutiplicative constants only involve the intensity of the arrival process and the (max,plus)-Lyapunov exponents of certain sequences of (max,plus)-matrices associated to the event graph.
Document type :
Reports
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00071627
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:21:45 PM
Last modification on : Tuesday, September 22, 2020 - 3:58:32 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:29:47 PM

Identifiers

  • HAL Id : inria-00071627, version 1

Collections

Citation

François Baccelli, Serguei Foss, Marc Lelarge. Asymptotics of Subexponential Max Plus Networks : the Stochastic Event Graph Case. [Research Report] RR-4952, INRIA. 2003. ⟨inria-00071627⟩

Share

Metrics

Record views

409

Files downloads

426