Xiong Fu

Dr. Xiong Fu

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 February 2015 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
XFXiong Fu
Xiong Fu
CZChen Zhou
Chen Zhou

9 August 2017 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
XFXiong Fu
Xiong Fu
CZChen Zhou
Chen Zhou
In cloud data centers, an appropriate Virtual Machine (VM) placement has become an effective method to improve the resource utilization and reduce the energy consumption. However, most current solutions regard the VM placement as a bin-packing problem and each VM is seen as a single object. None of them have taken the relationships between VMs into consideration, which supplies us with a kind of new perspective. In this paper, we provide a model which explores the relationships for every two VMs based on the resource requirement provided by ARIMA prediction. This model evaluates the volatility of resource utilization after putting the two VMs on the same host and we call this model as affinity model. Based on the affinity model, VMs will be placed on those hosts that have the highest affinity with them. Therefore, we call it as Predicted Affinity based Virtual Machine Placement Algorithm (PAVMP). The advantages of PAVMP are showed by comparing it with other VM placement algorithms on CloudSim simulation platform with the PlanetLab and Google workload trace.

4 May 2017 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
XFXiong Fu
Xiong Fu
JCJuzhou Chen
Juzhou Chen
SDSong Deng
Song Deng
JWJunchang Wang
Junchang Wang
LZLin Zhang
Lin Zhang

12 January 2016 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
XFXiong Fu
Xiong Fu
WLWenjie Liu
Wenjie Liu
YCYeliang Cang
Yeliang Cang
XGXiaojie Gong
Xiaojie Gong
SDSong Deng
Song Deng
Cloud storage has become an important part of a cloud system nowadays. Most current cloud storage systems perform well for large files but they cannot manage small file storage appropriately. With the development of cloud services, more and more small files are emerging. Therefore, we propose an optimized data replication approach for small files in cloud storage systems. A small file merging algorithm and a block replica placement algorithm are involved in this approach. Small files are classified into four types according to their access frequencies. A number of small files will be merged into the same block based on which type they belong to. And the replica placement algorithm helps to improve the access efficiencies of small files in a cloud system. Related experiment results demonstrate that our proposed approach can effectively shorten the time spent reading and writing small files, and it performs better than the other two already known data replication algorithms: HAR and SequenceFile.

1 January 2021 in Chinese Journal of Electronics
Verified
Journal Article
Open access
PDF file
LZLin Zhang
Lin Zhang
HYHuang Yanwen
Huang Yanwen
XJXuan Jie
Xuan Jie
XFXiong Fu
Xiong Fu
LQLin Qiaomin
Lin Qiaomin
RWRuchuan Wang
Ruchuan Wang
Due to the challenge of increasing data volume, the traditional trust model is unable to manage data with high efficiency and effectively extract useful information hidden in big data. To fully utilize big data and combine machine learning with trust evaluation, a trust evaluation model based on Long short‐term memory (LSTM) is presented. The powerful learning ability, expressive ability and dynamic timing of LSTM can be applied to study data while avoiding the vanishing and exploding gradient phenomena of traditional Recurrent neural networks (RNNs) to ensure that the model can learn sequences of random length and provide accurate trust evaluation. Targeting the performance instability caused by the LSTM model's random initialization of weights and thresholds, Particle swarm optimization (PSO), one of the intelligent algorithms, is introduced to find global optimal initial weights and thresholds. Experiments proved that the trust model proposed in this paper has high accuracy and contributes a new idea for trust evaluation in big data environments.

14 February 2018 in Scientific Programming
Verified
Journal Article
Open access
PDF file
XFXiong Fu
Xiong Fu
QZQing Zhao
Qing Zhao
JWJunchang Wang
Junchang Wang
LZLin Zhang
Lin Zhang
LQLei Qiao
Lei Qiao
In recent years, high energy consumption has gradually become a prominent problem in a data center. With the advent of cloud computing, computing and storage resources are bringing greater challenges to energy consumption. Virtual machine (VM) initial placement plays an important role in affecting the size of energy consumption. In this paper, we use binary particle swarm optimization (BPSO) algorithm to design a VM placement strategy for low energy consumption measured by proposed energy efficiency fitness, and this strategy needs multiple iterations and updates for VM placement. Finally, the strategy proposed in this paper is compared with other four strategies through simulation experiments. The results show that our strategy for VM placement has better performance in reducing energy consumption than the other four strategies, and it can use less active hosts than others.