Double-Matching Resource Allocation Strategy in Fog Computing Networks Based on Cost Efficiency

被引:63
|
作者
Jia, Boqi [1 ]
Hu, Honglin [2 ]
Zeng, Yu [1 ]
Xu, Tianheng [2 ]
Yang, Yang [3 ]
机构
[1] Chinese Acad Sci, Shanghai Inst Microsyst & Informat Technol, Beijing, Peoples R China
[2] Chinese Acad Sci, Shanghai Adv Res Inst, Beijing, Peoples R China
[3] ShanghaiTech Univ, Sch Informat Sci & Technol, Shanghai Inst Fog Comp Technol SHIFT, Shanghai, Peoples R China
基金
中国国家自然科学基金;
关键词
Cost efficiency; fog computing networks; matching; resource allocation; CLOUD;
D O I
10.1109/JCN.2018.000036
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Fog computing is an advanced technique to decrease latency and network congestion, and provide economical gains for Internet of Things (IoT) networks. In this paper, we investigate the computing resource allocation problem in three-layer fog computing networks. We first formulated the resource allocation problem as a double two-sided matching optimization problem. Then, we propose a double-matching strategy for the resource allocation problem in fog computing networks based on cost efficiency, which is derived by analysing the utility and cost in fog computing networks. The proposed double-matching strategy is an extension of the deferred acceptance algorithm from two-side matching to three-side matching. Numerical results show that high cost efficiency performance can be achieved by adopting the proposed strategy. Furthermore, by using the proposed strategy, the three participants in the fog computing networks could achieve stable results that each participant cannot change its paired partner unilaterally for more cost efficiency.
引用
收藏
页码:237 / 246
页数:10
相关论文
共 50 条
  • [41] Role of Machine Learning in Resource Allocation of Fog Computing
    Mahta, Sunakshi
    Singh, Akansha
    Singh, Krishna Kant
    2021 11TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING, DATA SCIENCE & ENGINEERING (CONFLUENCE 2021), 2021, : 262 - 266
  • [42] Optimal Resource Allocation in Ultra-low Power Fog-computing SWIPT-based Networks
    Janatian, Nafiseh
    Stupia, Ivan
    Vandendorpe, Luc
    2018 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2018,
  • [43] Resource Allocation Scheme for Community-Based Fog Computing Based on Reputation Mechanism
    Gu, Ke
    Tang, Linyu
    Jiang, Jiafu
    Jia, WeiJia
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2020, 7 (05) : 1246 - 1263
  • [44] Double auction mechanisms in edge computing resource allocation for blockchain networks
    Xie, Ning
    Zhang, Jixian
    Zhang, Xuejie
    Li, Weidong
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2024, 27 (03): : 3017 - 3035
  • [45] A Market-Based Framework for Multi-Resource Allocation in Fog Computing
    Duong Tung Nguyen
    Long Bao Le
    Bhargava, Vijay K.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (03) : 1151 - 1164
  • [46] Spider monkey optimization based resource allocation and scheduling in fog computing environment
    Hajam, Shahid Sultan
    Sofi, Shabir Ahmad
    HIGH-CONFIDENCE COMPUTING, 2023, 3 (03):
  • [47] A New Approach to the Resource Allocation Problem in Fog Computing Based on Learning Automata
    Pourian, RezaEbrahim
    Fartash, Mehdi
    Torkestani, Javad Akbari
    CYBERNETICS AND SYSTEMS, 2024, 55 (07) : 1594 - 1613
  • [48] Tasks Scheduling and Resource Allocation in Fog Computing Based on Containers for Smart Manufacturing
    Yin, Luxiu
    Luo, Juan
    Luo, Haibo
    IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2018, 14 (10) : 4712 - 4721
  • [49] Energy-efficiency fog computing resource allocation in cyber physical internet of things systems
    Chen, Xincheng
    Zhou, Yuchen
    He, Bintao
    Lv, Lu
    IET COMMUNICATIONS, 2019, 13 (13) : 2003 - 2011
  • [50] Computation Resource Allocation and Task Assignment Optimization in Vehicular Fog Computing: A Contract-Matching Approach
    Zhou, Zhenyu
    Liu, Pengju
    Feng, Junhao
    Zhang, Yan
    Mumtaz, Shahid
    Rodriguez, Jonathan
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2019, 68 (04) : 3113 - 3125