Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-10T17:42:43.122Z Has data issue: false hasContentIssue false
  • English
  • Français

Next-fit bin packing with random piece sizes

Published online by Cambridge University Press:  14 July 2016

Shlomo Halfin
Shlomo Halfin*
Affiliation:
Bell Communications Research
*
∗Postal address: Bell Communications Research, 445 South Street, P.O. Box 1910, Morristown, NJ 07960–1910, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Investigations into time-slotted communication channels for transmission of data packets led us to analyze the stochastic behavior of the next-fit bin packing algorithm. In this paper we obtain results for general piece-size distributions and truncated distributions, we calculate explicit solutions for the case of the truncated exponential, and we apply the results to calculate the maximal throughput of the time-slotted communication channel.

Keywords

COMMUNICATION CHANNELSDATA PACKETSTHROUGHPUTISDN
Type
Research Papers
Information
Journal of Applied Probability , Volume 26 , Issue 3 , September 1989 , pp. 503 - 511
Copyright
Copyright © Applied Probability Trust 1989 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Billingsley, P. (1968) Convergence of Probability Measures. Wiley, New York.Google Scholar
[2] Coffman, E. G., So, K., Hofri, M. and Yao, A. C. (1980) A stochastic model of bin packing. Inf. Control 44, 105–115.CrossRefGoogle Scholar
[3] Feller, W. (1971) An Introduction to Probability Theory and its Applications, Vol. 2, 2nd edn. Wiley, New York.Google Scholar
[4] Gaver, D. P. and Jacobs, P. A. (1980) Storage problems when demand is ‘all or nothing’. Naval Res. Log. Quart. 27, 529–538.CrossRefGoogle Scholar
[5] Hofri, M. (1984) A probabilistic analysis of the next-fit bin packing algorithm. J. Algorithms 5, 547–556.CrossRefGoogle Scholar
[6] Karmarkar, N. (1982) Probabilistic analysis of some bin-packing problems. Proc. 23rd Symp. Foundations of Computer Science, IEEE Computer Soc., Los Angeles, 107–111.Google Scholar
[7] Shiryayev, A. N. (1984) Probability. Springer-Verlag, Berlin.CrossRefGoogle Scholar