一种P2P环境下点割集的被动分布式发现算法  

A Distributed Passive Vertex Cut Set Discovery Algorithm in the P2P Environment

作　　者：任浩[1] 王志英[1] 

机构地区：[1]国防科技大学计算机学院,湖南长沙410073

出　　处：《计算机工程与科学》2007年第12期89-92,共4页Computer Engineering & Science

摘　　要：P2P系统的可靠性主要取决于覆盖网节点间的连通性,而割点和小规模点割集对网络连通性的危害很大,它们的失效或离开能使覆盖网变得四分五裂。本文提出一种P2P环境下点割集的被动分布式发现算法,在无法获得网络全局信息的情况下,节点仅依靠对收到消息的统计和分析就能够自主判断自己是否为割点或属于2点割,并采取相应措施消除其为系统带来的不稳定因素。该算法准确性高、开销低,割集消除对提高覆盖网可靠性的效果显著。The connectivity of overlay networks is the most important feature which affects the P2P system＇s reliability.Whereas the cut vertex or the small vertex cutset extraordinarily threaten the connectivity of overlay networks, for the re-moval of them will separate the network into many components. In this paper, we propose a distributed passive algorithmwhich efficiently detects the vertex cutset which only contains one or two vertices, and neutralizes them into normal overlaynodes, just by analyzing the statistical information of the received messages. Simulation shows our algorithm can get high ac- curacy with little overhead , and greatly improve the reliability of overlay networks.

关 键 词：割点 点割集 P2P覆盖网 可靠性 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]