Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks
From MaRDI portal
Recommendations
- Asymptotically exact decomposition approximations for open queueing networks
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
- Heavy-traffic limits for stationary network flows
- A hybrid method for performance analysis of \(G/G/m\) queueing networks
- Decomposition of open queueing networks with batch service
Cited in
(14)- Towards better multi-class parametric-decomposition approximations for open queueing networks
- Nonexistence of Brownian models for certain multiclass queueing networks
- Non-equilibrium statistical physics of currents in queuing networks
- Heavy-traffic limits for stationary network flows
- The advantage of indices of dispersion in queueing approximations
- Higher order approximations for tandem queueing networks
- Taking account of correlations between streams in queueing network approximations
- A LINEAR PROGRAMMING APPROACH TO THE STEADY-STATE ANALYSIS OF REFLECTED BROWNIAN MOTION
- Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing
- Diffusion Limits for Open Networks of Finite-Buffer Queues
- A robust queueing network analyzer based on indices of dispersion
- Queueing networks with path-dependent arrival processes
- The heavy-traffic bottleneck phenomenon under splitting and superposition
- Evaluation of the end-to-end delay of a multiphase queuing system using artificial neural networks
This page was built for publication: Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287606)
