Asymptotics of subexponential max plus networks: the stochastic event graph case
From MaRDI portal
Publication:596412
DOI10.1023/B:QUES.0000021142.51241.76zbMath1061.90028MaRDI QIDQ596412
Marc Lelarge, François Baccelli, Sergeĭ Georgievich Foss
Publication date: 10 August 2004
Published in: Queueing Systems (Search for Journal in Brave)
tandem queueheavy tailopen queueing network(max, plus)-networkintegrated tailstochastic event graphsubexponential random variableVeraverbeke's theorem
Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)
Related Items (11)
Asymptotic behavior of generalized processor sharing queues under subexponential assumptions ⋮ Discrete and continuous time modulated random walks with heavy-tailed increments ⋮ Tandem queues with subexponential service times and finite buffers ⋮ A General Class of Closed Fork and Join Queues with Subexponential Service Times ⋮ Tail asymptotics for discrete event systems ⋮ Packet reordering in networks with heavy-tailed delays ⋮ Cyclic queueing networks with subexponential service times ⋮ Tail Asymptotics for Monotone-Separable Networks ⋮ Tails for (max, plus) recursions under subexponentiality ⋮ Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic ⋮ Large deviations for stochastic fluid networks with Weibullian tails
This page was built for publication: Asymptotics of subexponential max plus networks: the stochastic event graph case
