Hierarchical Fog-Cloud Computing for IoT Systems: A Computation Offloading Game
Hamed Shah-Mansouri, Vincent W.S. Wong

TL;DR
This paper models hierarchical fog-cloud resource allocation for IoT systems as a game, proving equilibrium existence and proposing a near-optimal mechanism that improves user QoE and reduces delays.
Contribution
It introduces a novel game-theoretic framework for resource allocation in fog-cloud IoT systems and proposes an efficient mechanism for near-optimal offloading.
Findings
Proves existence of pure Nash equilibrium in the game.
Proposes an $ ext{ extepsilon}$-Nash equilibrium mechanism with $O(N/ ext{ extepsilon})$ complexity.
Demonstrates improved QoE and reduced delay with the proposed mechanism.
Abstract
Fog computing, which provides low-latency computing services at the network edge, is an enabler for the emerging Internet of Things (IoT) systems. In this paper, we study the allocation of fog computing resources to the IoT users in a hierarchical computing paradigm including fog and remote cloud computing services. We formulate a computation offloading game to model the competition between IoT users and allocate the limited processing power of fog nodes efficiently. Each user aims to maximize its own quality of experience (QoE), which reflects its satisfaction of using computing services in terms of the reduction in computation energy and delay. Utilizing a potential game approach, we prove the existence of a pure Nash equilibrium and provide an upper bound for the price of anarchy. Since the time complexity to reach the equilibrium increases exponentially in the number of users, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
