• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2007, Vol. 29 ›› Issue (12): 89-92.

• 论文 • 上一篇    下一篇

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

任浩 王志英   

  • 出版日期:2007-12-01 发布日期:2010-05-30

  • Online:2007-12-01 Published:2010-05-30

摘要:

P2P系统的可靠性主要取决于覆盖网节点问的连通性,而割点和小规模点割集对网络连通性的危害很大,它们的失效或离开能使覆盖网变得四分五裂。本文提出一种P2P环境下 点割集的被动分布式发现算法,在无法获得网络全局信息的情况下,节点仅依靠对收到消息的统计和分析就能够自主判断自己是否为割点或属于2点割,并采取相应措施消除其为系统带来的不稳定因素。该算法准确性高、开销低,割集消除对提高覆盖网可靠性的效果显著。

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

Abstract:

The connectivity of overlay networks is the most important feature which affects the P2P system's reliability.Whereas the cut vertex or the small ver  tex cutset extraordinarily threaten the connectivity of overlay networks, for the re-moval of them will separate the network into many components. In th is 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.

Key words: cut vertex, vertex eutset, P2P overlay network;reliability)