Performance analysis of cloud resource allocation scheme with virtual machine inter-group asynchronous failure

The recent rapid expansion of cloud computing has led to the prominence of Cloud Data Center (CDC) emerging. However, user requests’ waiting time might be greatly increased for a single physical machine (PM) in the CDC. We provide a cloud resource allocation scheme with virtual machine (VM) inter-group asynchronous failure. This method improves requests’ throughput and reduces wait time of requests. In particular, two PMs with different service rates for mapping multiple VMs are deployed in order to equally distribute cloud users’ requests, and we assume that the two PMs will fail and repair at different probabilities. A finite cache is also introduced to reduce the requests’ blocking rate. We model the VMs and user requests and create a 3-dimensional Markov chain (3DMC) to gauge the requests’ performance metrics. Numerical experiments are performed to obtain multiple performance metrics graphs for the requests. By comparing our scheme with the traditional cloud resource allocation scheme that involves synchronization failure in VM, we find that our scheme has an improvement in throughput, and each scheme has advantages and disadvantages in blocking rate of requests.

Authors

Institutions

Publication Details

Journal
Journal of King Saud University - Computer and Information Sciences
Published
2024-08-08
DOI
https://doi.org/10.1016/j.jksuci.2024.102155
Citations
4
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
3.12

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Performance analysis of cloud resource allocation scheme with virtual machine inter-group asynchronous failure

Yuan Zhao, Hongmin Gao, Yan Li, Kang Chen
4 citations
Journal of King Saud University - Computer and Information Sciences
Cloud Computing and Resource Management
3.12
article

Performance analysis of cloud resource allocation scheme with virtual machine inter-group asynchronous failure

Yuan Zhao, Hongmin Gao, Yan Li, Kang Chen
article en
4 citations

Abstract

The recent rapid expansion of cloud computing has led to the prominence of Cloud Data Center (CDC) emerging. However, user requests’ waiting time might be greatly increased for a single physical machine (PM) in the CDC. We provide a cloud resource allocation scheme with virtual machine (VM) inter-group asynchronous failure. This method improves requests’ throughput and reduces wait time of requests. In particular, two PMs with different service rates for mapping multiple VMs are deployed in order to equally distribute cloud users’ requests, and we assume that the two PMs will fail and repair at different probabilities. A finite cache is also introduced to reduce the requests’ blocking rate. We model the VMs and user requests and create a 3-dimensional Markov chain (3DMC) to gauge the requests’ performance metrics. Numerical experiments are performed to obtain multiple performance metrics graphs for the requests. By comparing our scheme with the traditional cloud resource allocation scheme that involves synchronization failure in VM, we find that our scheme has an improvement in throughput, and each scheme has advantages and disadvantages in blocking rate of requests.

Journal of King Saud University - Computer and Information SciencesVol. 36(7)
Northeastern University (CN)
National University's Basic Research Foundation of China, Fundamental Research Funds for the Central Universities
Decent work and economic growth
Openalex Percentile: Top 7%
Cloud Computing and Resource Management
3.12
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.