近最优弹性标记方案
Near-Optimal Resilient Labeling Schemes
AI总结:
本文研究标记擦除下的一般弹性标记方案,提出可容忍 F 次擦除的标记变换与分布式重建方法,在 Congest 模型中取得近最优运行时间。
摘要:
标记方案是多种计算环境中普遍采用的一种范式。在此类方案中,预言机接收一个输入图,并为其每个节点生成一个标记,使这些标记可用于各种任务。分布式环境中的基础例子包括距离标记方案、证明标记方案、建议方案等。本文研究的问题是:在标记方案中,如果某些标记被擦除(例如由于与预言机通信丢失或硬件错误),会发生什么。我们采用 Fischer、Oshman、Shamir [OPODIS 2021] 提出的弹性证明标记方案概念,并考虑一般标记方案中的弹性。弹性标记方案由两部分组成:其一是由预言机执行的、将任意给定标记转换为新标记的变换;其二是一种分布式算法,在该算法中,尽管存在某些标记擦除,节点仍能根据新标记恢复其原始标记。我们的贡献是一种可处理 F 次此类擦除的弹性标记方案。给定每个节点 ℓ 比特的标记,它生成的新标记分别具有 O(1) 的乘法开销和 O(log(F)) 的加法开销。在 Congest 模型中,分布式重建算法的运行时间为 O(F+(ℓ·F)/log n)。对于非恒定的 F 值,这改进了由 Bick、Kol 和 Oshman [SODA 2022] 的工作可推导出的结果。不难证明,我们分布式算法的运行时间是最优的,这使得我们的构造除标记大小中的加法开销外,达到近最优。
英文摘要:
Labeling schemes are a prevalent paradigm in various computing settings. In such schemes, an oracle is given an input graph and produces a label for each of its nodes, enabling the labels to be used for various tasks. Fundamental examples in distributed settings include distance labeling schemes, proof labeling schemes, advice schemes, and more. This paper addresses the question of what happens in a labeling scheme if some labels are erased, e.g., due to communication loss with the oracle or hardware errors. We adapt the notion of resilient proof-labeling schemes of Fischer, Oshman, Shamir [OPODIS 2021] and consider resiliency in general labeling schemes. A resilient labeling scheme consists of two parts -- a transformation of any given labeling to a new one, executed by the oracle, and a distributed algorithm in which the nodes can restore their original labels given the new ones, despite some label erasures. Our contribution is a resilient labeling scheme that can handle $F$ such erasures. Given a labeling of $\ell$ bits per node, it produces new labels with multiplicative and additive overheads of $O(1)$ and $O(\log(F))$, respectively. The running time of the distributed reconstruction algorithm is $O(F+(\ell\cdot F)/\log{n})$ in the \textsf{Congest} model. This improves upon what can be deduced from the work of Bick, Kol, and Oshman [SODA 2022], for non-constant values of $F$. It is not hard to show that the running time of our distributed algorithm is optimal, making our construction near-optimal, up to the additive overhead in the label size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。