arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0710.0386cs.NIcond-mat.stat-mechcs.DC
收藏

覆盖层维护策略的比较

Comparing Maintenance Strategies for Overlays

Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, Seif Haridi

摘要:

在本文中,我们提出了一个分析工具,了解下流失的结构化覆盖网络的性能主方程的物理方法的基础上。我们激励和推导出一个方程的平均跳数的查找过程中流失,和弦网络。我们详细分析了这个方程,以了解有和没有搅动的行为。然后,我们使用这种理解来预测查找将如何扩展不同的对等人口以及不同的路由表的大小。然后,我们考虑在维护算法的覆盖,从周期性的稳定性的反应,只有当检测到变化时,才纠正手指的变化。我们概括了我们以前的分析,以了解如何反应策略与周期性的比较。

英文摘要:

In this paper, we present an analytical tool for understanding the performance of structured overlay networks under churn based on the master-equation approach of physics. We motivate and derive an equation for the average number of hops taken by lookups during churn, for the Chord network. We analyse this equation in detail to understand the behaviour with and without churn. We then use this understanding to predict how lookups will scale for varying peer population as well as varying the sizes of the routing tables. We then consider a change in the maintenance algorithm of the overlay, from periodic stabilisation to a reactive one which corrects fingers only when a change is detected. We generalise our earlier analysis to underdstand how the reactive strategy compares with the periodic one.

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

↑