The optimal buffer allocation problem
From MaRDI portal
Recommendations
- Buffer allocation in general single-server queueing networks
- Optimal buffer allocation in tandems of last come first served queues
- Optimal buffer allocation in a two-stage queueing system
- Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers
- Optimal server allocation in general, finite, multi-server queueing networks
Cited in
(15)- On adaptive allocation of the buffer memory of a packet switching node
- Allocation of buffer capacities in queueing networks with arbitrary topologies
- Buffer allocation for an integer nonlinear network design problem
- Asymptotics of overflow probabilities in Jackson networks.
- Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers
- A buffer minimization problem for the design of embedded systems
- Optimal buffer allocation in tandems of last come first served queues
- The time buffer approximated buffer allocation problem: a row-column generation approach
- Stationary tail probabilities in exponential server tandems with renewal arrivals
- Buffer and server allocation in general multi-server queueing networks
- scientific article; zbMATH DE number 541196 (Why is no real title available?)
- Approximating the buffer allocation problem using epochs
- Optimal buffer allocation in a two-stage queueing system
- scientific article; zbMATH DE number 2247815 (Why is no real title available?)
- Buffer allocation in flow-shop-type production systems with general arrival and service patterns
This page was built for publication: The optimal buffer allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4734595)