The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes
From MaRDI portal
Publication:660133
DOI10.1007/s11134-011-9226-1zbMath1230.90064OpenAlexW1991260205MaRDI QIDQ660133
Publication date: 26 January 2012
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-011-9226-1
cross correlationautocorrelationindex of dispersion for countsinnovations methodmixed generalized Erlangqueueing network decompositionvariability function
Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Generalized stochastic processes (60G20)
Related Items
Analytical approximations to predict performance measures of manufacturing systems with general distributions, job failures and parallel processing ⋮ A robust queueing network analyzer based on indices of dispersion ⋮ Analytical approximations to predict performance measures of Markovian type manufacturing systems with job failures and parallel processing ⋮ Heavy-Traffic Limit of the GI/GI/1 Stationary Departure Process and Its Variance Function
Cites Work
- Mean waiting time approximations in the \(G/G/1\) queue
- The heavy-traffic bottleneck phenomenon under splitting and superposition
- The heavy-traffic bottleneck phenomenon in open queueing networks
- A new renewal approximation for certain autocorrelated processes
- The impact of production time variability on make-to-stock queue performance
- Towards better multi-class parametric-decomposition approximations for open queueing networks
- Taking account of correlations between streams in queueing network approximations
- Modeling Cross Correlation in Three-Moment Four-Parameter Decomposition Approximation of Queueing Networks
- Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues
- Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- The first two moment matrices of the counts for the markovian arrival process
- Approximate Analysis of General Queuing Networks by Decomposition
- The Markov-modulated Poisson process (MMPP) cookbook
- Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing
- Characterizing the BMAP/MAP/1 Departure Process via the ETAQA Truncation
- Variability Functions for Parametric-Decomposition Approximations of Queueing Networks
This page was built for publication: The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes