4.7 Article

A data replica placement strategy for IoT workflows in collaborative edge and cloud environments

Journal

COMPUTER NETWORKS
Volume 148, Issue -, Pages 46-59

Publisher

ELSEVIER
DOI: 10.1016/j.comnet.2018.10.017

Keywords

Replica placement; IoT; Workflow; Edge computing; Ito algorithm

Funding

  1. National Natural Science Foundation (NSF) [61672397, 61873341, 61472294, 61771354]
  2. Application Foundation Frontier Project of WuHan [2018010401011290]
  3. Beijing Intelligent Logistics System Collaborative Innovation Center Open Project [BILSCIC-2018KF-02]
  4. Beijing Youth Top-notch Talent Plan of High-Creation Plan [2017000026833ZK25]
  5. Canal Plan-Leading Talent Project of Beijing Tongzhou District [YHLB2017038]
  6. Beijing Key Laboratory of Intelligent Logistics System [BZ0211]

Ask authors/readers for more resources

The convergence of edge and cloud computing shares their strengths, such as unlimited shared storage and computing resources from cloud, low-latency data preprocessing of edge computing. The collaboration of the two computing paradigms can provide a real-time and cost-effective way to deploy Internet of Things (loT) workflows among cooperative user groups. Since huge amounts of datasets continuously generated from user devices, how to place them to reduce the data access costs while meeting the deadline constraint is a critical issue. This paper proposed a novel data replica placement strategy for coordinated processing data-intensive loT workflows in collaborative edge and cloud computing environment. Firstly, data replica placement can be modelled as a 0-1 integer programming problem to consider the overall data dependency, data reliability and user cooperation. And then, the ITO algorithm, a variant of intelligent swarm optimization, is presented to address this model. The experimental results show that the proposed method outperforms these compared algorithms. It can not only find a higher quality solution of data replica placement, but also need a lower computing budget compared with these traditional algorithms. (C) 2018 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available