An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis

DOI10.1016/0166-5316(84)90024-5zbMath0533.90038OpenAlexW2049793797MaRDI QIDQ3316933

I. B. Gertsbakh, Oscar Bronshtein

Publication date: 1984

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(84)90024-5

zbMATH Keywords

open queueing networksPoisson arrivalslosseslimited bufferexponential serversjoint waiting space

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (3)

Approximate analysis for queueing networks with finite capacity and customer loss ⋮ A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes ⋮ Buffer allocation in flow-shop-type production systems with general arrival and service patterns

This page was built for publication: An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis