A Strategy for Optimal Placement of Virtual Machines in IAAS Clouds

Transcription

1 A Strategy for Optmal Placement of Vrtual Machnes n IAAS Clous Raalakshm Shenbaga Moorthy, Assstant Professor, Department of Computer Scence an Engneerng, St.Joseph s Insttute of Technology, Chenna Abstract Clou computng proes rtualze computng resources that allow clou consumers to access the resources as pay per use. Such resources must be optmally chosen, n orer to process the user request an thereby maxmze user satsfacton n the strbute system. Constrant Satsfacton Problem s a promnent technque to optmally choose the resource for placng the rtual machne n large scale strbute system. In ths paper, CSP base VM placement strategy s propose to place the rtual machne n clou resources an to montor the resources base on the cpu usage. CSP always choose a resource whch satsfes the constrants as specfe by user. VM Manager s ntegrate wth CSP, whch optmally places the rtual machne n the clou resource. Once the rtual machnes are place n the physcal machne, the status of the resources s montore contnuously. rtual machnes wll be mgrate from one physcal machne to another, f the cpu usage goes mnmal. propose work esgns a VM Manager along wth 2 components calle VM Montor an Resource prosoner n orer to mnmze the number of physcal machnes use. CSP base VM placement has been mplemente n Jaa usng Eclpse IDE. propose technque s compare wth Frst Ft to compare user satsfacton, completon tme an number of physcal machnes. mplementaton result shows that the propose work s accurate when compare to exstng technque. possble. Clou Consumers, whose applcatons are run n the resources of the Clou Proers, always want ther applcatons to complete wthn tme as well as wth stpulate cost. In ths paper, the most promnent research ssue calle rtualzaton has been scusse. Clou Computng proes a platform for consumers to run ther applcatons n more effcent an effecte way. Vrtualzaton technques are use n clou computng n orer to utlze harware resources as much as possble. Vrtual machnes are lke real system whch also contans operatng system, that are create usually n physcal machne. rtualzaton technque ncreases resource utlzaton. Though rtualzaton mproes utlzaton of resources, each VM share unerlyng physcal machne. Through the concept calle rtualzaton, the clou consumers can utlze computng resources, as pay per use, rather than ownng t. Vrtualzaton allows many rtual machnes to run n sngle physcal machne. placement of rtual machne nto physcal machne fall nto two categores. One s statc rtual machne placement an another one s Dynamc rtual machne placement. Fgure: 1 represents the types of rtual machne placement. Inex Terms Clou computng, Constrant Satsfacton Problem, VM Manager, VM Montor, Resource Prosoner. I. INTRODUCTION Recently Clou computng has emerge as marelous technology, that elers on eman computng resources requre by clou consumers oer nternet usng the slogan pay per use. three maor serces offere by clou computng nclues: Software as a serce, Infrastructure as a serce, an Platform as a serce. Clou computng noles lot of serous research ssues nclues resource management, resource scheulng, relablty, securty an rtualzaton etc. two maor partes nole n clou computng are clou proers an clou consumers. Clou Proers are those who proe serces as requeste by Clou consumers. obecte of the Clou proers s to make as much proft as Fgure 1: Vrtual Machne Placement In the Statc Vrtual Machne Placement, the rtual machne wll be place n the physcal machne, whch satsfes capacty constrants. Fgure:2 represents Statc Vrtual Machne Placement. In case of Dynamc Vrtual machne Placement, the Vrtual machne wll be place n the physcal machne, but when the loa of the system ncreases, the rtual machne wll be mgrate to another physcal machne. Dynamc Vrtual Machne Placement s represente n Fgure:3 Manuscrpt recee Aprl, Raalakshm Shenbaga Moorthy, Assstant Professor, Department of Computer Scence an Engneerng, St.Joseph s Insttute of Technology., Chenna, Ina. All Rghts Resere 2015 IJARCET 1236

