Convexity in Queues With General Inputs

DOI10.1109/TIT.2004.840859MaRDI QIDQ3547415zbMATH OpenFDO

Authors Michael J. Neely, Eytan Modiano

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2004.840859

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• Convexity results for single-server queues and for multiserver queues with constant service times
• Strong Convexity Results for Queueing Systems
• Convexity properties of loss and overflow functions.
• Convexity Properties of the Erlang Loss Formula
• The convexity of a general performance measure for multiserver queues

Cited in

(5)

• Convexity of single stage queueing systems with bulk arrival
• Convexity properties of loss and overflow functions.
• Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies
• The buffer-bandwidth trade-off curve is convex
• A convexity property of the Poisson distribution and its application in queueing theory

This page was built for publication: Convexity in Queues With General Inputs

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