Deadlock free buffer allocation in closed queueing networks

DOI10.1007/BF01150855zbMath0664.60090OpenAlexW1965938341MaRDI QIDQ1115027

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

performance evaluationdeadlocksfinite buffersbuffer allocationBlocking queueing networks

Mathematics Subject Classification ID

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

Related Items (2)

Deadlock properties of queueing networks with finite capacities and multiple routing chains ⋮ Modelling deadlock in open restricted queueing networks

Cites Work

• Unnamed Item
• Approximate analysis of exponential queueing systems with blocking
• On equivalencies of blocking mechanisms in queueing networks with blocking
• Product form approximations for queueing networks with multiple servers and blocking
• Finite Capacity Queuing Systems with Applications in Computer Modeling
• Cyclic Queuing Systems with Restricted Length Queues

This page was built for publication: Deadlock free buffer allocation in closed queueing networks