Papers › On the Applicability of Network Coordinate Systems for Fog Computing
On the Applicability of Network Coordinate Systems for Fog Computing
Simon Huber, Tobias Pfandzelter, David Bermbach
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Identifying the closest fog node is crucial for mobile clients to benefit from fog computing. Relying on geographical location alone us insufficient for this as it ignores real observed client access latency. In this paper, we analyze the performance of the Meridian and Vivaldi network coordinate systems in identifying nearest fog nodes. To that end, we simulate a dense fog environment with mobile clients. We find that while network coordinate systems really find fog nodes in close network proximity, a purely latency-oriented identification approach ignores the larger problem of balancing load across fog nodes.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections