Analysis of Stochastic Online Bin Packing Processes

Abstract

A stochastic online version of the classical bin packing problem, where a bin corresponds to the capacity of a resource allocated among streams of requests at discrete time units, is a fundamental problem that arises in a wide variety of application areas including bandwidth allocation in networks, memory management in computers, and message transmission in slotted network channels. We derive a mathematical analysis of the corresponding multi-dimensional stochastic process, potentially infinite in each dimension, under a general class of scheduling policies based on a combination of a Lyapunov function technique and matrix-analytic methods. Our analysis yields stability conditions and stationary distributions for this stochastic bin packing process under general probability distributions. We further provide some algorithmic techniques for the numerical computation of these measures.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 11 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.