The optimal buffer allocation problem
Published in IEEE Transactions on Information Theory • Jul 1, 1989
NobleIDNI9P62W81R93S96
Authors:
Venkat Anantharam
Abstract
Pathwise probabilistic arguments are used to justify a simple rule of thumb by which buffer allocation can be carried out. The model for the underlying network is the skeleton of an open Jackson network. The problem of how to distribute in the best possible way a fixed number N of available buffer s...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!