A Machine-Learning-Based Auction for Resource Trading in Fog Computing

被引:46
作者
Luong, Nguyen Cong [1 ,2 ]
Jiao, Yutao [3 ]
Wang, Ping [4 ]
Niyato, Dusit [3 ]
Kim, Dong In [5 ]
Han, Zhu [6 ]
机构
[1] PHENIKAA Univ, Fac Informat Technol, Hanoi, Vietnam
[2] PRATI, Hanoi, Vietnam
[3] Nanyang Technol Univ, Sch Comp Sci & Engn, Singapore, Singapore
[4] York Univ, Dept Elect Engn & Comp Sci, N York, ON, Canada
[5] Sungkyunkwan Univ, Coll Informat & Commun Engn, Suwon, South Korea
[6] Univ Houston, Elect & Comp Engn Dept, Houston, TX 77004 USA
基金
新加坡国家研究基金会;
关键词
Edge computing; Blockchain; Resource management; Biological system modeling; Integrated circuits; Cloud computing; Computational modeling; Machine learning;
D O I
10.1109/MCOM.001.1900136
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Fog computing is considered to be a key enabling technology for future networks. By broadening the cloud computing services to the network edge, fog computing can support various emerging applications such as IoT, big data, and blockchain with low latency and low bandwidth consumption cost. To achieve the full potential of fog computing, it is essential to design an incentive mechanism for fog computing service providers. Auction is a promising solution for the incentive mechanism design. However, it is challenging to design an optimal auction that maximizes the revenue for the providers while holding important properties: IR and IC. Therefore, this article introduces the design of an optimal auction based on deep learning for the resource allocation in fog computing. The proposed optimal auction is developed specifically to support blockchain applications. In particular, we first discuss resource management issues in fog computing. Second, we review economic and pricing models for resource management in fog computing. Third, we introduce fog computing and blockchain. Fourth, we present how to design the optimal auction by using deep learning for the fog resource allocation in the blockchain network. Simulation results demonstrate that the proposed scheme outperforms the baseline scheme (i.e., the greedy algorithm) in terms of revenue, and IC and IR violations. Thus, the proposed scheme can be used as a useful tool for the optimal resource allocation in general fog networks.
引用
收藏
页码:82 / 88
页数:7
相关论文
共 10 条
[1]   Greedy algorithm for the general multidimensional knapsack problem [J].
Akcay, Yalcin ;
Li, Haijun ;
Xu, Susan H. .
ANNALS OF OPERATIONS RESEARCH, 2007, 150 (01) :17-29
[2]  
[Anonymous], P C NEUR INF PROC SY
[3]  
[Anonymous], 2014, CONSTRAINED OPTIMIZA
[4]  
Antunes C.H., 2016, MULTIOBJECTIVE LINEA, DOI DOI 10.1007/978-3-319-28746-1
[5]   Brokering in interconnected cloud computing environments: A survey [J].
Chauhan, Sameer Singh ;
Pilli, Emmanuel S. ;
Joshi, R. C. ;
Singh, Girdhari ;
Govil, M. C. .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2019, 133 :193-209
[6]  
Jiao YT, 2018, IEEE ICC
[7]   Proof-of-Work Consensus Approach in Blockchain Technology for Cloud and Fog Computing Using Maximization-Factorization Statistics [J].
Kumar, Gulshan ;
Saha, Rahul ;
Rai, Mritunjay Kumar ;
Thomas, Reji ;
Kim, Tai-Hoon .
IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (04) :6835-6842
[8]   RISC: Robust Infrastructure over Shared Computing Resources Through Dynamic Pricing and Incentivization [J].
Mukherjee, Tridib ;
Dutta, Partha ;
Hegde, Vinay G. ;
Gujar, Sujit .
2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2015, :1107-1116
[9]  
Luong NC, 2018, IEEE ICC
[10]  
Yi S., 2015, P 2015 WORKSH MOB BI, P37