Deadlock free buffer allocation in closed queueing networks
From MaRDI portal
Recommendations
- Buffer allocation in general single-server queueing networks
- Allocation of buffer capacities in queueing networks with arbitrary topologies
- Server allocation for zero buffer tandem queues
- Buffer and server allocation in general multi-server queueing networks
- Modelling deadlock in open restricted queueing networks
- Matrix approach to deadlock-free dispatching in multi-class finite buffer flowlines
- A Variable Buffer-Size Model and Its Use in Analyzing Closed Queueing Networks with Blocking
- Properties and performance bounds for closed free choice synchronized monoclass queueing networks
- Optimal buffer allocation in finite closed networks with multiple servers
Cites work
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- Approximate analysis of exponential queueing systems with blocking
- Cyclic Queuing Systems with Restricted Length Queues
- Finite Capacity Queuing Systems with Applications in Computer Modeling
- On equivalencies of blocking mechanisms in queueing networks with blocking
- Product form approximations for queueing networks with multiple servers and blocking
Cited in
(6)- Approximating the buffer allocation problem using epochs
- Deadlock properties of queueing networks with finite capacities and multiple routing chains
- Modelling deadlock in open restricted queueing networks
- Requirements for deadlock-free, adaptive packet routing
- On the Use of Structural Petri Net Analysis for Studying Product Form Equilibrium Distributions of Queueing Networks with Blocking
- Predicting deadlock in store‐and‐forward networks
This page was built for publication: Deadlock free buffer allocation in closed queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115027)
