Hybrid模型中的路由方案和距离预言
Routing Schemes and Distance Oracles in the Hybrid Model
摘要:
引入$\mathsf{HYBRID}$模型作为使用各种通信模式的分布式网络的理论研究的手段。从概念上讲,它是一种同步消息传递模型,具有本地通信模式和全局通信模式,在每一轮中,每个节点可以向本地网络(图)中的所有邻居发送大消息,在全局通信模式中,每个节点每轮分配有限的(多对数)带宽,它可以用来与网络中的任何节点通信。以前的工作往往集中在本地网络中的最短路径问题,因为它们的全球性使这些有趣的案例研究如何结合在$\mathsf{HYBRID}$模型中的通信模式可以克服任何一种模式的个别下限。在这项工作中,我们考虑了一个类似的问题,即计算距离预言机和路由方案。在前者中,所有节点都必须计算本地表,这允许它们在提供目标的标签时查找到本地网络中任何目标节点的距离(估计值)。在后者中,节点给出到目标的(近似)最短路径上的下一个节点就足够了。我们的目标是尽可能快地计算这些局部表,标签尽可能小。我们表明,这可以完全在$\widetilde O(n^{1/3})$通信轮和标签的大小$Θ(n^{2/3})$位。对于常数拉伸近似,我们在同一时间内实现大小为$O(\log n)$的标签。此外,作为我们的主要技术贡献,我们提供了各种问题参数的计算下限。例如,我们表明,计算解决方案的拉伸低于一定的常数需要$\widetilde Ω(n^{1/3})$轮,即使标签的大小$O(n^{2/3})$。
英文摘要:
The $\mathsf{HYBRID}$ model was introduced as a means for theoretical study of distributed networks that use various communication modes. Conceptually, it is a synchronous message passing model with a local communication mode, where in each round each node can send large messages to all its neighbors in a local network (a graph), and a global communication mode, where each node is allotted limited (polylogarithmic) bandwidth per round which it can use to communicate with any node in the network. Prior work has often focused on shortest paths problems in the local network, as their global nature makes these an interesting case study how combining communication modes in the $\mathsf{HYBRID}$ model can overcome the individual lower bounds of either mode. In this work we consider a similar problem, namely computation of distance oracles and routing schemes. In the former, all nodes have to compute local tables, which allows them to look up the distance (estimates) to any target node in the local network when provided with the label of the target. In the latter, it suffices that nodes give the next node on an (approximately) shortest path to the target. Our goal is to compute these local tables as fast as possible with labels as small as possible. We show that this can be done exactly in $\widetilde O(n^{1/3})$ communication rounds and labels of size $Θ(n^{2/3})$ bits. For constant stretch approximations we achieve labels of size $O(\log n)$ in the same time. Further, as our main technical contribution, we provide computational lower bounds for a variety of problem parameters. For instance, we show that computing solutions with stretch below a certain constant takes $\widetilde Ω(n^{1/3})$ rounds even for labels of size $O(n^{2/3})$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。