arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1006.4900cs.DC
收藏

一致小世界环的最优度分布

Optimal Degree Distributions for Uniform Small World Rings

R. Seth Terashima, James D. Fix

摘要:

受Kleinberg(2000)和后续工作的启发,我们考虑了在有向环上增加长距离接触的$n$节点的贪婪路由性能。在该模型中,每个节点$u$被给予额外的$D_u$边,从指定的概率分布中选择的度。来自$u$的每个这样的边被链接到环中前面距离$r$处的随机节点,其概率与$1/r$成比例,$1/r$是接触的“调和”距离分布。Aspnes等人(2002)已经示出了在每个节点被精确地分配$\ell$联系的情况下贪婪路由的期望长度的$O(\log^2 n / \ell)$界限,并且作为Dietzfelbinger和Woelfel(2009)的最近工作的结果,已知该界限是紧的。本文推广了Aspnes的上界,证明了任何具有平均$\ell$和最大值$O(\log n)$的度分布都有期望长度为$O(\log^2n / \ell)$的贪婪路,这意味着这个族中的任何调和环都是渐近最优的.此外,对于更一般的环族,我们证明了固定的度分布是最优的。更准确地说,如果每个随机接触被选择在距离$r$的概率随着$r$而减小,那么在具有平均$\ell$的度分布中,当每个节点被分配$\floor{\ell}$或$\ceiling{\ell}$接触时,贪婪路由时间最小。

英文摘要:

Motivated by Kleinberg's (2000) and subsequent work, we consider the performance of greedy routing on a directed ring of $n$ nodes augmented with long-range contacts. In this model, each node $u$ is given an additional $D_u$ edges, a degree chosen from a specified probability distribution. Each such edge from $u$ is linked to a random node at distance $r$ ahead in the ring with probability proportional to $1/r$, a "harmonic" distance distribution of contacts. Aspnes et al. (2002) have shown an $O(\log^2 n / \ell)$ bound on the expected length of greedy routes in the case when each node is assigned exactly $\ell$ contacts and, as a consequence of recent work by Dietzfelbinger and Woelfel (2009), this bound is known to be tight. In this paper, we generalize Aspnes' upper bound to show that any degree distribution with mean $\ell$ and maximum value $O(\log n)$ has greedy routes of expected length $O(\log^2n / \ell)$, implying that any harmonic ring in this family is asymptotically optimal. Furthermore, for a more general family of rings, we show that a fixed degree distribution is optimal. More precisely, if each random contact is chosen at distance $r$ with a probability that decreases with $r$, then among degree distributions with mean $\ell$, greedy routing time is smallest when every node is assigned $\floor{\ell}$ or $\ceiling{\ell}$ contacts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