Distributed Optimization of Collaborative Regions in Large-Scale Inhomogeneous Fog Computing

Fog computing enables resource-limited network devices to help each other with computationally demanding tasks, but has yet to be implemented in large scales due to sophisticated control and network inhomogeneity. This paper presents a new fully distributed online optimization to asymptotically minimize the time-average cost of fog computing, where tasks are selected to be offloaded and processed independently between different links and devices by measuring their cost effectiveness at each time slot. A key contribution is that we optimize the cost-effectiveness measures which achieve the asymptotic optimality over infinite time. Another contribution is that we optimize placeholders at the devices; which create collaborative computing regions of tasks in the vicinity of the point of capture, prevent tasks being offloaded beyond, preserve the asymptotic optimality and reduce delay. This is achieved in a distributed fashion by discovering the optimal substructure of the placeholders. Simulations show that the average size of collaborative regions is only 3.2 out of total 500 servers, and the system income increases by 43% as compared with existing techniques.