Probability Models for Buffer Storage Allocation Problems
Journal of the ACM (JACM)
A Stochastic Model for Message Assembly Buffering with a Comparison of Block Assignment Strategies
Journal of the ACM (JACM)
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Hi-index | 0.24 |
An analytical procedure is presented to evaluate the capacity required for channels used to transmit data from multiple-buffered concentrators used in data communications networks. Three message assembly procedures are compared. The parameters considered in the analysis are queuing discipline, buffer size, and computational complexity. The influence of these factors on channel capacity is examined. It is shown that the required channel capacity C for a first-come, first-served message assembly procedure satisfies C=