分布式协议的对抗性噪声阈值
The Adversarial Noise Threshold for Distributed Protocols
摘要:
我们考虑的问题,实现分布式协议,尽管敌对的信道错误,在任意拓扑结构的同步消息网络。在我们的第一个结果中,我们表明,任何$n$ -党$T$ -轮协议上的无向通信网络$G$可以编译成一个强大的模拟协议上的稀疏($\mathcal{O}(n)$边缘)子网络,使模拟容忍对抗错误率$Ω\left(\frac{1}{n}\right)$ ;模拟有一轮复杂性$\mathcal{O}\left(\frac{m \log n}{n} T\right)$,其中$m$是边缘的数量在$G$。(So该模拟在高达$\log$因子时是功保持的。)对手的错误率是在一个恒定的最佳因素。给定错误率,轮复杂度爆破在最优的$\mathcal{O}(k \log n)$的因子内,其中$k$是$G$的边连通性。我们还确定了有向通信网络的最大容许错误率是$Θ(1/s)$,其中$s$是最小等价有向图中的边数。接下来,我们研究对抗性的每边错误率,其中对手在网络的每个边缘上都有一个错误预算。我们确定的精确限制,可容忍的每边错误率在任意有向图。然而,接近这个极限的构造具有指数轮复杂度,因此我们给出另一个编译器,它将$T$ -轮协议转换为$\mathcal{O}(mT)$ -轮模拟,并证明对于多项式查询黑盒编译器,最后一个编译器所容忍的每边错误率在最优的恒定因子内。
英文摘要:
We consider the problem of implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology. In our first result we show that any $n$-party $T$-round protocol on an undirected communication network $G$ can be compiled into a robust simulation protocol on a sparse ($\mathcal{O}(n)$ edges) subnetwork so that the simulation tolerates an adversarial error rate of $Ω\left(\frac{1}{n}\right)$; the simulation has a round complexity of $\mathcal{O}\left(\frac{m \log n}{n} T\right)$, where $m$ is the number of edges in $G$. (So the simulation is work-preserving up to a $\log$ factor.) The adversary's error rate is within a constant factor of optimal. Given the error rate, the round complexity blowup is within a factor of $\mathcal{O}(k \log n)$ of optimal, where $k$ is the edge connectivity of $G$. We also determine that the maximum tolerable error rate on directed communication networks is $Θ(1/s)$ where $s$ is the number of edges in a minimum equivalent digraph. Next we investigate adversarial per-edge error rates, where the adversary is given an error budget on each edge of the network. We determine the exact limit for tolerable per-edge error rates on an arbitrary directed graph. However, the construction that approaches this limit has exponential round complexity, so we give another compiler, which transforms $T$-round protocols into $\mathcal{O}(mT)$-round simulations, and prove that for polynomial-query black box compilers, the per-edge error rate tolerated by this last compiler is within a constant factor of optimal.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。