mlsanityData to 14 Oct 2026

Coding for Distributed Fog Computing

arXiv 1702.06082 ↗First posted 20 Feb 2017cs.IT cs.DC math.ITcited by 2

Not on the map. Why?

Abstract (arXiv)

Redundancy is abundant in Fog networks (i.e., many computing and storage points) and grows linearly with network size. We demonstrate the transformational role of coding in Fog computing for leveraging such redundancy to substantially reduce the bandwidth consumption and latency of computing. In particular, we discuss two recently proposed coding concepts, namely Minimum Bandwidth Codes and Minimum Latency Codes, and illustrate their impacts in Fog computing. We also review a unified coding framework that includes the above two coding techniques as special cases, and enables a tradeoff between computation latency and communication load to optimize system performance. At the end, we will discuss several open problems and future research directions.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Feb 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 1.

2 papers.