T. Dillon, C. Wu, and E. Chang, Cloud Computing: Issues and Challenges, 2010 24th IEEE International Conference on Advanced Information Networking and Applications, pp.27-33, 2010.
DOI : 10.1109/AINA.2010.187

T. Vercauteren, P. Aggarwal, X. Wang, and T. Li, Hierarchical Forecasting of Web Server Workload Using Sequential Monte Carlo Training, IEEE Transactions on Signal Processing, vol.55, issue.4, pp.1286-1297, 2007.
DOI : 10.1109/TSP.2006.889401

Z. Gong, X. Gu, and J. Wilkes, Press: Predictive elastic resource scaling for cloud systems, Network and Service Management (CNSM), 2010 International Conference on, pp.9-16

X. Meng, C. Isci, J. Kephart, L. Zhang, E. Bouillet et al., Efficient resource provisioning in compute clouds via VM multiplexing, Proceeding of the 7th international conference on Autonomic computing, ICAC '10, pp.11-20, 2010.
DOI : 10.1145/1809049.1809052

W. Voorsluys, J. Broberg, S. Venugopal, and R. Buyya, Cost of Virtual Machine Live Migration in Clouds: A Performance Evaluation, pp.254-265, 2009.
DOI : 10.1007/978-3-642-10665-1_23

M. R. Hines and K. Gopalan, Post-copy based live virtual machine migration using adaptive pre-paging and dynamic self-ballooning, Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments, VEE '09, pp.51-60, 2009.
DOI : 10.1145/1508293.1508301
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.1958

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

S. S. Seiden, On the online bin packing problem, Journal of the ACM, vol.49, p.2002, 2001.

E. Coffman-jr, C. János, A. Zsbán-chan, T. Lam, and P. W. Wong, Dynamic bin packing Dynamic bin packing of unit fractions items, SIAM J. COMPUT. Citeseer Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, pp.614-626, 1983.

J. Chan, P. Wong, and F. Yung, On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis, Algorithmica, vol.43, issue.5, pp.172-206, 2009.
DOI : 10.1007/s00453-008-9185-z
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.1176

Z. Ivkovi´civkovi´c and E. Lloyd, Fully dynamic algorithms for bin packing: Being (mostly) myopic helps, Algorithms-ESA'93, pp.224-235, 1993.

G. Gambosi, A. Postiglione, and M. Talamo, Algorithms for the Relaxed Online Bin-Packing Model, SIAM Journal on Computing, vol.30, issue.5, p.1532, 2000.
DOI : 10.1137/S0097539799180408

G. Woeginger, There is no asymptotic PTAS for two-dimensional vector packing, Information Processing Letters, vol.64, issue.6, pp.293-297, 1997.
DOI : 10.1016/S0020-0190(97)00179-8

C. Chekuri and S. Khanna, On multi-dimensional packing problems, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, pp.185-194, 1999.

N. Bansal, A. Caprara, and M. Sviridenko, Improved approximation algorithms for multidimensional bin packing problems, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.697-708, 2006.
DOI : 10.1109/FOCS.2006.38

A. Caprara, H. Kellerer, and U. Pferschy, Approximation schemes for ordered vector packing problems, Naval Research Logistics, vol.64, issue.1, pp.58-69, 2003.
DOI : 10.1002/nav.10058

L. Epstein and R. Van-stee, Approximation schemes for packing splittable items with cardinality constraints Approximation and Online Algorithms, pp.232-245, 2008.