A Novel Virtual Machine Placement in Cloud Computing

Transcription

1 Autralia Joural of Baic ad Applied Sciece, 5(10): , 2011 ISSN A Novel Virtual achie Placeet i Cloud Coputig 1 Ela ohaadi, 2 ohaadbager Karii, 3 Saeed aouli Heikalabad 1,2 Techical ad Egieerig Dept., Tabriz Brach, Ilaic Azad Uiverity, Tabriz, Ira. 3 Youg eearcher Club, Tabriz Brach, Ilaic Azad Uiverity, Tabriz, Ira. Abtrac: I thi paper a ovel virtual achie placeet echai for cloud coputig i propoed baed o etwork-aware virtual achie (V). V are widely applied to oder data ceter for cloud coputig a a key techology to realize eergy-efficiet operatio of erver. I uch a ceario, applicatio ad data thereof ca be hoted by variou etworked virtual achie. A applicatio, epecially data-iteive applicatio, ofte eed to couicate with data frequetly, the etwork iput ad output perforace would affect the overall applicatio perforace igificatly. Therefore, placeet of virtual achie which hot a applicatio ad igratio of thee virtual achie while the uexpected etwork latecy or cogetio occur i critical to achieve ad aitai the applicatio perforace. Our paper propoe a virtual achie placeet to iiizig the data trafer tie couptio. The iulatio reult how that the propoed approach i effective i optiizig the data trafer betwee the virtual achie ad data, thu helpig optiize the overall applicatio perforace. Key word: cloud coputig; virtual achie; etwork; placeet. INTODUCTION Cloud coputig (Arbrut et al., 2009) ha recetly received coiderable attetio i both acadeic couity ad idutrial couity a a ew coputig paradig to provide dyaically calable ad virtualized reource a a ervice over the Iteret. By thi ea, uer will be able to acce the reource, uch a applicatio ad data, fro the cloud aywhere ad aytie o dead. Curretly, everal large ifratructure copaie, uch Aazo (2010) Google (2010) Yahoo! (Cooper et al., 2009) icrooft (2010) IB (2010) ad Su, are developig cloud platfor for couer ad eterprie to acce the cloud reource through ervice. Data ceter i traditioal cocept that provide powerful coputig ad torage capacity for crucial area, uch a particle phyic, cietific coputig ad iulatio, earth obervatio ad oil propectig ad o o. A data ceter uually deploy hudred or thouad of blade erver which are deely packed to axiize the pace utilizatio ad aageet efficiecy. A the rapid growth of erver quatity ad cale, the eergy coued by the data ceter, which i directly related to the uber of hoted erver ad their workload, i becoig a great challege. A reported i (aghavedra et al., 2008) the power couptio of worldwide eterprie exceed $30 billio i The rated power couptio of erver have icreaed by 10 tie over the pat te year. What ore, it worth otig that the erver aageet ad aiteace cot ad electricity ad coolig cot i oder data ceter have exceeded the erver equipet cot. Due to the huge eergy cot i data ceter, there i a urget eed of deigig ad deployet of eergy-efficiet techologie for buildig a gree data ceter (Liu et al., 2009) Fortuately, The eergy couptio proble ha already attracted eough attetio (The gree 2010) ay effort have bee ade to iprove the eergy efficiecy of data ceter fro differet apect icludig proceor eergy efficiecy (Brook ad artooi 2001) torage power aageet (Carrera Piheiro ad Biachii 2003) ad etwork power aageet (Nedevchi et al., 2008). ecetly, with the rapid developet of virtualizatio techology, uch a Vware (Waldpurger 2002) Xe (Barha et al., 2003) KV (Kivity 2007) OpeVZ (Opevz 2010) ore ad ore data ceter ue thi techology to build ew geeratio data ceter architecture to upport cloud coputig due to the beefit uch a iprovig reource utilizatio, reducig cot, eaig erver aageet. What ore, erver coolidatio ad live igratio of virtual achie are two crucial ethod to achieve load balacig ad eergy avig. Server coolidatio which allowig ultiple erver ruig i a igle phyical erver iultaeouly i a ai approach to achieve better eergy efficiecy of data ceter. It i becaue i doig o, erver coolidatio allow ore phyical erver to be tured off via live igratig the virtual achie to other uaturated phyical erver. I uch a eviroet, the V that execute a applicatio i placed o a phyical achie i order to ue the local coputatio reource to execute the required tak. At the ae tie, data ca be tored with oe geographical or logical ditace (i.e. Aazo S3 etc) ad thee data are acceible to cloud-baed applicatio (Brook ad artooi 2001) For a data-iteive applicatio i cloud coputig, the requeted data ight be pread i a uber of vatly ditributed data ceter. A a applicatio, epecially a data-iteive applicatio, ofte eed to couicate with related data frequetly, the etwork I/O perforace betwee the data ceter that tore the data ad V that execute the applicatio could affect the perforace of the applicatio Correpodig Author: Ela ohaadi, Techical ad Egieerig Dept., Tabriz Brach, Ilaic Azad Uiverity, Tabriz, Ira E-ail: [email protected] 1549

2 igificatly. Curret V placeet policy aily focue o the effectivee ad efficiecy of the coputig reource utilizatio (Buyya aja ad Calheiro 2009: Tag et al., 2007: Va Tra ad eaud 2009). wherea the etwork apect are largely igored. Thi ight ake a V that execute a applicatio be placed o phyical achie that are far away fro the data ceter that tore the related data. A a reult, the overall applicatio perforace ad the yte overhead would evetually deteriorate due to the cotly data trafer tie betwee the applicatio ad the data torage. Furtherore, the virtualizatio ad proceor harig over phyical achie ofte reult i the itability of the couicatio withi a cloud coputig eviroet. For exaple, the TCP/UDP throughput betwee the all itace i Aazo EC2 varie betwee 1Gb/ ad 0 frequetly (Guohui et al., 2010). The uaticipated etwork cogetio ad latecy place aother challege to optiizig the data trafer tie betwee V ad the related data. Thi reearch addree the above iue ad propoe a policy to place the V with coideratio of the etwork I/O requireet. I additio, a V igratio policy i preeted to deal with the ituatio i which the utable etwork coectio deteriorate the applicatio perforace ad likely to jeopardize the exitig agreeet betwee the cloud ervice provider ad the ed uer. The ret of thi paper i orgaized a follow. I Sectio 2, the related work i dicued. Sectio 3 explai the propoed etwork-aware V placeet ad igratio approach. After that, Sectio 4 preet the experietal reult, followed by the cocluio ad future work i Sectio 5. Backgroud Ad otivatio: Variou aageet trategie have bee developed to effectively reduce the power couptio fro differet apect; however they caot be directly applied to today data ceter that rely o virtualizatio techologie. Virtual achie techology ca efficietly aage the erver coolidatio, ad iprove the total power efficiecy i data ceter (Nathuji ad K. Schwa 2007). Uually, coteporary V placeet approache focu o optiizig the efficiecy ad effectivee of coputatio reource utilizatio, allowig V to hare the capacity of coputatio reource o the phyical hot. The V placeet proble i odeled a either the Cotrait Satifactio Proble (CSP) (Va Tra ad eaud 2009) or the Cotrait ultiple Kapack Proble (CKP) (Tag et al., 2007) to axiize the utility of coputig reource. Other approache focu o iiizig the cot of uig coputig reource (Ki ad Elli 2005). Thee approache largely igored the etwork perforace ad it ipact o the overall applicatio perforace. V would be allocated with a o-optiized phyical ditace to the relevat data. Thi would the caue a extra data trafer overhead ad evetually lead to the degradatio of applicatio copletio tie. Thi drawback ake the tatitic ethod baed V allocatio or igratio approache hard to fit a rutie circutace. The optiizatio approach hould be ipleeted o the applicatio that iteract with certai data i a relatively log ter. Yet, if the applicatio couicate with data i a hort tie, the lack of tatitic ay caue thee allocatio or igratio approache iapplicable. Propoed Approache: Proble Stateet: Our proble tateet ca be briefly decribed a follow: 1- phyical achie are available ad their reource capacitie give alog eory, CPU ad Network badwidth dieio. 2- There are N virtual achie to be placed. The requireet of thee virtual achie are give alog the dieio of eory, CPU ad etwork badwidth. 3- We have to fid a appig betwee V ad P that atifie the V reource requireet while iiizig the uber of phyical achie ued. While fidig uch a appig, we have to take care that the total reource requireet of the V placed o a P hould ot exceed it capacity. Alo, we pla to iclude the iforatio of affiity betwee two virtual achie while obtaiig uch a appig. We alo pla to hadle the cae of availability of oly a retricted et of P for a give V for placeet. Sceario: Data ceter that are operated by a cloud ot oly provide a flexible data torage pace (e.g Aazo S3 etc.) but alo upport the uderlyig virtualizatio ifratructure. Thi iovated techology facilitate the uer to requet data torage pace ad coputatio reource to for oe or ore V with arbitrary coputatioal capacity. Figure 1 how the ceario i which uer requet the data torage pace ad V to tore data ad hot applicatio to proce thee data, repectively. I thi ceario, the applicatio requet to acce the related data acro the Iteret or Itraet ad the lik betwee the cloud ight be logical or phyical. 1550

