The optimal buffer allocation problem

DOI10.1109/18.32150zbMath0684.60079OpenAlexW2129264205MaRDI QIDQ4734595

Venkat Anantharam

Publication date: 1989

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

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

zbMATH Keywords

open networknetworks of queuesnetwork with infinite buffers

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (5)

Optimal buffer allocation in tandems of last come first served queues ⋮ Approximating the buffer allocation problem using epochs ⋮ Asymptotics of overflow probabilities in Jackson networks. ⋮ Buffer allocation in flow-shop-type production systems with general arrival and service patterns ⋮ Stationary tail probabilities in exponential server tandems with renewal arrivals

This page was built for publication: The optimal buffer allocation problem