2 Fgure 2: Statc Vrtual Machne Placement Fgure 3: Dynamc Vrtual Machne Placement man contrbuton of ths paper nclues Desgn of Optmal VM Manager Best Physcal Machnes are chosen for each rtual Machne Desgn of Constrant Satsfacton problem base VM placement technque, whch consers the completon tme Comparson of propose CSP base Placement Technque wth Frst Ft Algorthm. rest of ths paper s organze as follows: Secton II etals the relate work on Vrtual machne Placement. Secton III ges the agrammatc representaton of propose system archtecture an etale explanaton of all the moules n the archtecture. Secton IV ges the mplementaton etals of arous algorthms. Secton V ges the expermental set up use to mplement the propose work an comparson of results. Secton VI conclues the work an ges the future scope. Progresse Multple Knapsack algorthm ha been propose to properly allocate Vrtual machne of multple tenants. Jpang Gao et.al [5] propose mult obecte partcle swarm optmzaton base rtual machne placement wth the obecte to mnmze number of rtual machne mgratons. parameters consere are CPU, memory an storage. Zamanfar et.al [6] propose a noel rtual machne placement algorthm to optmze the placement of rtual machne as well as to mnmze the ata transfer rates between the rtual machnes. Mnmzng ata transfer rate can be achee through mnmzng the elay. Delay epens on sze of the fle, an locaton of rtual machnes an transfer of ata between the rtual machnes. Sato et.al [7] propose a noel ynamc rtual machne placement wth the obecte to mnmze le mgratons. Mgraton of the rtual machnes can be mnmze by effectely prectng the resource usage. Ths s mplemente usng Auto Regresse Moel. Yongqang wu et.al [8] propose smulate annealng base mechansm to optmally place the rtual machnes across serers. obecte s to mnmze the power consumpton of the serers n the ata centers. Shuo Fang et.al [9] propose a noel rtual machne placement algorthm to mnmze the power consumpton. OpenFlow protocol ha been use to mnmze the power as well as to mnmze the elay. propose metho aggregates the rtual machnes nto group as well t always keeps the rtual machnes performng same task n near locaton. III. PROPOSED SYSTEM ARCHITECTURE propose archtecture s shown n the fgure: 4. components of the propose archtecture nclue: ) Request Hanler ) VM Manager ) VM Montor ) Resource Prosoner. II. RELATED WORK Mchael TIghe et.al [1] propose a strbute approach to ynamc rtual machne placement. Frst Ft heurstc algorthm s use to achee ynamc an strbute aaptaton. Ths kn of strbute approach elmnates the sngle pont falure. propose approach s mplemente usng DCSm smulaton tool. Yongqang Gao et.al [2] propose a mult-obecte ant colony system algorthm for rtual machne placement. obecte s to mnmze total resource wastage an power consumpton. propose algorthm s teste wth arous algorthm such as genetc algorthm an bn packng. Kangkang L et.al [3] propose mgraton base VM placement to mnmze the ob completon tme. Offlne an onlne scenaros of Vrtual machne placement ha consere. propose heurstc mgraton base approach s compare wth Frst Ft an Best Ft. algorthm places the rtual machne nto physcal machne whch satsfes the capacty. Jaxn L et.al [4] propose mult-tenant VM allocaton wth the obecte to mnmze the sum of VM s ameter across tenants. Layere Fgure 4: Propose System Archtecture Request Hanler: All the rtual machnes submtte by the consumers are hanle by the Request hanler. Queung moel aopte for hanlng the requests s M / M /1 : / FCFS. VM Manager: goal of VM Manager s to allocate approprate physcal machne for the rtual machne. 1237

