Distributed Online Learning of Fog Computing under Nonuniform Device Cardinality

Publication Type:
Journal Article
IEEE Internet of Things Journal, 2019, 6 (1), pp. 1147 - 1159
Issue Date:
Full metadata record
© 2014 IEEE. Processing data around the point of capture, fog computing can support computationally demanding Internet-of-Things (IoT) services. Distributed online optimization is important given the size of IoT, but challenging due to time variations of random traffic and nonuniform connectivity (or cardinality) of edge servers and IoT devices. This paper presents a distributed online learning approach to asymptotically minimizing the time-average cost of fog computing in the absence of the a-priori knowledge on traffic randomness, for light-weight, and delay-tolerant application scenarios. Stochastic gradient descent is exploited to decouple the optimizations between time slots. A graph matching problem is then formulated for every time slot by decoupling and unifying the nonuniform cardinalities, and solved in a distributed manner by developing a new linear (1/2)-approximation method. We prove that the optimality loss resulting from the distributed approximate graph matching method can be compensated and diminish by increasing the learning time. Corroborated by simulations, the proposed distributed online learning is asymptotically optimal and superior to the state of the art in terms of throughput and energy efficiency.
Please use this identifier to cite or link to this item: