Virtual Machine Placement Using Statistical Mechanism in Cloud Computing Environment

Virtual Machine Placement Using Statistical Mechanism in Cloud Computing Environment

Narander Kumar, Surendra Kumar
Copyright: © 2018 |Pages: 9
DOI: 10.4018/IJAEC.2018070103
(Individual Articles)
No Current Special Offers


The internet has become essential and is the basis of cloud computing and will continue to be in the future. Best resource allocation is a process of placing the resources at their minimum cost/time and minimizes the load to a virtual machine. In this article, the authors propose an algorithm to optimize assignment problems and get the best placements in the resources to maintain the load on the virtual machine. Further, they also make comparisons between various optimization mechanisms for assignment problems, which is formulated for the cloud in virtual machine placement.
Article Preview


Cloud computing is a model of the technological organization of a computer system whether private, public or hybrid in nature. It provides a paperless environment in terms of network, servers and capacity. Distributed computing permits the cloud to break down a worldwide operation into a few errands, and afterward send them to handling frameworks. In any case, resource allocation turns out to be more unpredictable in a domain made out of heterogeneous resources and it relies on upon the prerequisites of clients (Sharma & Saini, 2016). The main reason for the traditional assignment issue and numerous varieties on it is to discover ideal pairings of operators and undertakings. Each errand is allocated to a solitary operator, every specialist is given a solitary assignment, and the reasonableness of a specific arrangement of assignments is controlled by a solitary basis work. The assignment of a few errands to a solitary specialist is conceivable just by developing the issue to incorporate imaginary assignments and redundant operators. There is, in any case, no real way to confine these different assignments (Ross & Soland, 2005). Fundamentally resource allocation implies dissemination of resource monetarily among contending gatherings of individuals or projects. Resource assignment has a critical effect in cloud computing, particularly in pay-per-utilization organizations where the quantities of resources are charged to application suppliers. For the best way to find the resource allocation problem it can be used to solve with Branch and bound algorithm for the optimal solutions of the undertakings together with their gear to every workstation means to achieve the correct arrangements ascribing to hypothetical significance of our issue (Ogan & Azizoglu, 2015). The issue of optimization emerges in surrounding of human life. When issue levels are increase as far as unpredictability, measurement, constrained information about the issue area, achievable locale and a like, it winds up hard to resolve issues utilizing customary optimization approaches (Sharma & Pant, 2018). Optimization approaches propelled either by the social or by some organic wonder in the nature have drawn the intrigue and consideration of specialists to understand these qualities of complex optimization. These are straightforward and simple to actualize approaches that don't require any helper learning of the issue, and furthermore the execution cost is very sensible in correlation with customary algorithm (Sharma & pant, 2017).

Complete Article List

Search this Journal:
Volume 14: 1 Issue (2023): Forthcoming, Available for Pre-Order
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing