发帖
雷达卡
摘要翻译：
本文对结构化对等网络中的动态成员关系进行了分析研究。我们用流体模型方法来描述稳态或瞬态现象，并将其应用于弦系统。对于任意的扰动率和稳定率，以及任意的系统大小，我们精确地解释了网络断开概率的函数形式，以及失败或不正确的后继指针和指针的比例。我们展示了如何使用这些量来预测在搅动情况下查找的性能和一致性。所有理论预测都与模拟结果相吻合。该分析包括结构化覆盖部署环的一般特征以及和弦特定的细节，并为在搅动下至少基于环的结构化覆盖系统的系统比较分析打开了大门。
---
英文标题：
《An Analytical Study of a Structured Overlay in the presence of Dynamic
Membership》
---
作者：
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 study of dynamic membership (aka churn) in structured peer-to-peer networks. We use a fluid model approach to describe steady-state or transient phenomena, and apply it to the Chord system. For any rate of churn and stabilization rates, and any system size, we accurately account for the functional form of the probability of network disconnection as well as the fraction of failed or incorrect successor and finger pointers. We show how we can use these quantities to predict both the performance and consistency of lookups under churn. All theoretical predictions match simulation results. The analysis includes both features that are generic to structured overlays deploying a ring as well as Chord-specific details, and opens the door to a systematic comparative analysis of, at least, ring-based structured overlay systems under churn.
---
PDF链接：
https://arxiv.org/pdf/710.027
京公网安备 11010802022788号
