Allocation of buffer capacities in queueing networks with arbitrary topologies
From MaRDI portal
Recommendations
- Buffer allocation in general single-server queueing networks
- Optimal buffer allocation in finite closed networks with multiple servers
- Combining routing and buffer allocation problems in series-parallel queueing networks
- The optimal buffer allocation problem
- Optimal server allocation in general, finite, multi-server queueing networks
Cites work
- scientific article; zbMATH DE number 3878642 (Why is no real title available?)
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
- Design of manufacturing systems using queueing models
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- Influence of Storage Bin Capacity on the Average Standstill Time of a Production Line
- On equivalencies of blocking mechanisms in queueing networks with blocking
Cited in
(10)- Optimal buffer allocation in finite closed networks with multiple servers
- Buffer allocation in general single-server queueing networks
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- Deadlock free buffer allocation in closed queueing networks
- Markovian approximations for a grid computing network with a ring structure
- Multi-server, Finite Waiting Room,M/G/c/KOptimization Models
- Allocation of flows in closed bipartite queueing networks
- Combining routing and buffer allocation problems in series-parallel queueing networks
- Capacity allocation in generalized Jackson networks
- Topological network design of general, finite, multi-server queueing networks
This page was built for publication: Allocation of buffer capacities in queueing networks with arbitrary topologies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315349)
