Tail Asymptotics for Discrete Event Systems
- 54 Downloads
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of its performances. We concentrate on the logarithmic tail asymptotics of the stationary response time for a class of networks that admit a representation as (max,plus)-linear systems in a random medium. We are able to derive analytic results when the distribution of the holding times are light-tailed. We show that the lack of independence may lead in dimension bigger than one to non-trivial effects in the asymptotics of the sojourn time. We also study in detail a simple queueing network with multipath routing.
KeywordsQueueing theory Large deviations
The author would like to thank Peter Friz for pointing out a mistake in an earlier version of this work and the participants of Valuetools 2006 (where this work was presented) and especially Bruno Gaujal for a comment related to Remark 1.
- Baccelli F, Cohen G, Olsder GJ, Quadrat J-P (1992) Synchronization and linearity. Wiley. Available at http://www-rocq.inria.fr/metalau/cohen/SED/book-online.html
- Cramér H (1938) Sur un nouveau théorème limite de la théorie des probabilités. Actual Sci Ind 736:5–23Google Scholar
- Dembo A, Zeitouni O (1998) Large deviations techniques and applications. Springer-VerlagGoogle Scholar
- Lelarge M (2005) Rare events in networks. PhD thesis, Ecole polytechnique Available at http://www.di.ens.fr/~lelarge
- Lelarge M (2007a) Packet reordering in networks with heavy-tailed delays. Math Methods Oper Res. doi: 10.1007/s00186-007-0175-8