A Game-based Network Slicing and Resource Scheduling for Compute First Networking
Zitong Wang, Deze Zeng, Lin Gu, Song Guo · 2020
Compute First Networking (CFN) recently is proposed as an in-network computing paradigm for well balancing between the networking and computation resource scheduling. Thanks to the proliferation of network functions virtualization, the virtualized network functions can coexist with the computing services on a shared platform like edge computing environment. Thus, one critical issue incurred by CFN is how to manage and schedule the resources among various services from different over-the-top service provider (OSP) with different resource requirements, i.e., network slicing. In this paper, we first formulate the network slicing problem as a Stackelberg game problem and prove that there exists a Nash equilibrium beneficial to both the Network Slice Broker (NSB) and OSP. Furthermore, we propose a cooperative game model on the networking and computation resource allocation within each slice and invent a Nash bargaining solution to resolve the intra-slice resource competition for slice performance promotion. Simulation results are provided to validate the effectiveness and high efficiency of the our proposed game based network slicing and resource scheduling algorithm.