Approximate analysis for queueing networks with finite capacity and customer loss

DOI10.1016/0377-2217(93)E0252-SzbMath0912.90141OpenAlexW2005980469WikidataQ127517343 ScholiaQ127517343MaRDI QIDQ1127250

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

zbMATH Keywords

simulationqueueing networksblockingfinite capacitythroughputmean waiting timeapproximation procedurecustomer losstwo-parameter approximation

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items

Parametric nonlinear programming for analyzing fuzzy queues with finite capacity ⋮ 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 ⋮ 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 ⋮ 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₁→ ⋅/D/1/K₂Queues

Cites Work

• An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis
• Monotonicity of throughput in non-Markovian networks
• Approximate Analysis of General Queuing Networks by Decomposition
• Accuracy of the Diffusion Approximation for Some Queuing Systems
• The Interrupted Poisson Process As An Overflow Process
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item