scientific article; zbMATH DE number 3967617
From MaRDI portal
Publication:3734819
zbMATH Open0599.60082MaRDI QIDQ3734819FDOQ3734819
Authors: Frank Kelly 
Publication date: 1984
Title of this publication is not available (Why is that?)
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
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cited In (9)
- Asymptotic bounds of throughput in series-parallel queueing networks
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
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)
