M. Ajtai, J. Komlós, and G. Tusnády, On optimal matchings, Combinatorica, vol.8, issue.4, pp.259-264, 1984.
DOI : 10.1007/BF02579135

F. Baccelli and P. Brémaud, Elements of queueing theory, Palm martingale calculus and stochastic recurrences, Stochastic Modelling and Applied Probability, 2003.
DOI : 10.1007/978-3-662-11657-9

F. Baccelli and S. Foss, On the saturation rule for the stability of queues, Journal of Applied Probability, vol.12, issue.02, pp.494-507, 1995.
DOI : 10.1214/aoap/1177005203
URL : https://hal.archives-ouvertes.fr/inria-00074656

J. L. Bentley, D. S. Johnson, F. T. Leighton, C. C. Mcgeoch, and L. A. Mcgeoch, Some unexpected expected behavior results for bin packing, Proceedings of the sixteenth annual ACM symposium on Theory of computing , STOC '84, pp.279-288, 1984.
DOI : 10.1145/800057.808692

E. G. Coffman, J. , A. Feldmann, N. Kahale, and B. Poonen, COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS, Probability in the Engineering and Informational Sciences, vol.13, issue.04, pp.387-406, 1999.
DOI : 10.1017/S0269964899134016

E. G. Coffman, J. , D. S. Johnson, P. W. Shor, and R. R. Weber, Bin packing with discrete item sizes. II. Tight bounds on first fit. Random Structures Algorithms Average-case analysis of algorithms, pp.69-101, 1995.

E. G. Coffman, J. , and G. S. Lueker, Probabilistic analysis of packing and partitioning algorithms. Wiley-Interscience Series in Discrete Mathematics and Optimization, 1991.

E. G. Coffman, J. , and A. L. Stolyar, Bandwidth packing, Algorithmica, vol.1, issue.4, pp.70-88, 1998.
DOI : 10.1007/BF02679614

J. Dantzer and P. Robert, Fluid limits of string valued Markov processes, The Annals of Applied Probability, vol.12, issue.3, pp.860-889, 2002.
DOI : 10.1214/aoap/1031863172

J. E. Coffman, M. R. Garey, and D. S. Johnson, Approximation Algorithms for Bin-Packing ??? An Updated Survey, pp.46-93, 1997.
DOI : 10.1007/978-3-7091-4338-4_3

D. Gamarnik, Stochastic Bandwidth Packing Process: Stability Conditions via Lyapunov Function Technique, Queueing Systems, vol.48, issue.3/4, pp.339-363, 2004.
DOI : 10.1023/B:QUES.0000046581.34849.cf

R. M. Karp, M. Luby, and A. Marchetti-spaccamela, A probabilistic analysis of multidimensional bin packing problems, Proceedings of the sixteenth annual ACM symposium on Theory of computing , STOC '84, pp.289-298, 1984.
DOI : 10.1145/800057.808693

C. Kipnis and P. Robert, A dynamic storage process. Stochastic Process, Appl, vol.34, issue.1, pp.155-169, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00075839

L. Kleinrock, Queueing Systems, 1975.

T. Leighton and P. Shor, Tight bounds for minimax grid matching with applications to the average case analysis of algorithms, Combinatorica, vol.9, issue.3, pp.161-187, 1989.
DOI : 10.1007/BF02124678

M. Lelarge, Optimal bandwidth packing with symmetric distribution

M. Lelarge, Tail asymptotics for monotone-separable networks, J. Appl. Probab, vol.44, issue.2, 2007.

D. Shah and J. N. Tstsiklis, Bin packing with queues, 2006.

P. W. Shor, The average-case analysis of some on-line algorithms for bin packing, Theory of computing, pp.179-200, 1984.
DOI : 10.1007/BF02579171

P. W. Shor, How to pack better than best fit: tight bounds for average-case online bin packing, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.752-759, 1991.
DOI : 10.1109/SFCS.1991.185444

M. Talagrand, Matching theorems and empirical discrepancy computations using majorizing measures, Journal of the American Mathematical Society, vol.7, issue.2, pp.455-537, 1994.
DOI : 10.1090/S0894-0347-1994-1227476-X