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

群集叠加施工策略

Swarming Overlay Construction Strategies

Anwar Al Hamra, Nikitas Liogkas, Arnaud Legout, Chadi Barakat

摘要:

蜂拥而至的点对点系统在互联网内容分发中发挥着越来越重要的作用。因此,必须更好地了解这些系统在实践中的表现。最近的研究工作着眼于各种协议参数,并测量了它们如何影响系统性能和鲁棒性。然而,对等体建立连接的策略的重要性在很大程度上被忽视了。这项工作利用广泛的模拟,以检查默认的覆盖建设策略在BitTorrent系统。基于结果,我们确定了一个关键参数,在每个对等体的传出连接的最大允许数量,并评估其对所生成的覆盖的鲁棒性的影响。我们发现,有没有一个单一的最佳值,这个参数使用默认策略。然后,我们提出了一种替代策略,允许某些新的对等连接请求,以取代现有的连接。新策略的进一步实验表明,它优于默认的所有考虑的指标,通过创建一个覆盖更强大的流失。此外,我们提出的策略表现出最佳的行为,一个明确定义的值的最大数量的传出连接,从而消除了需要设置这个参数在一个特设的方式。

英文摘要:

Swarming peer-to-peer systems play an increasingly instrumental role in Internet content distribution. It is therefore important to better understand how these systems behave in practice. Recent research efforts have looked at various protocol parameters and have measured how they affect system performance and robustness. However, the importance of the strategy based on which peers establish connections has been largely overlooked. This work utilizes extensive simulations to examine the default overlay construction strategy in BitTorrent systems. Based on the results, we identify a critical parameter, the maximum allowable number of outgoing connections at each peer, and evaluate its impact on the robustness of the generated overlay. We find that there is no single optimal value for this parameter using the default strategy. We then propose an alternative strategy that allows certain new peer connection requests to replace existing connections. Further experiments with the new strategy demonstrate that it outperforms the default one for all considered metrics by creating an overlay more robust to churn. Additionally, our proposed strategy exhibits optimal behavior for a well-defined value of the maximum number of outgoing connections, thereby removing the need to set this parameter in an ad-hoc manner.

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

↑