2018
DOI: 10.1016/j.compeleceng.2017.12.032
|View full text |Cite
|
Sign up to set email alerts
|

Crow search based virtual machine placement strategy in cloud data centers with live migration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
49
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 92 publications
(49 citation statements)
references
References 10 publications
0
49
0
Order By: Relevance
“…They proposed two different technique CSA-based travel salesman problem (TSPCS) and Greedy Crow Search (GCS). The same problem has been handled by Satpathy et al [153] where a 2-tier VM placement algorithm has been proposed. First, a queuing structure to schedule VMs, whereas the second (CSAVMP) CSA-based VM problem was developed to reduce the consumption of power at data centers.…”
Section: ) Cloudmentioning
confidence: 96%
“…They proposed two different technique CSA-based travel salesman problem (TSPCS) and Greedy Crow Search (GCS). The same problem has been handled by Satpathy et al [153] where a 2-tier VM placement algorithm has been proposed. First, a queuing structure to schedule VMs, whereas the second (CSAVMP) CSA-based VM problem was developed to reduce the consumption of power at data centers.…”
Section: ) Cloudmentioning
confidence: 96%
“…VM consolidation by bin packing into fewer servers can significantly improve energy efficiency. The authors in [38] proposed a VM placement algorithm that uses VM popularity to explore the search space, achieving up to 40% power savings and reducing the number of servers used by up to 50% compared to placement based on first fit decreasing (FFD) techniques. In [39], the authors proposed a VM placement algorithm that balances the processing and memory resources of servers resulting in reducing the total power consumption by 15% compared to FFD techniques.…”
Section: Energy Efficient Placement Of Virtual Machines Over Cloumentioning
confidence: 99%
“…Constraints (31), (34), and (37) calculate the VM replica workload in a cloud, a metro fog, and an access fog, respectively, as a linear function of the traffic resulting from serving users of the replicas plus the workload baseline. Constraints (32), (35), and (38) calculate the total workload of a cloud, a metro fog, and an access fog, respectively, by summing the workloads of VMs hosted in them. Constraints (30)- (38) ensure that the VM CPU workload v satisfies user requirements to maintain QoS.…”
Section: Sw (P) Smentioning
confidence: 99%
“…Data, placed in close proximity to the VM, with the decrease in VM communication distance, resulted in a reduction in job completion time [39]. A queuing structure to handle a large set of VMs and crow-search-based multi-objective optimization was used to reduce resource wastage and power consumption in datacenters [40]. The results were compared against the genetic algorithm and the first fit decreasing approach.…”
Section: Related Workmentioning
confidence: 99%