The throughput of a series of buffers

DOI10.2307/1426678zbMATH Open0497.60084OpenAlexW2095024651MaRDI QIDQ3962291FDOQ3962291

Authors: Frank Kelly 

Publication date: 1982

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1426678

zbMATH Keywords

extreme valuesblockingseries of queuesjob-shopsthroughput communication channels

Mathematics Subject Classification ID

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

Cited In (5)

• Asymptotically optimal control of parallel tandem queues with loss
• Treelike queueing networks: Asymptotic stationarity and heavy traffic
• Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
• Effective bandwidths at multi-class queues
• Blocking, reordering, and the throughput of a series of servers

This page was built for publication: The throughput of a series of buffers

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