Stochastic concavity of throughput in series of queues with finite buffers
From MaRDI portal
Publication:3198667
DOI10.2307/1427471zbMATH Open0713.60099OpenAlexW2043901597MaRDI QIDQ3198667FDOQ3198667
Authors: Venkat Anantharam, Pantelis Tsoucas
Publication date: 1990
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1427471
Recommendations
- Concavity of the throughput of tandem queueing systems with finite buffer storage space
- A stochastic directional convexity result and its application in comparison of queues
- A note on stochastic bounds for queueing networks
- Asymptotic bounds of throughput in series-parallel queueing networks
- scientific article; zbMATH DE number 6814344
- scientific article; zbMATH DE number 3433322
- On the dynamics of a finite buffer queue conditioned on the amount of loss
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (9)
- Concavity of the throughput of tandem queueing systems with finite buffer storage space
- Heuristic algorithms for buffer allocation in a production line with unreliable machines
- Concavity of system throughput and information transfer in a PAC system
- Title not available (Why is that?)
- A linguistic approach to stochastic comparison of queueing systems
- Coordinating quality, production and sales in manufacturing systems
- Second order properties in a tandem queue with general blocking
- Title not available (Why is that?)
- Structured buffer-allocation problems
This page was built for publication: Stochastic concavity of throughput in series of queues with finite buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3198667)