Simple bounds for closed queueing networks
DOI10.1023/A:1019102112869zbMATH Open0948.90041MaRDI QIDQ1294081FDOQ1294081
Authors: Arie Harel, Su Namn, Jacob Sturm 
Publication date: 10 September 2000
Published in: Queueing Systems (Search for Journal in Brave)
Recommendations
lower boundmajorizationupper boundcomplete symmetric functionthroughputclosed queueing networksnormalization constantbalanced job boundsmean performance measures
Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (18)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic bounds of throughput in series-parallel queueing networks
- Title not available (Why is that?)
- Simple product-form bounds for queueing networks with finite clusters
- A family of bounds for the transient behavior of a Jackson network
- Title not available (Why is that?)
- New linear program performance bounds for closed queueing networks
- Throughput bounds for closed queueing networks
- An improved balanced job bound analysis of closed queueing networks
- Throughput bounds for closed queueing networks with queue-dependent service rates
- A zero-or-one law in aggregated closed queueing networks
- Properties and performance bounds for closed free choice synchronized monoclass queueing networks
- On a class of approximations for closed queueing networks
- Strong Approximations of Irreducible Closed Queueing Networks
- Two classes of performance bounds for closed queueing networks
- Performance bounds for scheduling queueing networks
- Blocking, reordering, and the throughput of a series of servers
This page was built for publication: Simple bounds for closed queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294081)
