An Approach towards Development of a Migration enabled Improved Datacenter Broker Policy

Abstract

Cloud computing has left its remarkable note on the computing world over the last few years. Through its effectiveness, litheness, scalability & availability cloud computing has changed the nature of computer system deployment. The Quality of Service (QoS)of a cloud service provider (CSP) is an important element of research interest which includes different critical issues such as proper load, minimization of waiting time, turnaround time, makespan and suppressing the wastage of bandwidth of the system. The Datacenter Broker (DCB) policy help assigning a cloudlet to a VM. In the present study, we proposed an algorithm, i.e., Migration enabled Cloudlet Allocation Policy (MCAP) for allocation of cloudlets to the VMs in a Datacenter by taking into account the load capacity of VMs and length of the cloudlets. The experimental results obtained using CloudSim toolkit under extensive loads that establish performance supremacy of MCAP algorithm over the existing algorithms.

Optimal virtual machine scheduling in virtualized cloud environment using VIKOR method

“…Based on these threshold values, hosts are classified as little loaded, lightly loaded, moderately loaded, and heavily loaded hosts. Baskaran and Eswari [24] proposed a VM placement algorithm based on energy consumption and Service Level Agreement (SLA) violation rate. K-means clustering algorithm was used to obtain four threshold values to define host status, i.e., idle, less loaded, little loaded, normal loaded, overloaded host.…”

“…If more than one servers are capable of scheduling the VM v j , then Algorithm 2 is called for selecting the suitable server among the available (see line 21). If assignedServer list is not NULL, then VM v j is scheduled on the server, which is in the assignedServer list (see lines [22][23][24].…”

“…The solution with the highest resource utilization is stored in the assignedServer list (see lines [20][21][22][23]. If the best alternative A ′ has both acceptable advantage and acceptable stability, then it is stored in the assignedServer list (see lines [24][25][26]. The assignedServer list is returned to the calling algorithm (see line 27).…”