分点：无结构对等网络的拓扑关键点  

Partition Nodes:Topologically-Critical Nodes of Unstructured Peer-to-Peer Networks

作　　者：李振华[1] 陈贵海[1] 邱彤庆[1] 

机构地区：[1]南京大学计算机软件新技术国家重点实验室,江苏南京210093

出　　处：《软件学报》2008年第9期2376-2388,共13页Journal of Software

基　　金：国家自然科学基金;国家重点基础研究发展计划(973);江苏省高技术研究项目~~

摘　　要：虽然对等网络中的结点在功能上互相平等,但其中某些结点对于覆盖网拓扑却有重要意义.提出了分点概念来描述对等网络的拓扑关键点,这些结点的失效很可能导致覆盖网的分割.设计了一套简单、有效、分布式的分点检测和避免方法.模拟实验的结果表明,该方法可以优化覆盖网拓扑结构,并显著地提高无结构对等网络在动态环境下的容错性.Although nodes in peer-to-peer networks are viewed as equal entities in function, some of them have much more importance than others in the aspect of overlay topology. This paper introduces the concept of ＂partition node＂ to describe the topologically-critical nodes, whose failure may potentially lead to overlay partitioning. Then a simple, effective and distributed method to detect and avoid partition nodes, is proposed. The results of simulation show that the proposed method can optimize the overlay topology and remarkably improve the fault tolerance of unstructured P2P systems under a dynamic environment.

关 键 词：无结构对等网络 分点 覆盖网分割 容错性 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]