Locating Highly Connected Nodes in P2P Networks with Heterogeneous Structures

• 作 者: 张浩翔 张林 山秀明 李安国
• 机 构: Department of Electronic Engineering, Tsinghua University,Department of Electrical and Electronic En
• 出 处: Tsinghua Science and Technology
• 发表日期: 2009年04期
• 关键词: Highly overlay robustness minimizing connectivity heterogeneous topology elimina

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.

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, where 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 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 Simulations demonstrate that the algorithm performs well in various scenarios and that heterogeneous P2P networks are very sensitive to deliberate attacks.