Game-Theoretic Online Resource Allocation Scheme on Fog Computing for Mobile Multimedia Users

• 作 者: Yingmo Jie Mingchu Li Cheng Guo Ling Chen
• 机 构: Institution of Applied Mathematics, Dalian University of Technology, Dalian 116024, China;School of
• 出 处: 中国通信（英文版）
• 发表日期: 2019年3期
• 关键词: fog computing online resource allocation Stackelberg game dynamic multi-media

Fog computing is introduced to relieve the problems triggered by the long distance between the cloud and terminal de-vices. In this paper, considering the mobility of terminal devices represented as mobile multimedia users (MMUs) and the continuity of requests delivered by them, we propose an online resource allocation scheme with respect to deciding the state of servers in fog nodes distributed at different zones on the premise of satisfying the quality of experience (QoE) based on a Stackelberg game. Specifically, a multi-round of a predictablyunpredictably dy-namic scheme is derived from a single-round of a static scheme. The optimal allocation schemes are discussed in detail, and related experiments are designed. For simulations, comparing with non-strategy schemes, the performance of the dynamic scheme is better at minimizing the cost used to maintain fog nodes for providing services.