3 Fig. 1: The Studied Sceario. Uder curret V allocatio policy, it ca be ee that the data i tored arbitrarily ad ca be ditributed vatly acro the whole torage cloud or eve over everal torage cloud. The applicatio are allocated by the broker regardle of the data acce tie. Thi will reult i the proble that the applicatio ay acce it related data over a ueceary ditace. To olve thi proble, the propoed V placeet ad igratio approach could be deployed i the hot broker to allocate the V to the phyical achie with a iiized data acce tie. The V placeet Approach: Withi the cotext of cloud coputig, the data for a give applicatio could be ditributed i everal block ad the block could be tored with logical/phyical ditace. Accordig to the tatu of data ditributio, a data ditribute atrix i,j ca be ipleeted a: i, j i 1,1 2,1,1 1,2 2,2 i,2 1, j 2, j i, j Here, the colu uber j repreet the total uber of data which will be acceed by the applicatio ad the row uber repreet the uber of data torage ode. I additio, for each colu of the atrix D i,j each data hould atify the followig relatiohip: i c 1 Size j (1) c, j The etwork peed betwee a phyical achie which hot the V ad a data torage ode i repreeted by fuctio Speed, aely S Data trafer rate, t (2) Here, repreet the ize of the package ad Δt i the package trafer tie lot. Withi a certai tie iterval, the etwork peed could be fluctuated. I additio, the data trafer peed could be differet for differet applicatio. The value of each eleet i atrix S, i the ivere of the Speed(, Δt) betwee the phyical achie ad the data torage ode. Therefore, the atrix S, ca be obtaied a follow: 1551

4 S, 1,1 2,1,1 1,2 2,2,2 1, 2,, Oe of our atrixe are the reource requireet of each virtual achie to be placed. To capture thee requireet alog variou dieio, we defie a requireet atrix a follow: equiree t atrix 1,1 2,1,1 1,2 2,2,2 1, d 2, d, d Where each r ij idicate the requireet of V i alog the dieio j. A aple requireet atrix i how below: I thi atrix, each row correpod to oe virtual achie requireet alog the dieio of CPU, eory ad etwork I/O. For exaple, the firt row pecifie that the correpodig V ue 20% of CPU, 40% of eory ad 30% of etwork capacity of a phyical achie. The data acce tie atrix T,i repreet the data acce tie fro each phyical achie to the related data. The atrix T,i ca be obtaied by followig forula: T, i i, j S,, d (3) Auig that the coputig reource et: C P, (4) Idicate the total coputatio capacity o a phyical achie, where the otatio P repreet the proceor capacity o the phyical achie ad deote the eory capacity o the phyical achie. The et: occupied Vi Vi C P, (5) epreet the coputatio capacity requireet of Vi. Therefore, the available coputig reource et ca be repreeted a: C P, i1, P Pvi (6) vi i1 Where idicate the uber of ruig V. Uig C P, (7) 1552

