Revenue Maximization in Delay-Aware Computation Offloading Among Service Providers With Fog Federation

In this letter, we study the computational offloading scheme for the delay-aware tasks of the end-users in the fog computing network. We consider a fog federation of different service providers where an individual fog node allocates its computing resources to the end-user in its proximity, while a fog manager coordinates the load balancing among the fog nodes over the entire network. At first, an individual fog node aims to maximize its revenue by selling the computational resources to the end-user in a distributed manner without any global knowledge of the network. To further maximize the overall revenue considering all fog nodes in the fog federation, the fog manager utilizes the remaining computing resources of the underloaded fog nodes. The extensive simulation results show the revenue improvement leveraging fog federation over entire network while maintaining the same and even better delay-performance for the end-users.

[1]  Lei Guo,et al.  Transmission and Latency-Aware Load Balancing for Fog Radio Access Networks , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[2]  Arun Kumar Sangaiah,et al.  Fog computing enabled cost-effective distributed summarization of surveillance videos for smart cities , 2019, J. Parallel Distributed Comput..

[3]  Mengyu Liu,et al.  Price-Based Distributed Offloading for Mobile-Edge Computing With Computation Capacity Constraints , 2017, IEEE Wireless Communications Letters.

[4]  Zhi Zhou,et al.  Incentive-Aware Micro Computing Cluster Formation for Cooperative Fog Computing , 2020, IEEE Transactions on Wireless Communications.

[5]  Yan Zhang,et al.  Optimal delay constrained offloading for vehicular edge computing networks , 2017, 2017 IEEE International Conference on Communications (ICC).

[6]  Nirwan Ansari,et al.  Toward Hierarchical Mobile Edge Computing: An Auction-Based Profit Maximization Approach , 2016, IEEE Internet of Things Journal.

[7]  S. Martello,et al.  Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .

[8]  Zhu Han,et al.  Interference-Constrained Pricing for D2D Networks , 2017, IEEE Transactions on Wireless Communications.

[9]  Vijay K. Bhargava,et al.  Price-Based Resource Allocation for Edge Computing: A Market Equilibrium Approach , 2018, IEEE Transactions on Cloud Computing.