Locating Highly Connected Nodes in P2P Networks with Heterogeneous Structures

详细信息    查看全文

• 作者：Haoxiang Zhang ; Lin Zhang ; Xiuming Shan ; Victor O.K. Li
• 关键词：random walks ; scale-free ; peer-to-peer ; largest component ; deliberate attack
• 刊名：Tsinghua Science Technology
• 出版年：2009
• 出版时间：August 2009
• 年：2009
• 卷：14
• 期：4
• 页码：465-469
• 全文大小：272 K

文摘

Peer-to-peer (P2P) networks aggregate enormous storage and processing resources while minimizing entry and scaling costs. Gnutella-like P2P networks are complex heterogeneous networks, in which the underlying overlay topology has a power-law node degree distribution. While scale-free networks have great robustness against random failures, they are vulnerable to deliberate attacks where highly connected nodes are eliminated. Since high degree nodes play an important role in maintaining the connectivity, this paper presents an algorithm based on random walks to locate high degree nodes in P2P networks. Simulations demonstrate that the algorithm performs well in various scenarios and that heterogeneous P2P networks are very sensitive to deliberate attacks.