Allocation of buffer capacities in queueing networks with arbitrary topologies

DOI10.1007/BF02024519MaRDI QIDQ1315349zbMATH OpenFDO

Authors Hideaki Yamashita, Raif O. Onvural

Publication date 10 March 1994

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02024519

zbMATH Keywords

queueing networksservice models

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Dynamic programming (90C39)

Review text

The authors present two algorithms to allocate \(M\) buffers to \(N\) service stations which are connected in a feedforward manner. All service times and the interarrival times are assumed to be exponentially distributed. The algorithms use appropriate decompositions of the network followed by iterative improvements.

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

• 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
• scientific article; zbMATH DE number 3878642 (Why is no real title available?)
• 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)

• Topological network design of general, finite, multi-server queueing networks
• Deadlock free buffer allocation in closed queueing networks
• Capacity allocation in generalized Jackson networks
• Combining routing and buffer allocation problems in series-parallel queueing networks
• Optimal buffer allocation in finite closed networks with multiple servers
• Buffer allocation in general single-server queueing networks
• Markovian approximations for a grid computing network with a ring structure
• Allocation of flows in closed bipartite queueing networks
• Optimal routing and buffer allocation for a class of finite capacity queueing systems
• Multi-server, Finite Waiting Room,M/G/c/KOptimization Models

Describes a project that uses

Uses Software

• MARCA

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)