Approximate analysis for queueing networks with finite capacity and customer loss
DOI10.1016/0377-2217(93)E0252-SzbMATH Open0912.90141OpenAlexW2005980469WikidataQ127517343 ScholiaQ127517343MaRDI QIDQ1127250FDOQ1127250
Authors: Shi, Leyuan 
Publication date: 25 May 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0252-s
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
simulationqueueing networksblockingfinite capacitythroughputmean waiting timeapproximation procedurecustomer losstwo-parameter approximation
Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate Analysis of General Queuing Networks by Decomposition
- Accuracy of the Diffusion Approximation for Some Queuing Systems
- Title not available (Why is that?)
- The Interrupted Poisson Process As An Overflow Process
- An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis
- Monotonicity of throughput in non-Markovian networks
- Title not available (Why is that?)
Cited In (15)
- Closed-form formulae for moment, tail probability, and blocking probability of waiting time in a buffer-sharing deterministic system
- A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes
- An approximation method for blocking probabilities in \(M/D/1/K_{1} \to \cdot /D/1/K_{2}\) queues
- Approximate method of design of open nonexponential queueing networks of finite capacity with losses or blocking
- Parametric nonlinear programming for analyzing fuzzy queues with finite capacity
- Approximate analysis of networks of PH\(|\)PH\(| 1| K\) queues with customer losses: Test results
- Analysis of a finite-source customer assignment model with no state information
- Queueing network \(\text{MAP}-(G I / \infty)^K\) with high-rate arrivals
- Customer-oriented finite perturbation analysis for queueing networks
- Nonstationary analysis of the loss queue and of queueing networks of loss queues
- Buffer allocation in flow-shop-type production systems with general arrival and service patterns
- The unobserved waiting customer approximation
- 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 non-stationary loss queues and networks of loss queues with general service time distributions
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)
