Asymptotics of Subexponential Max Plus Networks : the Stochastic Event Graph Case - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

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

François Baccelli
Serguei Foss
  • Function : Author
Marc Lelarge
  • Function : Author
  • PersonId : 833445

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.
Fichier principal
Vignette du fichier
RR-4952.pdf (182.94 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071627 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071627 , version 1

Cite

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⟩
99 View
175 Download

Share

Gmail Facebook X LinkedIn More