Deadlock free buffer allocation in closed queueing networks

DOI10.1007/BF01150855MaRDI QIDQ1115027zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1989

Published in Queueing Systems (Search for Journal in Brave)

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

zbMATH Keywords

Blocking queueing networksbuffer allocationdeadlocksfinite buffersperformance evaluation

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25)

Review text

Blocking queueing networks are of much interest in performance analysis due to their realistic modeling capability. One important feature of such networks is that they may have deadlocks which can occur if the node capacities are not sufficiently large. A necessary and sufficient condition for the node capacities is presented such that the network is deadlock free. An algorithm is given for buffer allocation in blocking queueing networks such that no deadlocks will occur assuming that the network has the special structure called cacti-graph. An additional algorithm which takes linear time in the number of nodes, is presented to find cycles in cacti networks.

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

• Approximate analysis of exponential queueing systems with blocking
• Cyclic Queuing Systems with Restricted Length Queues
• Finite Capacity Queuing Systems with Applications in Computer Modeling
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• On equivalencies of blocking mechanisms in queueing networks with blocking
• Product form approximations for queueing networks with multiple servers and blocking

Cited in

(6)

• Modelling deadlock in open restricted queueing networks
• Deadlock properties of queueing networks with finite capacities and multiple routing chains
• Approximating the buffer allocation problem using epochs
• Requirements for deadlock-free, adaptive packet routing
• Predicting deadlock in store‐and‐forward networks
• On the Use of Structural Petri Net Analysis for Studying Product Form Equilibrium Distributions of Queueing Networks with Blocking

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)