Cost-effective replication management and scheduling in edge computing

被引:41
作者
Shao, Yanling [1 ,2 ]
Li, Chunlin [1 ,3 ]
Fu, Zhao [3 ]
Jia, Leyue [3 ]
Luo, Youlong [1 ]
机构
[1] Wuhan Univ Technol, Dept Comp Sci, Wuhan 430063, Hubei, Peoples R China
[2] Nanyang Inst Technol, Coll Comp & Informat Engn, Nanyang 473000, Peoples R China
[3] State Key Lab Smart Mfg Special Vehicles & Transm, Baotou City 014030, Inner Mongolia, Peoples R China
关键词
Replica creation; Data scheduling; Replication management; Edge computing; DATA PLACEMENT; CLOUD; ALGORITHM; WORKFLOW; OPTIMIZATION; PERFORMANCE; INTEGRATION; TOPOLOGY; STRATEGY; LATENCY;
D O I
10.1016/j.jnca.2019.01.001
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The high volumes of data are continuously generated from Internet of Things (IoT) sensors in an industrial landscape. Especially, the data-intensive workflows from IoT systems require to be processed in a real-time, reliable and low-cost way. Edge computing can provide a low-latency and cost-effective computing paradigm to deploy workflows. Therefore, data replication management and scheduling for delay-sensitive workflows in edge computing have become challenge research issues. In this work, first, we propose a replication management system which includes dynamic replication creator, a specialized cost-effective scheduler for data placement, a system watcher and some data security tools for collaborative edge and cloud computing systems. And then, considering task dependency, data reliability and sharing, the data scheduling for the workflows is modeled as an integer programming problem. And we present the faster meta-heuristic algorithm to solve it. The experimental results show that our algorithms can achieve much better system performance than comparative traditional strategies, and they can create a suitable number of data copies and search the higher quality replica placement solution while reducing the total data access costs under the deadline constraint.
引用
收藏
页码:46 / 61
页数:16
相关论文
共 39 条
[31]  
Shorfuzzaman M., 2011, INT C P2P
[32]   An improved multicast based energy efficient opportunistic data scheduling algorithm for VANET [J].
Shrivastava, Anurag ;
Bansod, Prashant ;
Gupta, Kamlesh ;
Merchant, Shabbir N. .
AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 2018, 83 :407-415
[33]  
Shvachko K, 2010, IEEE S MASS STOR SYS
[34]   Optimizing workflow data footprint [J].
Singh, Gurmeet ;
Vahi, Karan ;
Ramakrishnan, Arun ;
Mehta, Gaurang ;
Deelman, Ewa ;
Zhao, Henan ;
Sakellariou, Rizos ;
Blackburn, Kent ;
Brown, Duncan ;
Fairhurst, Stephen ;
Meyers, David ;
Berriman, G. Bruce ;
Good, John ;
Katz, Daniel S. .
SCIENTIFIC PROGRAMMING, 2007, 15 (04) :249-268
[35]   Conceptual design of new data integration and process system for KSTAR data scheduling [J].
Tak, Taehyun ;
Hong, Jaesic ;
Park, Kaprai ;
Lee, Woongryul ;
Lee, Taegu ;
Han, Hyunsun ;
Kwon, Giil ;
Park, Jinseop .
FUSION ENGINEERING AND DESIGN, 2018, 129 :330-333
[36]   Dynamic resource allocation strategy for latency-critical and computation-intensive applications in cloud-edge environment [J].
Tang, Hengliang ;
Li, Chunlin ;
Bai, Jingpan ;
Tang, JianHang ;
Luo, Youlong .
COMPUTER COMMUNICATIONS, 2019, 134 :70-82
[37]   A wearable sensor-based activity prediction system to facilitate edge computing in smart healthcare system [J].
Uddin, Md. Zia .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2019, 123 :46-53
[38]   A novel ITO Algorithm for influence maximization in the large-scale social networks [J].
Wang, Yufeng ;
Dong, Wenyong ;
Dong, Xueshi .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 88 :755-763
[39]   A Distributed Algorithm for the Replica Placement Problem [J].
Zaman, Sharrukh ;
Grosu, Daniel .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (09) :1455-1468