Blocking, reordering, and the throughput of a series of servers

DOI10.1016/0304-4149(84)90008-5zbMath0538.60087OpenAlexW1975348211MaRDI QIDQ793448

F. P. Kelly

Publication date: 1984

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-4149(84)90008-5

zbMATH Keywords

extreme valuesblockingAsymptotic boundsasymptotically positive throughputthroughput of a series of servers

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Communication, information (94A99) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (5)

Mathematical theory of queueing networks ⋮ Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection ⋮ Design of manufacturing systems using queueing models ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Approximation of departure process from a G/M/1/0 queueing system

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate analysis of exponential tandem queues with blocking
• Subadditive ergodic theory
• The throughput of a series of buffers
• Moment Convergence of Sample Extremes

This page was built for publication: Blocking, reordering, and the throughput of a series of servers