The throughput of a series of buffers

DOI10.2307/1426678MaRDI QIDQ3962291zbMATH OpenOpenAlexFDO

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

blockingextreme valuesjob-shopsseries of queuesthroughput communication channels

Mathematics Subject Classification ID

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

Cited in

(5)

• Effective bandwidths at multi-class queues
• Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
• Treelike queueing networks: Asymptotic stationarity and heavy traffic
• Asymptotically optimal control of parallel tandem queues with loss
• 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)