We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$O(logn)-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications.

中文翻译：

---

小消息的分布式距离计算和路由

我们从网络算法的角度考虑最短路径计算和相关任务，其中 n 节点输入图也是计算系统：节点代表处理器，边代表通信链路，它们可以在每个时间步中携带 $$\mathcal { O}(\log n)$$O(logn) 位消息。我们确定了几个基本的分布式距离计算任务，这些任务在设计更复杂的算法时非常有用，并提供了有效的解决方案。我们通过几个应用程序展示了这些工具的实用性。