2014
DOI: 10.5120/16849-6709
|View full text |Cite
|
Sign up to set email alerts
|

Virtual Machines Migration based on Greedy Algorithm in Cloud Computing

Abstract: Cloud computing is a term that used for distributed computing, on a network. It is meant network-based services that these services are provided through virtual ISPs. Most of the old virtual machine migration techniques concentrated on the migration of a single virtual machine. These techniques are insufficient, when the whole virtual cluster needs to be migrated. In these methods, data replication in each round leads to many computational overheads.In this paper, a method is proposed for virtual machine migra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…classified into 6 regions [27][28][29][30][31][32][33][34][35][36]. In this research, we consider region 0, which is North America, because the percentage of users in this region is 80 million [31].…”
Section: Firefly Optimization Approachmentioning
confidence: 99%
“…classified into 6 regions [27][28][29][30][31][32][33][34][35][36]. In this research, we consider region 0, which is North America, because the percentage of users in this region is 80 million [31].…”
Section: Firefly Optimization Approachmentioning
confidence: 99%
“…VMs within a cluster are set with priority which lessens the migration time. Then it is simulated and results point out that the link bandwidth is significant parameter in the migration [23].…”
Section: Erlang Concurrent Trafficmentioning
confidence: 99%
“…In the case of the Greedy Algorithm, every time the data items were taken in a sequence which was deemed best in accordance with certain criterion. The GA will arrive at a new solution by making some choices that look the best [23]. This algorithm will begin with an empty set that adds items to a set in a sequence until such time a set represents a new solution to the problem.…”
Section: B Data Replication Using Greedy Search Algorithmmentioning
confidence: 99%