Approximate analysis for queueing networks with finite capacity and customer loss
From MaRDI portal
(Redirected from Publication:1127250)
Recommendations
- Approximate method of design of open nonexponential queueing networks of finite capacity with losses or blocking
- An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis
- Approximation Analysis of Open Acyclic Exponential Queueing Networks with Blocking
- Analysis of queueing networks with blocking
- On a class of approximations for closed queueing networks
Cites work
- scientific article; zbMATH DE number 3732950 (Why is no real title available?)
- scientific article; zbMATH DE number 3761395 (Why is no real title available?)
- scientific article; zbMATH DE number 44300 (Why is no real title available?)
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 3599480 (Why is no real title available?)
- Accuracy of the Diffusion Approximation for Some Queuing Systems
- An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis
- Approximate Analysis of General Queuing Networks by Decomposition
- Monotonicity of throughput in non-Markovian networks
- The Interrupted Poisson Process As An Overflow Process
Cited in
(15)- Buffer allocation in flow-shop-type production systems with general arrival and service patterns
- An approximation method for blocking probabilities in \(M/D/1/K_{1} \to \cdot /D/1/K_{2}\) queues
- Customer-oriented finite perturbation analysis for queueing networks
- Approximate analysis of non-stationary loss queues and networks of loss queues with general service time distributions
- Closed-form formulae for moment, tail probability, and blocking probability of waiting time in a buffer-sharing deterministic system
- Queueing models of certain manufacturing cells under product-mix sequencing rules
- An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis
- Approximate analysis of networks of PH\(|\)PH\(| 1| K\) queues with customer losses: Test results
- Parametric nonlinear programming for analyzing fuzzy queues with finite capacity
- Analysis of a finite-source customer assignment model with no state information
- Nonstationary analysis of the loss queue and of queueing networks of loss queues
- The unobserved waiting customer approximation
- Approximate method of design of open nonexponential queueing networks of finite capacity with losses or blocking
- Queueing network \(\text{MAP}-(G I / \infty)^K\) with high-rate arrivals
- A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes
This page was built for publication: Approximate analysis for queueing networks with finite capacity and customer loss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127250)