5 Deote the coputatio capacity requireet of the arrivig V, if the available coputatio reource o the phyical achie atifie P P vi P i1 vi (8) Ad vi i1 vi (9) The the V would be placed o thi phyical achie. For iplicity, we ue C C VArrivig to idicate the relatiohip i (10) ad (11). After the placeet of the arrivig V, the ew available coputatio reource ca be obtaied by the forula: C P P Vi, Vi (10) For α give applicatio _ that requet data d1, d2,, d_, the proce of propoed etwork-aware V placeet algorith ca be deotrated by the followig peudo code: Iput: data torage atrix i,j Iput: etwork tatu atrix S, Iput: etwork tatu atrix, d Iput: a coig applicatio requeted data et 1. Calculatig data trafer tie atrix 2. Travere all of the colu i the atrix T,i to fid the iiu y 1 T x, y & & C C retur x; Allocatig the arrivig V o the hot h x. if (the V i allocated ucceed ) C P P, ed if Vi Vi Experiet: To evaluate the effectivee of the propoed approach, a experiet ha bee deiged ad coducted. The propoed V placeet policy i ipleeted ad teted uig Cloudi 2.0 which upport odelig ad tiulatig oe or ore V o a tiulated data ceter (Arbrut et al., 2009; ). I the experiet, we focued o the average tak copletio tie ad copared our policy with the default V placeet policy adopted by Cloudi 2.0. Beide, the atrix (S, ) i odified i the experiet to tiulate a degradatio of data acce tatu. I the iitial phae of the experiet, 2 file (i.e., data), file1, file2, are tored i 2 torage, torage0 ad torage1. The ize of the file i 6000B, 8000B repectively. Here, file1 i tored i torage0, wherea file2 tored i torage1. We ipleeted oe data ceter, dataceter0, with 2 hot (i.e., phyical achie), hot0, hot1. Each hot ha a fixed coputatio capacity. The coectio peed betwee the hot ad torage are repreeted by a 3x 2 atrix, ad the torage of data i defied by a 2x3 atrix. Baed o the V allocatio policy, we ca calculate a 3x3 data trafer tie atrix. I thi experiet, the data trafer tie i et a: The copario of the average tak copletio tie i two group are how i Figure 2, 3, repectively. It i clear that the propoed approach reulted i horter average tak copletio tie i all two group. I fact, the declie of the average tak copletio tie i caued by the optiized locatio of the hoted V, coparig 1553

6 with two differet V allocatio policie. The reult proved that the propoed etwork aware V allocatio policy ca lead to iproved tak copletio tie. Fig. 2: The eult of Cloudlet equetig file1. Fig. 3: The eult of Cloudlet equetig file2. Cocluio ad Future Work: While the data-iteive applicatio iteract with ditributed data i a cloud coputig eviroet, the etwork tatu betwee the applicatio ad data could ifluece the perforace of the applicatio igificatly. Thu, it i eceary to cotrol the locatio of the V o that the applicatio hoted by the V ca obtai a horter data acce tie. To addre thi iue, thi paper preet a etwork aware V placeet ad igratio approach for data iteive applicatio i cloud coputig eviroet. The propoed approach place the V o phyical achie with coideratio of the etwork coditio betwee the phyical achie ad the data torage. Therefore, it i poible that a hot i perfect for everal requet iultaeouly but the yte would ot be able to chedule all of the tak i the cloud. Thi ay lead to a poibility that oe uer tak alway occupy a fater lik o the etwork. To olve thi iue, it i eceary to exted a payet echai o that the yte ca et priority to the uer accordig to their payet. EFEENCES Aazo elatic copute cloud (ec2), Google app egie, Ib blue cloud project, icrooft 2010 azure cloud platfor, Opevz: Server virtualizatio ope ource project, The gree 500 lit, Arbrut,,. A. Fox,. Griffith, A. Joeph,. Katz, A. Kowiki, G. Lee, D. Pattero, A. abki, I. Stoica, et al., Above the cloud: A berkeley view of cloud coputig, EECS Departet, Uiverity of Califoria, Berkeley, Tech. ep. Barha, P., B. Dragovic, K. Fraer, S. Had, T. Harri, A. Ho,. Neugebauer, I. Pratt, ad A. Warfield, Xe ad the art of virtualizatio, i Proceedig of the ieteeth AC ypoiu o Operatig yte priciple, p: 177. Brook, D. ad. artooi, Dyaic theral aageet for high-perforace icroproceor, i The Seveth Iteratioal Sypoiu o High-Perforace Coputer Architecture, pp:

