Overcommitment in Cloud Services: Bin Packing with Chance Constraints

This paper considers a traditional problem of resource allocation: scheduling jobs on machines. One such recent application is cloud computing; jobs arrive in an online fashion with capacity requirements and need to be immediately scheduled on physical machines in data centers. It is often observed that the requested capacities are not fully utilized, hence offering an opportunity to employ an overcommitment policy, that is, selling resources beyond capacity. Setting the right overcommitment level can yield a significant cost reduction for the cloud provider while only inducing a very low risk of violating capacity constraints. We introduce and study a model that quantifies the value of overcommitment by modeling the problem as bin packing with chance constraints. We then propose an alternative formulation that transforms each chance constraint to a submodular function. We show that our model captures the risk pooling effect and can guide scheduling and overcommitment decisions. We also develop a family of online algorithms that are intuitive, easy to implement, and provide a constant factor guarantee from optimal. Finally, we calibrate our model using realistic workload data and test our approach in a practical setting. Our analysis and experiments illustrate the benefit of overcommitment in cloud services and suggest a cost reduction of 1.5% to 17%, depending on the provider’s risk tolerance. The online appendices are available at https://doi.org/10.1287/mnsc.2018.3091 . This paper was accepted by Yinyu Ye, optimization.

• 저널Management Science · 65(7) · 3255–3271
• 토픽Optimization and Search Problems · Computer Networks and Communications
• DOI10.1287/mnsc.2018.3091
• 저자Maxime C. Cohen, Philipp W. Keller, Vahab Mirrokni, Morteza Zadimoghaddam