Joint Chain-Based Service Provisioning and Request Scheduling for Blockchain-Powered Edge Computing

被引:9
作者
Gu, Siyuan [1 ]
Luo, Xueshan [1 ]
Guo, Deke [1 ,2 ]
Ren, Bangbang [1 ]
Tang, Guoming [2 ]
Xie, Junjie [3 ]
Sun, Yuchen [1 ]
机构
[1] Natl Univ Def Technol, Sci & Technol Informat Syst Engn Lab, Changsha 410073, Peoples R China
[2] Peng Cheng Lab, Network Commun Res Ctr, Shenzhen 518000, Peoples R China
[3] PLA, Inst Syst Engn, AMS, Beijing 100141, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Cloud computing; Optimization; Servers; Edge computing; Processor scheduling; Internet of Things; Collaboration; Blockchain-powered edge computing (BEC); chain-based service; IoT applications; service provisioning; NETWORKS; SYSTEMS;
D O I
10.1109/JIOT.2020.3026183
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Blockchain-powered edge computing (BEC) is a promising extension to strengthen the security and the trustworthiness among collaborative edge clouds for delivering computation-intensive and delay-sensitive services in the environments of IoT and 5G. A fundamental challenge is how to respond to the maximum number of IoT requests at the network edge instead of the remote cloud. Although some work has been done to consider service provisioning and request scheduling in collaborative edge clouds, they assume that a single service is used to respond to each request. This assumption, however, is not practical to meet the demand of emerging IoT applications. In reality, the request needs to call a set of services with a chain-based structure. To tackle this challenge, in this article, we first propose a chain-based service request model for emerging IoT applications and further study the joint service provisioning and request scheduling problem for chain-based service requests at the network edge. We characterize this problem as an integer linear programming (ILP) model and prove the NP-hardness of this joint optimization problem. Furthermore, we prove that the related problem is of approximate submodularity with an approximation ratio guarantee. Finally, a novel two-stage optimization (TSO) scheme is proposed, and the results of extensive experiments show the efficiency and the effectiveness of the TSO scheme.
引用
收藏
页码:2135 / 2149
页数:15
相关论文
共 45 条
[1]   On Enabling 5G Automotive Systems Using Follow Me Edge-Cloud Concept [J].
Aissioui, Abdelkader ;
Ksentini, Adlen ;
Gueroui, Abdelhak Mourad ;
Taleb, Tarik .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (06) :5302-5316
[2]   A survey on service function chaining [J].
Bhamare, Deval ;
Jain, Raj ;
Samaka, Mohammed ;
Erbad, Aiman .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2016, 75 :138-155
[3]  
Chekuri C, 2000, PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P213
[4]   Collaborative Content Placement Among Wireless Edge Caching Stations With Time-to-Live Cache [J].
Chen, Lixing ;
Song, Linqi ;
Chakareski, Jacob ;
Xu, Jie .
IEEE TRANSACTIONS ON MULTIMEDIA, 2020, 22 (02) :432-444
[5]   Efficient Multi-User Computation Offloading for Mobile-Edge Cloud Computing [J].
Chen, Xu ;
Jiao, Lei ;
Li, Wenzhong ;
Fu, Xiaoming .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (05) :2827-2840
[6]   Distributed Fault Detection for Wireless Sensor Networks Based on Support Vector Regression [J].
Cheng, Yong ;
Liu, Qiuyue ;
Wang, Jun ;
Wan, Shaohua ;
Umer, Tariq .
WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2018,
[7]   Mathematical models and decomposition methods for the multiple knapsack problem [J].
Dell'Amico, Mauro ;
Delorme, Maxence ;
Iori, Manuel ;
Martello, Silvano .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (03) :886-899
[8]   Zipf's power law in activity schedules and the effect of aggregation [J].
Ectors, Wim ;
Kochan, Bruno ;
Janssens, Davy ;
Bellemans, Tom ;
Wets, Geert .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 107 :1014-1025
[9]   On Using Micro-Clouds to Deliver the Fog [J].
Elkhatib, Yehia ;
Porter, Barry ;
Ribeiro, Heverson B. ;
Zhani, Mohamed Faten ;
Qadir, Junaid ;
Riviere, Etienne .
IEEE INTERNET COMPUTING, 2017, 21 (02) :8-15
[10]  
Farhadi V, 2019, IEEE INFOCOM SER, P1279, DOI [10.1109/INFOCOM.2019.8737368, 10.1109/infocom.2019.8737368]