2017
DOI: 10.1002/cpe.4290
|View full text |Cite
|
Sign up to set email alerts
|

Network failure–aware redundant virtual machine placement in a cloud data center

Abstract: Summary Cloud has become a very popular infrastructure for many smart city applications. A growing number of smart city applications from all over the world are deployed on the clouds. However, node failure events from the cloud data center have negative impact on the performance of smart city applications. Survivable virtual machine placement has been proposed by the researchers to enhance the service reliability. Because of the ignorance of switch failure, current survivable virtual machine placement approac… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(4 citation statements)
references
References 29 publications
0
4
0
Order By: Relevance
“…The target of the online fault tolerance is to find an optimal service composition to replace the failed one and satisfy the functional and non-functional (QoS) constraints at the same time. In the existing studies, the problem can be abstracted as a 0-1 integer constrained multi-objective optimization problem, which is formulated in (14).…”
Section: ) Service Availabilitymentioning
confidence: 99%
“…The target of the online fault tolerance is to find an optimal service composition to replace the failed one and satisfy the functional and non-functional (QoS) constraints at the same time. In the existing studies, the problem can be abstracted as a 0-1 integer constrained multi-objective optimization problem, which is formulated in (14).…”
Section: ) Service Availabilitymentioning
confidence: 99%
“…Until the process is complete, the routing of packets is performed based on outdated or missing entries, and many packets may be lost. Great efforts have been made to reduce the time required for a routing protocol to advertise information about network changes and recalculate the new set of shortest routes [14][15][16][17][18][19][20][21][22][23]. However, simply shortening the routing protocol timers to achieve faster network convergence is not recommended as this can lead to network destabilization by making the routing protocol too responsive [24][25][26].…”
Section: Introductionmentioning
confidence: 99%
“…Regardless of these facts, however, computing a replacement path after the primary path has failed always incurs a possibly significant increase in network convergence time because the process begins only after the primary path has already become unusable. Many efforts have gone into shortening the time needed for a routing protocol to advertise a change in network connectivity and re-compute the new set of shortest paths [3][4][5][6][7][8] ; however, there is a fine line between rapid convergence and destabilization of the network by making a routing protocol respond too eagerly. [9][10][11] An important fact is that a given router at a particular place in a network topology only has a finite (and usually very small) set of possible failure scenarios relevant to network convergence.…”
Section: Introductionmentioning
confidence: 99%