Cloud/Edge Computing Resource Allocation and Pricing for Mobile Blockchain: An Iterative Greedy and Search Approach

被引:54
作者
Fan, Yuqi [1 ]
Wang, Lunfei [1 ]
Wu, Weili [2 ]
Du, Dingzhu [2 ]
机构
[1] Hefei Univ Technol, Sch Comp & Informat Engn, Hefei 230601, Peoples R China
[2] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75082 USA
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Blockchain; Servers; Resource management; Pricing; Task analysis; Computational modeling; Cloud computing; edge computing; mobile blockchain; resource allocation; resource pricing; SYSTEMS;
D O I
10.1109/TCSS.2021.3049152
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Blockchain can provide a dependable environment for the Internet of Things (IoT), while the high computing power and energy required by blockchain hinder its applications in IoT. Offloading the computation at the resource-limited IoT devices to a cloud/edge computing service provider (CESP) is a feasible solution to the execution of computation-intensive blockchain tasks. The CESP provides computing resources to IoT users with a cloud and multiple edge servers that work collaboratively such that the users are able to perform mobile blockchain services. Resource allocation and pricing of computing resources at the cloud/edges have a significant impact on the revenues of CESP and users. Most of the existing works on the cooperative edge-cloud for computation offloading assumes that a user is mapped to a prespecified edge server or the cloud. However, the CESP may choose a server from either the edge servers or the cloud to run the offloaded tasks by jointly considering the cost and income of the service provisioning. In this article, we formulate a Stackelberg game with CESP as the leader and users as the followers for cloud/edge computing resource management. We prove the existence of Stackelberg equilibrium and analyze the equilibrium. We then model the resource allocation and pricing at the CESP as a mixed-integer programming problem (MIP) with the objective to optimize the CESP's revenue and propose an efficient iterative greedy-and-search-based resource allocation and pricing algorithm (IGS). The algorithm solves two subproblems comprising the CESP's revenue optimization problem: resource allocation under a given resource price and resource pricing based on a specified resource allocation scheme. The first subproblem evaluates where to execute the computing tasks via a greedy-and-search-based approach, whereas the second subproblem estimates the resource price through golden section search. We conduct experiments through simulations. Simulation results show that the proposed algorithm can effectively improve the revenue of both the CESP and the IoT terminals.
引用
收藏
页码:451 / 463
页数:13
相关论文
共 27 条
[1]  
Abdellatif K, 2018, 2018 6 INT C WIR NET, P1
[2]  
Altman E., 2018, ARXIV180903143
[3]  
Arenas R, 2018, INT ICE CONF ENG
[4]   Blockchain framework for IoT data quality via edge computing [J].
Casado-Vara, Roberto ;
de la Prieta, Fernando ;
Prieto, Javier ;
Corchado, Juan M. .
BLOCKSYS'18: PROCEEDINGS OF THE 1ST BLOCKCHAIN-ENABLED NETWORKED SENSOR SYSTEMS, 2018, :19-24
[5]  
Chamarajnagar R, 2018, IEEE GLOB COMM CONF
[6]  
Chiu J., 2019, Social Design, P323
[7]   The Controller Placement Problem [J].
Heller, Brandon ;
Sherwood, Rob ;
McKeown, Nick .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2012, 42 (04) :473-478
[8]   Auction Mechanisms in Cloud/Fog Computing Resource Allocation for Public Blockchain Networks [J].
Jiao, Yutao ;
Wang, Ping ;
Niyato, Dusit ;
Suankaewmanee, Kongrath .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2019, 30 (09) :1975-1989
[9]   Auction-Based Resource Allocation for Sharing Cloudlets in Mobile Cloud Computing [J].
Jin, A-Long ;
Song, Wei ;
Zhuang, Weihua .
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2018, 6 (01) :45-57
[10]   Blockchain for Secure and Efficient Data Sharing in Vehicular Edge Computing and Networks [J].
Kang, Jiawen ;
Yu, Rong ;
Huang, Xumin ;
Wu, Maoqiang ;
Maharjan, Sabita ;
Xie, Shengli ;
Zhang, Yan .
IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (03) :4660-4670