scientific article; zbMATH DE number 3967617

MaRDI QIDQ3734819zbMATH OpenFDO

Authors Frank Kelly

Publication date 1984

zbMATH Keywords

queueing networksphenomenon of blockingreordering the sequence of messages

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• Blocking analysis and T(1) theorem
• Analysis of queueing networks with blocking
• Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking
• Asymptotic Estimates for Blocking Probabilities in a Large Multi-Rate Loss Network
• Blocking probabilities in large circuit-switched networks
• Blocking, efficiency and weighted optimality
• On the regularity of optimal dynamic blocking strategies
• scientific article; zbMATH DE number 3976735
• A tight bound on the throughput of queueing networks with blocking

Cited in

(9)

• Asymptotic bounds of throughput in series-parallel queueing networks
• scientific article; zbMATH DE number 3858811 (Why is no real title available?)
• Lockout of buffer storage: its effect on the performance of a ladder-type data-transfer track
• Segregating the Input to a Series of Buffers
• A Variable Buffer-Size Model and Its Use in Analyzing Closed Queueing Networks with Blocking
• A new approach for real-time reduction of blocking effect
• On the regularity of optimal dynamic blocking strategies
• Blocking, efficiency and weighted optimality
• scientific article; zbMATH DE number 3976735 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3734819)