Tail Asymptotics for Discrete Event Systems
| dc.creator | Lelarge, Marc | |
| dc.date | 2007-01-15 | |
| dc.date | 2007-03-16 | |
| dc.date.accessioned | 2026-07-07T07:52:04Z | |
| dc.date.available | 2026-07-07T07:52:04Z | |
| dc.description | 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. | |
| dc.description | 19 pages, 2 figures, mistake in appendix corrected | |
| dc.identifier | https://arxiv.org/abs/math/0701420 | |
| dc.identifier | http://arxiv.org/abs/math/0701420 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/125746 | |
| dc.subject | Probability | |
| dc.subject | 60F10; 60K25 | |
| dc.title | Tail Asymptotics for Discrete Event Systems | |
| dc.type | text |