Correctness within a constant of an optimal buffer allocation rule of thumb
From MaRDI portal
Publication:4838640
DOI10.1109/18.335897zbMath0821.94002OpenAlexW2113903460MaRDI QIDQ4838640
Ayalvadi J. Ganesh, Venkat Anantharam
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
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Circuits, networks (94C99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication theory (94A05)
Related Items (3)
Optimal buffer allocation in tandems of last come first served queues ⋮ Asymptotics of overflow probabilities in Jackson networks. ⋮ 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