7 Buyya,.,. aja ad.n. Calheiro, odelig ad iulatio of calable Cloud coputig eviroet ad the CloudSi toolkit: Challege ad opportuitie. High Perforace Coputig & Siulatio, HPCS '09. Iteratioal Coferece o. Carrera, E., E. Piheiro, ad. Biachii, Coervig dik eergy i etwork erver, i Proceedig of the 17th aual iteratioal coferece o Supercoputig, p: 97. Cooper, B., E. Baldechwieler,. Foeca, J. Kitler, P. Naraya, C. Neerdael, T. Negri,. aakriha, A. Silbertei, U. Srivatava, et al., Buildig a Cloud for Yahoo! Data Egieerig, p: 36. Guohui, W. ad T.S.E. NG, The Ipact of Virtualizatio o Network Perforace of Aazo EC2 Data Ceter. INFOCO, Proceedig IEEE. Ki, J.L. ad.d. Elli, A Fraework for Itegratio odel of eource-cotraied Schedulig uig Geetic Algorith. Siulatio Coferece, Proceedig of the Witer, , Orlado, Florida, USA. Kivity, A., Y. Kaay, D. Laor, U. Lubli, ad A. Liguori, kv: the Liux virtual achie oitor, i Proceedig of the Liux Sypoiu, 1: Liu, L., H. Wag, X. Liu, X. Ji, W. He, Q. Wag, ad Y. Che, GreeCloud: a ew architecture for gree data ceter, i Proceedig of the 6th iteratioal coferece idutry eio o Autooic coputig ad couicatio idutry eio, pp: Nathuji,. ad K. Schwa, VirtualPower: coordiated power aageet i virtualized eterprie yte, i Proceedig of twety-firt AC SIGOPS ypoiu o Operatig yte priciple. AC, p: 278. Nedevchi, S., L. Popa, G. Iaaccoe, S. ataay, ad D. Wetherall, educig etwork eergy couptio via leepig ad rate-adaptatio, i Proceedig of the 5 th USENIX Sypoiu o Networked Syte Deig ad Ipleetatio, pp: aghavedra,., P. agaatha, V. Talwar, Z. Wag, ad X. Zhu, No power truggle: Coordiated ulti-level power aageet for the data ceter, AC SIGPLAN Notice, 43(3): Tag, C.,. Steider,. Spreitzer, ad G. Pacifici A Scalable Applicatio Placeet Cotroller for Eterprie Data Ceter. Proceedig of the 16th iteratioal coferece o World Wide Web, , Baff, Alberta, Caada. Va, H.N., F.D. Tra, ad J.. eaud, Autooic Virtual eource aageet for Service Hotig Platfor. Software Egieerig Challege of Cloud Coputig, CLOUD '09. ICSE Workhop o, Vacouver, Caada, 1-8. Waldpurger, C., eory reource aageet i Vware ESX erver, AC SIGOPS Operatig Syte eview, 36:SI, p