Two Layer Stackelberg Game-Based Resource Allocation in Cloud-Network Convergence Service Computing

Ting Lyu, Haitao Xu, Feifei Liu, Meng Li, Lixin Li, Zhu Han

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

With the rapid development of mobile devices, limited edge computing resources, and separate cloud computing systems is difficult to meet the different needs of different applications, so the cloud-network convergence service approach came into being. This paper investigates a tiered resource allocation scheme that can provide high-quality computing services to end-users and balance the benefit requirements of all participants to benefit the stakeholders in the cloud-network convergence service system. Firstly, considering the self-interests of each participant in the cloud-network converged service system, the hierarchical resource allocation problem is formulated as a two-layer game resource allocation problem. Subsequently, the backward induction method is used for game analysis, and Stackelberg equilibrium is proved. The optimal resource price response function for the edge layer and the offloading optimal response function for the end-users are derived by a convex optimization approach, and a gradient-based dynamic pricing algorithm is designed to obtain the optimal pricing in the cloud and the optimal resource requests in the edge layer. Finally, experimental simulation results are given, and the performance of the optimal pricing and resource allocation policy is analyzed.

Original languageEnglish
Pages (from-to)2412-2426
Number of pages15
JournalIEEE Transactions on Cognitive Communications and Networking
Volume10
Issue number6
DOIs
StatePublished - 2024

Keywords

  • Nash equilibrium
  • Resource allocation
  • cloud-network convergence
  • game theory
  • pricing

Fingerprint

Dive into the research topics of 'Two Layer Stackelberg Game-Based Resource Allocation in Cloud-Network Convergence Service Computing'. Together they form a unique fingerprint.

Cite this