A Game-theoretic Approach Towards Collaborative Coded Computation Offloading

Coded distributed computing (CDC) has emerged as a promising approach because it enables computation tasks to be carried out in a distributed manner while mitigating straggler effects, which often account for the long overall completion times. Specifically, by using polynomial codes, computed results from only a subset of edge servers can be used to reconstruct the final result. However, incentive issues have not been studied systematically for the edge servers to complete the CDC tasks. In this paper, we propose a tractable two-level game-theoretic approach to incentivize the edge servers to complete the CDC tasks. Specifically, in the lower level, a hedonic coalition formation game is formulated where the edge servers share their resources within their coalitions. By forming coalitions, the edge servers have more Central Processing Unit (CPU) power to complete the computation tasks. In the upper level, given the CPU power of the coalitions of edge servers, an all-pay auction is designed to incentivize the edge servers to participate in the CDC tasks. In the all-pay auction, the bids of the edge servers are represented by the allocation of their CPU power to the CDC tasks. The all-pay auction is designed to maximize the utility of the cloud server by determining the allocation of rewards to the winners. Simulation results show that the edge servers are incentivized to allocate more CPU power when multiple rewards are offered, i.e., there are multiple winners, instead of rewarding only the edge server with the largest CPU power allocation. Besides, the utility of the cloud server is maximized when it offers multiple homogeneous rewards, instead of heterogeneous rewards.

[1]  Kannan Ramchandran,et al.  High-dimensional coded matrix multiplication , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[2]  Pulkit Grover,et al.  Coded convolution for parallel and distributed computing within a deadline , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[3]  Alexandros G. Dimakis,et al.  Gradient Coding From Cyclic MDS Codes and Expander Graphs , 2017, IEEE Transactions on Information Theory.

[4]  Konstantinos Katzis,et al.  A Mobile Crowd Sensing Application for Hypertensive Patients , 2019, Sensors.

[5]  Kiho Yoon,et al.  The optimal allocation of prizes in contests: An auction approach , 2012 .

[6]  Jamal Bentahar,et al.  Towards Trustworthy Multi-Cloud Services Communities: A Trust-Based Hedonic Coalitional Game , 2018, IEEE Transactions on Services Computing.

[7]  Husnu S. Narman,et al.  A Survey of Mobile Crowdsensing Techniques , 2018, ACM Trans. Cyber Phys. Syst..

[8]  Weisong Shi,et al.  The Promise of Edge Computing , 2016, Computer.

[9]  Zhu Han,et al.  Coalitional game theory for communication networks , 2009, IEEE Signal Processing Magazine.

[10]  Arun Sundararajan,et al.  Optimal Design of Crowdsourcing Contests , 2009, ICIS.

[11]  Yaoqing Yang,et al.  Cross-Iteration Coded Computing , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[12]  Matthew O. Jackson,et al.  The Stability of Hedonic Coalition Structures , 2002, Games Econ. Behav..

[13]  Boon Thau Loo,et al.  Performance Modeling of MapReduce Jobs in Heterogeneous Cloud Environments , 2013, 2013 IEEE Sixth International Conference on Cloud Computing.

[14]  林丽慧,et al.  Optimal Fee Structures of Crowdsourcing Platforms , 2016 .

[15]  Nuwan S. Ferdinand,et al.  Exploitation of Stragglers in Coded Computation , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[16]  Frédéric Didier.  Efficient erasure decoding of Reed-Solomon codes , 2009, ArXiv.

[17]  A. Salman Avestimehr,et al.  A Fundamental Tradeoff Between Computation and Communication in Distributed Computing , 2016, IEEE Transactions on Information Theory.

[18]  Deniz Gündüz,et al.  Speeding Up Distributed Gradient Descent by Utilizing Non-persistent Stragglers , 2018, 2019 IEEE International Symposium on Information Theory (ISIT).

[19]  Luiz André Barroso,et al.  The tail at scale , 2013, CACM.

[20]  Ness B. Shroff,et al.  Fundamental Limits of Coded Linear Transform , 2018, ArXiv.

[21]  Emina Soljanin,et al.  Straggler Mitigation by Delayed Relaunch of Tasks , 2018, PERV.

[22]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

[23]  Suhas N. Diggavi,et al.  Hierarchical coded caching , 2014, 2014 IEEE International Symposium on Information Theory.

[24]  Emina Soljanin,et al.  Effective Straggler Mitigation: Which Clones Should Attack and When? , 2017, PERV.

[25]  Jaehoon Jeong,et al.  CRATER: A Crowd Sensing Application to Estimate Road Conditions , 2016, IEEE Access.

[26]  Chandreyee Chowdhury,et al.  Towards Smart City: Sensing Air Quality in City based on Opportunistic Crowd-sensing , 2017, ICDCN.

[27]  Mohammad Ali Maddah-Ali,et al.  Coded fourier transform , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[28]  Jun Xiao,et al.  Asymmetric All-Pay Contests with Heterogeneous Prizes , 2015, J. Econ. Theory.

[29]  Hui Wang,et al.  SAZD: A Low Computational Load Coded Distributed Computing Framework for IoT Systems , 2020, IEEE Internet of Things Journal.

[30]  Kun Zhu,et al.  Dynamic Selection of Mining Pool with Different Reward Sharing Strategy in Blockchain Networks , 2020, ICC 2020 - 2020 IEEE International Conference on Communications (ICC).

[31]  Hwee Pink Tan,et al.  Optimal Prizes for All-Pay Contests in Heterogeneous Crowdsourcing , 2014, 2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems.

[32]  Yongqiang Zhang,et al.  Energy-Efficient Dynamic Task Offloading for Energy Harvesting Mobile Cloud Computing , 2018, 2018 IEEE International Conference on Networking, Architecture and Storage (NAS).

[33]  Tian Zhang,et al.  Data Offloading in Mobile Edge Computing: A Coalition and Pricing Based Approach , 2018, IEEE Access.

[34]  Giuseppe Caire,et al.  Topological Coded Distributed Computing , 2020, GLOBECOM 2020 - 2020 IEEE Global Communications Conference.

[35]  Chunyan Miao,et al.  A Survey of Coded Distributed Computing , 2020, ArXiv.

[36]  Mohsen Guizani,et al.  Collaborative Coded Computation Offloading: An All-pay Auction Approach , 2020, ArXiv.

[37]  Mohammad Ali Maddah-Ali,et al.  Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication , 2017, NIPS.

[39]  Moulay Youssef Hadi,et al.  Computing Tasks Distribution in Fog Computing: Coalition Game Model , 2018, 2018 6th International Conference on Wireless Networks and Mobile Communications (WINCOM).

[40]  M. Shamim Hossain,et al.  Energy Efficient Task Caching and Offloading for Mobile Edge Computing , 2018, IEEE Access.

[41]  Albert G. Greenberg,et al.  Reining in the Outliers in Map-Reduce Clusters using Mantri , 2010, OSDI.