发帖
雷达卡
摘要翻译：
本文基于物理学的主方程方法，提出了一个分析工具，用于理解结构化覆盖网络在扰动下的性能。对于弦网络，我们提出并导出了在搅动过程中由查找所取的平均跳数的方程。我们详细分析了这个方程，以了解有无搅动时的行为。然后，我们使用这种理解来预测查找将如何扩展到不同的对等方人口以及不同的路由表大小。然后我们考虑覆盖层的维护算法的变化，从周期性稳定到只在检测到变化时纠正手指的反应性算法。我们总结了我们之前的分析，以支持反应策略与周期策略的比较。
---
英文标题：
《Comparing Maintenance Strategies for Overlays》
---
作者：
Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell and Seif Haridi
---
最新提交年份：
2007
---
分类信息：
一级分类：Computer Science 计算机科学
二级分类：Networking and Internet Architecture 网络和因特网体系结构
分类描述：Covers all aspects of computer communication networks, including network architecture and design, network protocols, and internetwork standards (like TCP/IP). Also includes topics, such as web caching, that are directly relevant to Internet architecture and performance. Roughly includes all of ACM Subject Class C.2 except C.2.4, which is more likely to have Distributed, Parallel, and Cluster Computing as the primary subject area.
涵盖计算机通信网络的所有方面，包括网络体系结构和设计、网络协议和网络间标准（如TCP/IP）。还包括与Internet体系结构和性能直接相关的主题，如web缓存。大致包括除C.2.4以外的所有ACM主题类C.2，后者更有可能将分布式、并行和集群计算作为主要主题领域。
--
一级分类：Physics 物理学
二级分类：Statistical Mechanics 统计力学
分类描述：Phase transitions, thermodynamics, field theory, non-equilibrium phenomena, renormalization group and scaling, integrable models, turbulence
相变，热力学，场论，非平衡现象，重整化群和标度，可积模型，湍流
--
一级分类：Computer Science 计算机科学
二级分类：Distributed, Parallel, and Cluster Computing 分布式、并行和集群计算
分类描述：Covers fault-tolerance, distributed algorithms, stabilility, parallel computation, and cluster computing. Roughly includes material in ACM Subject Classes C.1.2, C.1.4, C.2.4, D.1.3, D.4.5, D.4.7, E.1.
包括容错、分布式算法、稳定性、并行计算和集群计算。大致包括ACM学科类C.1.2、C.1.4、C.2.4、D.1.3、D.4.5、D.4.7、E.1中的材料。
--
---
英文摘要：
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.
---
PDF链接：
https://arxiv.org/pdf/710.0386
京公网安备 11010802022788号
