Incentive Mechanism for Cloud Service Offloading in Edge–Cloud Computing Environment

Edge computing refers to provision storage and computation resources at the network edge, closer to end users than the remote cloud. In such edge–cloud computing environments, many cloud providers intend to offload cloud services to the edge nodes to offer high-quality services for data-intensive an...

Full description

Saved in:
Bibliographic Details
Main Authors: Chendie Yao, Junjie Xie, Zhong Liu
Format: Article
Language:English
Published: MDPI AG 2025-05-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/13/10/1685
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Edge computing refers to provision storage and computation resources at the network edge, closer to end users than the remote cloud. In such edge–cloud computing environments, many cloud providers intend to offload cloud services to the edge nodes to offer high-quality services for data-intensive and latency-sensitive applications. The major obstacle is that edge nodes are rarely willing to offer resources voluntarily without any rewards. To this end, this paper proposes an efficient incentive mechanism for edge–cloud computing environments using Stackelberg game theory to motivate more edge nodes to host offloaded cloud services. We analyze the properties of the game model and present a solution to compute the unique Stackelberg Equilibrium (SE) of the nonlinear model. On this basis, we propose an efficient polynomial-time algorithm to find the SE. Moreover, we discuss the adaptation of our incentive mechanism to dynamic node joining or departing. Performance evaluations compare our incentive mechanism with three benchmarks and a state-of-the-art mechanism. The results indicate that our incentive mechanism can effectively motivate both the edge nodes and the remote cloud to participate in the edge–cloud environment, achieving maximum resource utilization with minimal rewards while remaining robust in dynamic situations.
ISSN:2227-7390