Next-fit bin packing with random piece sizes

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.