The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures
From MaRDI portal
Publication:4385166
DOI10.1287/moor.22.4.886zbMath0904.60072OpenAlexW2093432255WikidataQ123251108 ScholiaQ123251108MaRDI QIDQ4385166
No author found.
Publication date: 18 January 1999
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/63017fb863b803a06b654562579dee9c1cf0a632
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (6)
Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality. ⋮ Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions ⋮ Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks ⋮ Validity of heavy traffic steady-state approximations in generalized Jackson networks ⋮ New linear program performance bounds for queueing networks ⋮ Asymptotic loss of priority scheduling policies in closed re-entrant lines: A computational study
This page was built for publication: The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures
