Properties and performance bounds for closed free choice synchronized monoclass queueing networks
From MaRDI portal
Publication:3986804
Recommendations
- Two classes of performance bounds for closed queueing networks
- Performance bounds for scheduling queueing networks
- Throughput bounds for closed queueing networks
- A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
- Performance bounds for queueing networks and scheduling policies
- Simple bounds for closed queueing networks
- scientific article; zbMATH DE number 4068580
- On a class of approximations for closed queueing networks
Cited in
(7)- Regular marked Petri nets
- \(\{\mathrm{SC}\}^\ast\mathrm{ECS}\): a class of modular and hierarchical cooperating systems
- Deadlock free buffer allocation in closed queueing networks
- Structure theory of equal conflict systems
- Performance bounds for stochastic timed Petri nets
- Petri nets for the design and operation of manufacturing systems
- scientific article; zbMATH DE number 4037223 (Why is no real title available?)
This page was built for publication: Properties and performance bounds for closed free choice synchronized monoclass queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986804)