Bin Packing with Queues

We study the best achievable performance (in terms of the average queue size and delay) in a stochastic and dynamic version of the bin-packing problem. Items arrive to a queue according to a Poisson process with rate 2ρ, where ρ ∈ (0, 1). The item sizes are independent and identically distributed (i.i.d.) with a uniform distribution in [0, 1]. At each time unit, a single unit-size bin is available and can receive any of the queued items, as long as their total size does not exceed 1. Coffman and Stolyar (1999) and Gamarnik (2004) have established that there exist packing policies under which the average queue size is finite for every ρ ∈ (0, 1). In this paper we study the precise scaling of the average queue size, as a function of ρ, with emphasis on the critical regime where ρ approaches 1. Standard results on the probabilistic (but static) bin-packing problem can be readily applied to produce policies under which the queue size scales as O(h 2), where h = 1 / (1 - ρ), which raises the question of whether this is the best possible. We establish that the average queue size scales as Ω(hlogh), under any policy. Furthermore, we provide an easily implementable policy, which packs at most two items per bin. Under that policy, the average queue size scales as O(hlog3/2 h), which is nearly optimal. On the other hand, if we impose the additional requirement that any two items packed together must have near-complementary sizes (in a sense to be made precise), we show that the average queue size must scale as Θ(h 2).

[1]  Walter Knödel,et al.  A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit , 1981, MFCS.

[2]  George S. Lueker,et al.  Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[3]  Frank Thomson Leighton,et al.  Some unexpected expected behavior results for bin packing , 1984, STOC '84.

[4]  János Komlós,et al.  On optimal matchings , 1984, Comb..

[5]  Richard M. Karp,et al.  A probabilistic analysis of multidimensional bin packing problems , 1984, STOC '84.

[6]  Frank Thomson Leighton,et al.  Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms , 1986, STOC '86.

[7]  Peter W. Shor The average-case analysis of some on-line algorithms for bin packing , 1986, Comb..

[8]  Wansoo T. Rhee Optimal Bin Packing with Items of Random Sizes , 1988, Math. Oper. Res..

[9]  Wansoo T. Rhee,et al.  Optimal Bin Covering with Items of Random Size , 1989, SIAM J. Comput..

[10]  Wansoo T. Rhee,et al.  Optimal Bin Packing with Items of Random Sizes III , 1989, SIAM J. Comput..

[11]  Wansoo T. Rhee,et al.  Optimal Bin Packing with Items of Random Sizes II , 1989, SIAM J. Comput..

[12]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[13]  Dimitris Bertsimas,et al.  Stochastic Dynamic Vehicle Routing in the Euclidean Plane: The Multiple-Server, Capacitated Vehicle Case , 1990 .

[14]  Wansoo T. Rhee A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size , 1990, SIAM J. Comput..

[15]  D. Bertsimas,et al.  Stochastic and dynamic vehicle routing with general demand and interarrival time distributions , 1993, Advances in Applied Probability.

[16]  Wansoo T. Rhee Optimal Bin Packing of Items of Sizes Uniformly Distributed over [0, 1] , 1993, Math. Oper. Res..

[17]  Dimitris Bertsimas,et al.  Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles , 1993, Oper. Res..

[18]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[19]  Santosh S. Vempala,et al.  Approximating Multicast Congestion , 1999, ISAAC.

[20]  Daniele Vigo,et al.  Bin Packing Approximation Algorithms: Combinatorial Analysis , 1999, Handbook of Combinatorial Optimization.

[21]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[22]  David Gamarnik Stochastic Bandwidth Packing Process: Stability Conditions via Lyapunov Function Technique , 2004, Queueing Syst. Theory Appl..

[23]  Alexander L. Stolyar,et al.  Bandwidth packing , 2007, Algorithmica.