Correctness within a constant of an optimal buffer allocation rule of thumb

DOI10.1109/18.335897MaRDI QIDQ4838640zbMATH OpenOpenAlexFDO

Authors Venkat Anantharam, Ayalvadi J. Ganesh

Publication date 12 July 1995

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

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

zbMATH Keywords

buffer allocationcommunication networksJackson networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic network models in operations research (90B15) Communication theory (94A05) Circuits, networks (94C99)

Cited in

(3)

• Asymptotics of overflow probabilities in Jackson networks.
• Optimal buffer allocation in tandems of last come first served queues
• Stationary tail probabilities in exponential server tandems with renewal arrivals

This page was built for publication: Correctness within a constant of an optimal buffer allocation rule of thumb

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