Vol. 28, No. 16, (2019), pp. 580-587
Efficient Virtual Machine Placement in Data Center
Dr. K. Ravindra Nath1, Dr. G. Sreeram 2, D. Lavanya3, Uday Kiran4, P.S. S. Rajesh 1Associate Professor, Dept of CSE, KLEF, Guntur, Andhra Pradesh, India.
2Associate Professor, Dept of CSE, KLEF, Guntur, Andhra Pradesh, India.
3, 4, 5
B.Tech Student, Dept of CSE, KLEF, Guntur, Andhra Pradesh, India
1 [email protected], 2 [email protected], 3 [email protected] ,
Abstract
Cloud computing provides many benefits by optimizing different parameter s to reach the challenging requirements. Some of challenges in cloud computing are resource utilization and less energy consumption. More heterogeneity of work and resources makes the consolidation problem complicated within cloud architecture.
An ideal mapping of a task to virtual machines (VM) and virtual machines to physical machines(PM) is referred as VM placement. In this research work task based VM placement algorithm is introduced. Here tasks are divided agreeing to their requirements, and after that looking for suitable VM , once more looking for suitable PM where chosen VM could be sent. The algorithm diminishes the resource utilization by devaluing count of dynamic PMs, whereas moreover decrease the make span and assignment dismissal rate. In this research we evaluated our algorithm in CloudSim test System. The results of this implementation demonstrates the effectiveness of introduced algorithm by some existing algorithms like Round robin and Shortest Job First(SJF).
Keywords: Makespan, Consolidation, Energy consumption ion, Clousim, cloud computing
________________________________________________________________________
1. Introduction
One of the most developing advances of cloud computing is its ease of access and distinctive applicability, making clients attracted to its characteristics. It gives readiness of requirements for its clients for dynamically scaling the appliances, the floor and the hardware framework. Cloud working models are solely classified into Software as a Service (SaaS), Infrastructure as a Service (IaaS) and Platform as a Service (PaaS). From cloud data centers cloud computing empowers the clients to use computing assets, rather than owning the resources. Due to reason, cloud computing claims virtualization within which equipment resources of one or more computer systems are classified into various execution circumstances called Virtual Machines (VM). Every VM is separated from every other VM and also can perform as perfect system to implement the client applications [1]. Many of the advantages from the cloud originates from the property multiplexing utilizing new virtualization methods that permits to develop asset utilization and the required use of energy. When there exist finite resources within data center, mapping could be done physically. But, when the asset is huge physical mapping gets to be hard and im-practical. For this infer we utilize VM placement mechanism at start time or at run time [2]. The mapping of jobs to virtual machines and VMs to physical machines is termed as Virtual machine placement
Vol. 28, No. 16, (2019), pp. 580-587
Figure 1. VM Placement in servers
Use of a well organized energy within the data centers is a difficult job. Since of the high request of different administrations in the cloud, by data centers is developing constantly around the world. An extreme use of data centers results to high energy utilizations, extreme CO2 radiation and expanded within the working price of the data centers. To decrease the utilization we utilize a common strategy to improve the efficiency of a data center that's VM situation strategy. It will be used for comparing the count of actively performing servers to the present importance of the VMs and keeping the leftover servers in less control standalone modes.
Nearly every IT businesses requires the help from the practical cloud-computing stages, encouraged by millions of physical host machines expanded in numerous data centers. Cloud computing framework is supported by virtualization methods that manual cloud assets. The virtual cloud infrastructure enlarge the output along with scalability of the framework. The virtual resources within the cloud framework are referred as the VMs. The VMs graphed various client demands for the implementation of input tasks. Resource administration gets to be indeed more hard when resources are over consented, the clients are not supportive. To manage the circumstances, the cloud service provider (CSP) must take after a proper planning mechanism to deliver the services. The discussion between the CSP and the client is industrially named as service level agreement(SLA). The SLA is one of the part of a services.
While accomplishing the assignment of the service demands to a set of vms running on various hosts that are expressed within the SLAs and without reducing or lowering the Character of Work is charged to as the service issue. Assigning Virtual Machines to pms within the data center includes conveying choices such as when to allocate Virtual Machines, which Virtual Machines to migrate which Virtual Machines are allocated to which Physical Machines, which Physical Machines can be switched off. Here the proposed answer decreases the resource disuse in cloud framework with the help of virtualization method and efficient allocation policies. We have introduced different sub types of VM according to their resource capability. The entire input load of the data center may be a limited count of tasks where each of task includes with several VMs for execution. Our fundamental aim is to assign input task to virtual machine or create virtual machine based on work, assign the recently created host virtual machine to dynamic host.
Vol. 28, No. 16, (2019), pp. 580-587
In this research work, Different cloud assets and the inputting jobs of a cloud model are modified, and tasks know asset assignment environment is made current to reduce the resource consumption of the data centers.
2. Literature Review
In the process to optimize and decrease the whole energy utilization and makespan of the cloud data center many algorithms and techniques have been introduced. VM placement is the one among the critical operations in a cloud computing. VM placement is a technique of choosing the appropriate Physical Machine (PM) for assigned Virtual Machine (VM).Energy Consumption depends on allocation of tasks for a particular virtual machine. A Virtual Machine allocation policy for data intensive applications can be implemented by selecting a subset of available Physical Machines.
The process of VM choosing for a given task is depended on 1.Specified Service Level Agreement 2.The Cloud Service rovider (CSP) to get the benefits and 3.Other important objectives like time minimization, energy optimization, throughput extension. Virtual Machine selection policy is also based on degree of performance satisfaction.
In the related work done on energy consumption we observe the issue of how to choose a host for Virtual Machine placement and to migrate VMs from abnormal loaded hosts such as under loaded or over loaded to another and switching off the idle host machine into sleep mode. Virtual Machine placement be determined the host machines by shortest distance, minimum Energy Consumption and maximum bandwidth usage within cloud environment.
Virtual Machine placement method can be either static or dynamic. In static method, the allocation is not altered once the decision is taken. In dynamic method, the allocation of VM to the physical machine may be altered at the time of execution of task. The information related to the actual load is utilized in the dynamic method but the information is not present in the static method.
Depending on the goal a Virtual Machine placement algorithms are divided into two types 1.QoS based approach 2.Power based approach.
An algorithm called TVMC-Task related Virtual Machine Consolidation Algorithm is used to optimize the different performance measures. This algorithm 1.Includes a good organized structure to map VMs efficiently, 2.It permits cloud service providers to reduce the energy consumption and to decrease the task failure rate of a system, 3. It also permits cloud users to reduce the cost, execution time.
Virtual Machine consolidation is a technique used by Virtualization that provides the better utilization of the infrastructure of datacenters. Virtual Machine consolidation includes live migration that has capacity of changing a virtual machine in range of physical servers with zero down makespan and it is one of the better way to increase use of the assets and energy optimization in data centers.
VM migration and also Virtual Machine placement plays vital part in the Virtual Machine consolidation methods. Problems such as heterogeneit y, volatile work- loads, scalability and migration cost make VM consolidation technique tough. It can be done either in the static way or in the dynamic way. In case of Static VM consolidation, the VM Monitor assigns the physical resources to the VMs dependent on peak load need. In Dynamic VM consolidation, VM Monitor alters the VM capabilities based on current workload requirements [3].
Vol. 28, No. 16, (2019), pp. 580-587
By using Cloud Simulator we run simulations. Its outputs gives us to commence the policies that are included in the research performs in a better way than presented policies with regards to VM migration make span, and Service Level Agreement interruption percentage.
As stated by Laawrence Berkeleey National Laboratory (LBNL), electricity usage of the data centers was 70 billion kilo Watt hour in the year of 2014 that was 1.8%
of total US energy consumption. Many scientists focused on the efficient operation of data centers. Based on Amazon‟s point of view, energy depended expenses for data centers are of 42 percentage of whole operating expenses [4].
Present energy efficient resource assignment solutions that are provided by various computing frameworks mainly points on minimization of energy usage or their expenses, and dynamic service needs of the users that can be changed on demand in Cloud computing infrastructure.
3. Problem Statement
For better usage of resources in cloud data center Virtual Machine placement technique involves as a key role. Within cloud framework there are m heterogeneous hosts. Each one of the host is in single state among the two states:
either in dynamic or in sleep condition and initially total presented hosts are in sleep condition. Here „v‟ types of virtual machines are divided depending on their requirements (like storage, processing speed, bandwidth). In the same way as types of VM, tasks have been divided, so tasks of the similar tasks group could fix into same type of virtual machines. The total information about the tasks within the queue has known by task director and also about coming tasks. Therefore, Based on the requirements as specified by the task director for approaching tasks, modern VMs been made in few special hosts. So, the fitting task of newly formed virtual machines to few hosts is an task issue. A sub optimized output for the given task issue with the goal of better performance is the important aim of this project.
Figure 2. Cloud System Model
Vol. 28, No. 16, (2019), pp. 580-587
4.Proposed Algorithm
Task-based Virtual Machine Consolidation Algorithm 4.1 Algorithm
Input : Task
t={ �1,�2 , �3 ... �n}
Deadlines
d={�1, �2, �3... �n}
�� Ty = {��T1 , ��T2 , ��T3 , ��T4}
for j=1 to n do
task Q[i] ←pickMin(ti) end for
�1, �2,�3, �4 ←Categorize Task(task Q) using Algorithm 3 for each task �i ∈ task Q
Free Host VM() using Algorithm 3
Vm←select VM (�0, ��1, ���, �1����) using Algorithm 4
Allocate �i to VM deployed on host end for Free Host VM() using Algorithm 3
4.2 Algorithm 2
Categorize Tasks Input : Task t={ �1, � 2, �3 ... �n}
Resource necessity R={�i, �i}
UC CU/DU for each task Q[i]
�i
�i = �
�i
�ci = �
�i
�Ni = �
��i
�ioi = ��
�ci = �i ∗ �ci
�Ni = �i ∗ �Ni
�ioi = �i ∗ �ioi
�ßi = �i ∗ �ßi
���i = ���(�ci, �Ni, �ioi, �ßi )
�i ∈ �cpu iff �ci = ���i
�i ∈ �NeN iff �Ni = ���i
�i ∈ �io iff �ioi = ���i
i
c
u
u
Vol. 28, No. 16, (2019), pp. 580-587
�i ∈ �con iff �ßi = ���i end for
4.3 Algorithm 3
Input : active hosts aH={ aH1,aH2,…….aHn} V={ V11,V12,…..,V21,V22,….,V31,…..,V33} for each active host aHi∈aH
for each Vij∈aHi
if Vij is not active then Unassign regular of Vij
end if
end for end for V set1 =0 for each aHi∈ aH do for each Vij �aHi do
if Migration of Vij to aH-aHi then Vstart +=1 Migij=target ID end if
end for If Vstart =j-1
Migrate virtual machine Keep the host aHi to sleep end if
end for
4.4 Algorithm 4
Input:��type={ ��type1 , ��type2, ��type3, ��type4}
VM sub types:
��type1
={ ��type11
, ... , ��type14}
={ ��type11 , , ��type14}
��type2={ ��type21 , ... , ��type24}
��type3={ ��type31
, , ��type34}
��type4
={ ��type41
, , �� type44}
For each Vsubtype VMtypei= VMtype
If t is apt then
VMtype ← VMtype i Return VMtyoe Stop
end if end for
5. Results and Discussions
The experiments are doled out with the assistance of Cloud Sim three. 03 simulator. Xen been employed because of the Virtual Machine Monitor. Here planned Task based Virtual Machine Consolidation (TVMM) formula is enforced in Java and checked on a dingle digital computer by using Intel i 7 three.07 GHz CPU and 32G memory.
Vol. 28, No. 16, (2019), pp. 580-587
CloudSim is a test system of cloud computing that empowers manageable situation with free of price and iterative. It exhibits and adjust bottlenecks before sending to cloud. CloudSim propose: another, Consistent explanation, extended replication system. Permitting that analyst ,industry-based designers development their cloud computing framework and application administrations. A few attributes are extraordinary of cloudsim, for example, helping to displa y and reproduction of huge range cloud computing foundation, incorporate server farms on solitary physical registering hub(every one with their qualities),for virtualizing administrations adjust to move between time shared and space shared portion of handling center. Cloud sim gives architecture and social demonstrating of cloud processing segments. Recreation of cloud situations and apps for execution gives helpful information to check such unique, versatile conditions.
In a group of heterogeneous cloud assets simulations has been executed, that is hosts in addition as heterogeneous input resource demands and VMs. The asset demand and also the extent of a service 300 requests also get produced haphazardly.
The measure of hosts is constant in every activity and also variety of VMs differs in between from twenty and two hundred. The requirements for the Vms are produced haphazardly and also requirements of total VMs are distributed on a bunch is lower than the asset capability of the given host, to judge potency of our implemented formula, we have analyzed the planned TVMC formula with 305 Round-Robin, FCFS, with relation to energy consumption of the system. When compared with past algorithms TVMM algorithm works higher and results are given in Figure a pair of – seven. The projected algorithm provides higher average energy consumption than RR and FCFS.
Figure 1. Comparing the Task Rejection rate of Round Robin, FCFS, TVMC
6. Conclusion
In cloud environment by implementing hosts, heterogeneous type of tasks and VMs they have conferred a task-based VM-placement law (TVMC). The aim is to rapidly assign tasks for the VMs, thus VMs for hosts for reducing makespan, and level of rejection of tasks. Estimating to FCFS and Round-Robin algorithms, its resolution performance results were obtained for framework whereby resource needs of database orders could differ dynamically throughout the process time.
7. References
1. S. S. N. V. A. Mohammad Masdari, “An Overview of Virtual Machine Placement Schemes In Cloud Computing,” Journal of Network and Computer Applications, vol. 66, pp. 106-127, may 2016
2. C. Z. Xiong FU, “Virtual machine selection and placement for dynamic consolidation in Cloud computing environment,” Frontiers of Computer Science, vol. 9, no. 2, pp. 322- 330, April 2015
Vol. 28, No. 16, (2019), pp. 580-587
3. E. E. H. H. E. a. H. E. Amany Abdelsamea1, “Virtual Machine
Consolidation Challenges,” International Journal of Innovation and Applied Studies , vol. 8, 2014.
4. S Pradeep, Dr Yogesh Kumar Sharma, “Effectual Secured approach for Internet of Things with Fog Computing and Mobile Cloud Architecture Using IFogSim “ , W E C -2019 ,London, U.K ,Issn:2078-0958, pp.101-104, 2019.
5. B. a. J. A. Rajkumar Buyya1, “Energy- Efficient Management of Data Center Resources for Cloud Computing: A Vision, Architectural Elements, and Open Challenges,” Future Generation Computer Systems, vol. 28, no. 5, pp.
755-768, may 2012.
6. S. S. M. S. S. D. Puthal, “Cloud computing features, issues and challenges,”
International Conference on Computational Intelligence and Networks, pp. 116-123, 2015.
7. . U. K. N. C. S. Zeadally, “Energy- efficient networking: past, present, and future,” The Journal of Supercomputing, pp. 1-26, 2012.
8. S. U. K. J. D. L. Wang, “Thermal aware workload placement with task- temperature profiles in a data center,” The Journal of Supercomputing, pp. 1- 24, 2012.
9. R Naveen Kumar, Hari Kiran Vege, G Sreeram,” Patient Treatment Interval Used In Forecast Algorithm and Solicitations in Hospital Queuing Management “ , International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-8 Issue-7 May, 2019
10. S. U. K. L. Wang, “Review of performance metrics for green data centers: a taxonomy study,” The journal of supercomputing, pp. 639-656, 2013 11. N. S. V. S. K. C. P. Sarwesh, “Effective integration of reliable routing
mechanism and energy efficient node placement technique for low power iot networks,,” International Journal of Grid and High Performance Computing (IJGHPC), pp. 16- 35, 2017.
12. R Naveen Kumar, Hari Kiran Vege, G Sreeram,” Patient Treatment Interval Used In Forecast Algorithm and Solicitations in Hospital Queuing Management “ , International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-8 Issue-7 May, 2019.
13. M. C. C. Anglano, “Scheduling algorithms for multiple bag-of-task applications on desktop grids: A knowledge-free approach,” International Symposium on Parallel and Distributed Processing, IPDPS 2008, IEEE, pp.
1-8, 2008.
Author Profile :
K.Ravindranath received a Ph.D degree from Achrya Nagarjuna University in 2016. Currently, he is Associate Professor of Computer Science &
Engineering at K L University, Vaddeswaram, AP, India. Prof. Ravindranath's research interests include Cloud computing, Mobile Clouds and Security. His work has appeared in over 27 publications. He is a member of ACM, Life member in Computer Society of India.
