Traffic and failure aware VM placement for multi-tenant cloud computing

In a multi-tenant cloud, tenants want to receive reliable services and the cloud provider intends to reduce intranetwork traffic in order to provide more services. Achieving the requirements of both sides is a challenging problem. Current tenant abstraction models cannot provide enough information for the cloud provider to optimize network traffic while satisfying reliability requirements. Based on the analysis of the traffic traces of a real multi-tenant cloud, we develop a new tenant abstraction model and design a novel virtual machine placement algorithm, called NETMAP. NETMAP optimizes the cost of network traffic incurred by tenant applications under the reliability constraints from the tenants. Trace-driven simulation results show that NETMAP outperforms a number of possible solutions. Even if there is traffic estimation error from the abstraction model, NETMAP still yields an optimized VM placement.

[1]  Nair Maria Maia de Abreu,et al.  A survey for the quadratic assignment problem , 2007, Eur. J. Oper. Res..

[2]  Hitesh Ballani,et al.  Towards predictable datacenter networks , 2011, SIGCOMM 2011.

[3]  Sujata Banerjee,et al.  Application-driven bandwidth guarantees in datacenters , 2015, SIGCOMM.

[4]  Aart J. C. Bik,et al.  Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.

[5]  Xin Li,et al.  Low-complexity multi-resource packet scheduling for network function virtualization , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[6]  Helen J. Wang,et al.  SecondNet: a data center network virtualization architecture with bandwidth guarantees , 2010, CoNEXT.

[7]  Ye Yu,et al.  N I ] 2 6 A ug 2 01 4 Space Shuffle : A Scalable , Flexible , and High-Bandwidth Data Center Network , 2014 .

[8]  Ion Stoica,et al.  Coflow: a networking abstraction for cluster applications , 2012, HotNets-XI.

[9]  GhemawatSanjay,et al.  The Google file system , 2003 .

[10]  Vijay V. Vazirani,et al.  Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[11]  Navendu Jain,et al.  Understanding network failures in data centers: measurement, analysis, and implications , 2011, SIGCOMM.

[12]  Haitao Wu,et al.  BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.

[13]  Ning Ding,et al.  The only constant is change: incorporating time-varying network reservations in data centers , 2012, SIGCOMM.

[14]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[15]  David A. Maltz,et al.  Surviving failures in bandwidth-constrained datacenters , 2012, CCRV.

[16]  Vasileios Pappas,et al.  Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement , 2010, 2010 Proceedings IEEE INFOCOM.

[17]  Albert G. Greenberg,et al.  A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.

[18]  Yuan Yu,et al.  Dryad: distributed data-parallel programs from sequential building blocks , 2007, EuroSys '07.

[19]  Vijay V. Vazirani,et al.  Finding k Cuts within Twice the Optimal , 1995, SIAM J. Comput..

[20]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[21]  Nathan Farrington,et al.  Facebook's data center network architecture , 2013, 2013 Optical Interconnects Conference.

[22]  Jörg Fliege,et al.  Steepest descent methods for multicriteria optimization , 2000, Math. Methods Oper. Res..

[23]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[24]  Wenzhi Cui,et al.  DiFS: Distributed flow scheduling for adaptive routing in hierarchical data center networks , 2014, 2014 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).