Throughput bounds for closed queueing networks
From MaRDI portal
performance evaluationasymptotic analysisnumerical evaluationthroughput boundstime-sharing systemsanalytical lower and upper boundsproduct-form closed queueing networksresponse time bounds
Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Recommendations
Cited in
(22)- Asymptotic bounds of throughput in series-parallel queueing networks
- scientific article; zbMATH DE number 3858811 (Why is no real title available?)
- Closed queueing network with a multiline transmission channel.
- Exact-order asymptotic analysis for closed queueing networks
- Performance bounds for modeling NUMA architectures
- An Analytical Throughput Approximation for Closed Fork/Join Networks
- scientific article; zbMATH DE number 4079146 (Why is no real title available?)
- An improved balanced job bound analysis of closed queueing networks
- New linear program performance bounds for closed queueing networks
- Extremal throughputs in free-choice nets
- Throughput bounds for closed queueing networks with queue-dependent service rates
- A tight bound on the throughput of queueing networks with blocking
- Realization probability and throughput sensitivity in a closed jackson network
- Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes
- Properties and performance bounds for closed free choice synchronized monoclass queueing networks
- Closed-Form Solution of a LAN Gateway Queueing Model
- Two classes of performance bounds for closed queueing networks
- Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates
- The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures
- Applications and Theory of Petri Nets 2005
- On the estimation of the throughput for a class of stochastic resources sharing systems
- Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints
This page was built for publication: Throughput bounds for closed queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3318506)
