Asymptotically exact decomposition approximations for open queueing networks

DOI10.1016/0167-6377(90)90055-AzbMath0711.60093OpenAlexW2057808525MaRDI QIDQ923525

Martin I. Reiman

Publication date: 1990

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90055-a

zbMATH Keywords

heavy trafficqueueing networkstraffic intensitybottleneck analysisdecomposition approximationsmean sojourn times

Mathematics Subject Classification ID

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

Related Items (5)

A robust queueing network analyzer based on indices of dispersion ⋮ Modeling and Design of Container Terminal Operations ⋮ The heavy-traffic bottleneck phenomenon in open queueing networks ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Towards better multi-class parametric-decomposition approximations for open queueing networks

Cites Work

• Unnamed Item
• Stochastic discrete flow networks: Diffusion approximations and bottlenecks
• 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
• Approximate Analysis of General Queuing Networks by Decomposition
• Limit Theorems for Queueing Networks. I
• Networks of Waiting Lines
• Multiple channel queues in heavy traffic. I

This page was built for publication: Asymptotically exact decomposition approximations for open queueing networks