The throughput of a series of buffers

From MaRDI portal

Revision as of 00:03, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3962291

Jump to:navigation, search

DOI10.2307/1426678zbMath0497.60084OpenAlexW2095024651MaRDI QIDQ3962291

F. P. 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 values blocking series of queues job-shops throughput communication channels

Mathematics Subject Classification ID

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

Related Items (5)

Effective bandwidths at multi-class queues ⋮ Asymptotically optimal control of parallel tandem queues with loss ⋮ 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 ⋮ Blocking, reordering, and the throughput of a series of servers

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3962291&oldid=17668075"