How large delays build up in a GI/G/1 quqe
Queueing Systems: Theory and Applications
Parallel queues with resequencing
Journal of the ACM (JACM)
Asymptotics of Subexponential Max Plus Networks: the Stochastic Event Graph Case
Queueing Systems: Theory and Applications
Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
Queueing Systems: Theory and Applications
Optimal File Splitting for Wireless Networks with Concurrent Access
NET-COOP '09 Proceedings of the 3rd Euro-NF Conference on Network Control and Optimization
Most likely paths to error when estimating the mean of a reflected random walk
Performance Evaluation
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
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.