An integrated resource allocation scheme for multi-tenant data-center
Authors:
- 1 October 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 496-504
Abstract
The success of multi-tenant data-centers depends on the ability to provide performance guarantees in terms of the resources provisioned to the tenants. As bandwidth is shared in a best-effort way in today's data-centers, traffic generated between a set of VMs affect the traffic between another set of VMs sharing the same physical links. This paper proposes an integrated resource allocation scheme that considers not only server-resources, but also network-resource, to decide the mapping of VMs onto servers. We present a three-phase mechanism that finds the right set of servers for the requested VMs, with an aim of reducing the bandwidth on shared links. This mechanism provisions the required bandwidth for the tenants, besides increasing the number of tenants that can cohabit in a data-center. We demonstrate, using simulations, that the proposed scheme accommodates 10%-23% more requests in comparison to a load-balancing allocator that does not consider bandwidth requirements of VMs.Keywords
This publication has 9 references indexed in Scilit:
- FairCloud2011
- The price is right2011
- CloudNaaS2011
- Towards predictable datacenter networks2011
- SecondNet2010
- Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement2010
- A scalable, commodity data center network architecture2008
- OpenFlowACM SIGCOMM Computer Communication Review, 2008
- A simple min-cut algorithmJournal of the ACM, 1997