VCE-PSO: Virtual Cloud Embedding through a Meta-heuristic Approach

Resource allocation, an integral and continuously evolving part of cloud computing, has been attracting a lot of researchers in recent years. However, most of current cloud systems consider resource allocation only as placement of independent virtual machines, ignoring the performance of a virtual machine is also depending on other cooperating virtual machines and also the net links utilization, which result in a poor efficient resource utilization. In this paper, we propose a novel model Virtual Cloud Embedding (VCE) to formulate the cloud resource allocation problem. VCE regards each resource request as an integral unit rather than independent virtual machines including their link constraints. To address the VCE problem, we develop a meta-heuristic algorithm VCE-PSO, which is based on particle swarm optimization algorithm, to allocate multiple resources as a unit considering the heterogeneity of cloud infrastructure and variety of resource requirements. We exploit specific knowledge like the locations of virtual machines, inter-link distance, etc., to measure the fitness of different resource assignments, and utilize them to define the assignment update operation corresponding to the operations and steps of particle swarm optimization algorithm. Experiment results demonstrate that VCE-PSO can find an optimal resource assignment with 12% reduction of average link-mapped-path length than existing greedy algorithms.

[1]  Michael I. Jordan,et al.  Managing data transfers in computer clusters with orchestra , 2011, SIGCOMM.

[2]  T. S. Eugene Ng,et al.  The Impact of Virtualization on Network Performance of Amazon EC2 Data Center , 2010, 2010 Proceedings IEEE INFOCOM.

[3]  Minlan Yu,et al.  Rethinking virtual network embedding: substrate support for path splitting and migration , 2008, CCRV.

[4]  Martin Bichler,et al.  A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers , 2010, IEEE Transactions on Services Computing.

[5]  Saikat Guha,et al.  Generalized resource allocation for the cloud , 2012, SoCC '12.

[6]  Kang G. Shin,et al.  Adaptive control of virtualized resources in utility computing environments , 2007, EuroSys '07.

[7]  I. Stoica,et al.  FairCloud: sharing the network in cloud computing , 2011, CCRV.

[8]  Herodotos Herodotou,et al.  No one (cluster) size fits all: automatic cluster sizing for data-intensive analytics , 2011, SoCC.

[9]  Benjamin Hindman,et al.  Dominant Resource Fairness: Fair Allocation of Multiple Resource Types , 2011, NSDI.

[10]  Guy Pujolle,et al.  VNE-AC: Virtual Network Embedding Algorithm Based on Ant Colony Metaheuristic , 2011, 2011 IEEE International Conference on Communications (ICC).

[11]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[12]  Raouf Boutaba,et al.  Virtual Network Embedding with Coordinated Node and Link Mapping , 2009, IEEE INFOCOM 2009.

[13]  Amin Vahdat,et al.  PortLand: a scalable fault-tolerant layer 2 data center network fabric , 2009, SIGCOMM '09.

[14]  Xiang Cheng,et al.  Virtual network embedding through topology-aware node ranking , 2011, CCRV.

[15]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[16]  Albert G. Greenberg,et al.  VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.

[17]  Ion Stoica,et al.  True elasticity in multi-tenant data-intensive compute clusters , 2012, SoCC '12.

[18]  Chita R. Das,et al.  Modeling and synthesizing task placement constraints in Google compute clusters , 2011, SoCC.

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

[20]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.