The optimal buffer allocation problem

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...

Full description

Bibliographic Details

Published in:	IEEE transactions on information theory Vol. 35; no. 4; pp. 721 - 725
Main Author:	Anantharam, V.
Format:	Journal Article Conference Proceeding
Language:	English
Published:	New York, NY IEEE 01.07.1989 Institute of Electrical and Electronics Engineers
Subjects:	Analytical models Application software Applied sciences Buffer overflow Computer networks Context modeling Exact sciences and technology Joining processes Manufacturing systems Network servers Operational research and scientific management Operational research. Management science Queuing theory. Traffic theory Routing Space stations
ISSN:	0018-9448
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!