We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous distributed protocol while tolerating an optimal corruption of a $$\varTheta (1/n)$$Θ(1/n) fraction of all messages and incurring a moderate blowup of $$O(n\log ^2 n)$$O(nlog2n) in the communication complexity. Our result is the first fully distributed interactive coding scheme in which the topology of the communication network is not known in advance. Prior work required either a coordinating node to be connected to all other nodes in the network or assumed a synchronous network in which all nodes already know the complete topology of the network.

中文翻译：

---

使异步分布式计算对噪声具有鲁棒性

我们考虑了使分布式计算对噪声具有鲁棒性的问题，特别是对消息的最坏情况（对抗性）损坏。我们给出了一个通用的分布式交互式编码方案，它模拟任何异步分布式协议，同时容忍所有消息的 $$\varTheta (1/n)$$Θ(1/n) 部分的最佳损坏并导致 $$ 的适度膨胀O(n\log ^2 n)$$O(nlog2n) 的通信复杂度。我们的结果是第一个完全分布式交互式编码方案，其中通信网络的拓扑结构事先未知。先前的工作需要一个协调节点连接到网络中的所有其他节点，或者假设一个同步网络，其中所有节点都已经知道网络的完整拓扑。