3 VM Manager nclues the components VM Montor an Resource Prosoner. VM Manager actely manages the mapng of rtual machnes to physcal machnes. am of VM Manager s to choose optmal physcal machne for each rtual machne. VM manager s esgne usng Constrant Satsfacton Problem (CSP). VM Montor: Once the rtual machne s place n the physcal machne, VM Montor keeps on montorng the rtual machne n terms of ts CPU usage. If the CPU usage of the Physcal machne rops below threshol,, then the montor ntens to mgrate the rtual machne to some other physcal machne. Resource Prosoner: obecte of resource prosoner s to choose optmal physcal machne for rtual machne satsfyng the eman constrants as well as choosng a resource wth mnmal completon tme of the rtual machne. IV. IMPLEMENTATION problem of placng Vrtual machne n the Physcal machne s sole usng Constrant Satsfacton Problem. Problem formulaton s gen as: Let the number of Vrtual machnes s represente as an the rtual machnes are represente as,,.... Let the physcal machnes s represente as p an the physcal machnes are represente as p p, p,.. p 1 2 m. A physcal machne p has to be optmally chosen for placng the rtual machne. obecte s to mnmze the number of physcal machnes use to place the rtual machnes. Also, rtual machne wll be place n the physcal machne p, f the physcal machne s hang mnmum completon tme for. p Mn X 1 1 Subect to the constrants Mn (1) XCompTme (2), p X 1 (3) 1 0; f s not place on X (4) 1; f s place on p Re q Capacty (5) Whle placng the rtual machne n the physcal machne, the status of the physcal machne has to be montore perocally. A physcal machne may be ether of two states Oer loae When the CPU usage of the physcal machne excees Max threshol alue, an then the physcal machne s terme to be oerloae. So the rtual machnes place n the physcal machne has to be mgrate to some other physcal machne Uner loae When the CPU usage of the physcal machne s below Mn threshol alue, an then the physcal machne s uner loae. So new ncomng Vrtual machnes can be place nto t Lst of symbols use throughout ths paper s gen n the table: 1. Symbols Descrpton 1, 2,... n Lst of Vrtual Machnes p p1, p2,.. pm Lst of Physcal Machnes p p Total Number of Vrtual Machnes th Physcal Machne th Vrtual Machne Total Number of Physcal Machnes X Boolean arable take ether 0 or 1. It wll be 1,f th Vrtual Machne run on th Physcal Machne. Else t wll be 0. CompTme Completon Tme of th Vrtual Machne run on th Physcal Machne Requrement of Re q th Vrtual Machne across each menson Capacty Capacty of th Physcal Machne across each menson OP A set conssts of Vrtual Machnes Mappe wth Physcal Machnes BPM A set conssts of Best Physcal Machnes for th Vrtual Machne cpuusage CPU usage of th Physcal Machne VM S m A set of Vrtual machnes runnng on the th Physcal Machne Total Number of Vrtual Machnes Successfully place Table 1: Lst of Symbols algorthm calle CSP-VMPlacement ha been propose to optmally place the rtual machne n the physcal machne. Propose work functons n two ways: Intally, the algorthm selects the optmal physcal machne for placng the rtual machne. n, perocally t checks status of the physcal machne, f the status of the physcal machne s foun to be oerloae, then the propose CSP-VMPlacement automatcally mgrates the rtual machne n the oerloae Physcal machne to new physcal machne. CSP-VMPlacement s shown below: Algorthm 1: CSP VMPlacement Input: p p, p,.. p,,, m Output: OP, For 1; ;, BestPMSelector Placement Mgrate All Rghts Resere 2015 IJARCET 1238

4 BestPMSelector s gen n Algorthm: 2. A physcal machne s consere to be the best for placng rtual machne, f the eman of the rtual machne s satsfe by the physcal machne across all menson. menson represents RAM, Har sk, banwth etc. Algorthm 2: BestPMSelector Input: p p1, p2,.. pm Output: BPM For 1; p ; If Re q Capacty p then BPM BPM p Placement s represente n Algorthm: 3. A physcal machne s chosen for placng the rtual machne f the physcal machne has mnmum completon tme for that rtual machne. Once the rtual machne s place on the physcal machne p, then the ecson arable X wll be set to 1. Algorthm 3: Input: BPM Output: OP For p BPM Placement mn_ CT FIRST BPM If CompTme mn_ CT then mn_ CT CompTme PM p Place rtual machne n physcal machne p VM VM X 1, OP OP p Mgrate s gen n Algorthm: 4. After placng a rtual machne n the physcal machne p, the physcal machne has to be perocally montore n terms of ts cpu usage. If the cpu usage excees the maxmum threshol alue, then the physcal machne s consere to be oerloae. n, mgrate the rtual machne place n physcal machne. Algorthm 4: Mgrate Input: p p, p,.. p,,, m Output: OP For PhyscalMachne p For VM p If X 1 then If cpuusage MaxThreshol p then VM VM BestPMSelector Placement V. EXPERIMENTAL SETUP smulaton s carre out by generatng the rtual machne request an physcal machnes. propose CSP VMPlacement s compare wth frst ft. Propose algorthm s compare n terms of completon tme, the number of physcal machnes utlze an user satsfacton. propose algorthm outperforms than Frst Ft. A. Comparson of Completon Tme Frst Ft algorthm always places the rtual machne n the physcal machne whch has enough room for that rtual machne, as well as Frst ft algorthm oes not conser the completon tme of the rtual machne. Thus completon tme of the rtual machne ncreases n Frst ft when compare to CSP. Fgure: 5 shows that propose algorthm outperforms than the Frst Ft. Fgure 5: Comparson of Completon Tme B. Comparson of Number of Physcal Machnes Smulaton s carre out for comparng the number of rtual machnes utlze by the propose CSP an frst ft. From the graph shown n fgure: 6 the propose CSP uses mnmum number of physcal machnes. reason behn usng mnmum number of physcal machnes n CSP, s that propose technque, always choose a physcal machne whch 1239

5 s hang mnmal completon tme. In case of Frst ft, the algorthm always allocates a physcal machne whch s hang more space for that rtual machne. Thus, a physcal machne wth more space s always chosen, whch leas to noke more number of physcal machne. Fgure 6: Comparson of #Physcal Machnes C. Comparson of user Satsfacton smulaton s carre out to analyze user satsfacton. User satsfacton s calculate base on number of rtual machnes that are successfully complete wthn ealne to the total number of rtual machnes submtte by user. S m UserSatsfacton (6) propose CSP technque achees maxmum user satsfacton than the Frst Ft algorthm whch s shown n Fgure: 7. approach maxmzes the User Satsfacton. future work wll be placement of rtual machnes base on forecastng the eman of the rtual machnes n aance. REFERENCES [1] Mchael Tghe, Geston Keller, Mchael Bauer an Hanan Lutfyya, A Dstrbute Approach to Dynamc VM Management, 9 th CNSM an Workshops, pp , 2013 [2] Yongqang Gao, Habng Guan, Zhengwe Q, Yang Hou, Lang Lu, A Mult-Obecte ant colony system algorthm for rtual machne placement n clou computng, Journal of Computer an System Scences, ol.79, Issue 8, pp , 2013 [3] Kangkang L, Huanyang Zheng, Je Wu, Mgraton-base Vrtual Machne Placement n Clou Systems, IEEE Conference on Clou Networkng, pp.83-90, 2013 [4] Jaxn L, Dongsheng L, Yumng Ye, Xcheng Lu, Effcent Mult-Tenant Vrtual Machne Allocaton n Clou Data Centers, Tsnghua Scence an Technology, ol.20, no.1, pp.81,89, Feb o: /TST [5] Jpeng Gao, Gaomng Tang, "Vrtual Machne Placement Strategy Research," IEEE Conference on Cyber-Enable Dstrbute Computng an Knowlege Dscoery (CyberC), pp ,2013 o: /CyberC [6] Zamanfar, K.,Nasr, N., Nam-Shahrak, M., "Data-Aware Vrtual Machne Placement an Rate Allocaton n Clou Enronment," IEEE conference on Aance Computng & Communcaton Technologes (ACCT),pp ,2012 o: /ACCT [7] Sato, K., Samema, M., Komoa, N., "Dynamc optmzaton of rtual machne placement by resource usage precton,"11th IEEE Internatonal Conference on Inustral Informatcs (INDIN), pp.86-91,2013 o: /INDIN [8] Yongqang Wu, Maoln Tang; Fraser, W., "A smulate annealng algorthm for energy effcent rtual machne placement," IEEE Internatonal Conference on Systems, Man, an Cybernetcs (SMC), pp.1245,1250, o: /ICSMC [9] Shuo Fang; Kanagaelu, R., Bu-Sung Lee, Chuan Heng Foh, Khn M M Aung, "Power-Effcent Vrtual Machne Placement an Mgraton n Data Centers," IEEE Internatonal Conference on Green Computng an Communcatons (GreenCom),an IEEE Cyber, Physcal an Socal Computng an Internet of Thngs (Thngs/CPSCom), pp ,2013o: /GreenCom-Thngs-CPSCom BIOGRAPHY Fgure 7: Comparson of User Satsfacton VI. CONCLUSION & FUTURE WORK In ths paper, we hae propose a noel mechansm to effectely place the rtual machnes across arous physcal machnes. Constrant Satsfacton base Vrtual Machne Placement ha been propose to mnmze the number of physcal machnes use. propose approach also mnmzes the completon tme of the applcatons runnng n the rtual machne by properly placng the rtual machne n physcal machne. Constrant Satsfacton Base VM placement algorthm s ntegrate wth VM Manager. propose CSP base VM Manager mproes effcency of placng the rtual machnes. We hae also llustrate that the propose research work effectely places the rtual machnes across arous physcal machnes. propose mechansm mnmzes the number of physcal machnes use as well the completon tme of the applcatons. propose Ms. Raalakshm Shenbaga Moorthy recee her B.Tech uner the stream of Informaton Technology from Mookambga College of Engneerng n She complete her Masters n Engneerng (M.E) n Computer Scence from Maras Insttute of Technology, Anna Unersty n She s Gol Mealst n her B.Tech an M.E programme. She s currently workng as an Assstant Professor n St. Joseph s Insttute of Technology, Chenna. Her research area nclues Clou Computng, System Software, Analyss of Algorthms an ata mnng. She has publshe four Internatonal conference papers, whch s nexe n IEEE explorer an Elseer publcatons. She has also publshe one Internatonal Journal. All Rghts Resere 2015 IJARCET 1240