Locating Highly Connected Nodes in P2P Networks with Heterogeneous Structures  

作　　者：张浩翔 张林 山秀明 李安国 

机构地区：[1]Department of Electronic Engineering, Tsinghua University [2]Department of Electrical and Electronic Engineering, The University of Hong Kong

出　　处：《Tsinghua Science and Technology》2009年第4期465-469,共5页清华大学学报（自然科学版（英文版）

基　　金：Supported by the National Natural Science Foundation of China (Nos. 60672107, 60674048, 60603068, and 60772053);the National High-Tech Research and Development (863) Program of China (No.2006AA10Z261);the National Key Basic Research and Development (973) Program of China (No. 2007CB307105)

摘　　要：Peer-to-peer （P2P） networks aggregate enormous storage and processing resources while mini- mizing entry and scaling costs. Gnutella-like P2P networks are complex heterogeneous networks, in which the underlying oveday 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. Simula- tions demonstrate that the algorithm performs well in various scenarios and that heterogeneous P2P net- works are very sensitive to deliberate attacks.Peer-to-peer （P2P） networks aggregate enormous storage and processing resources while mini- mizing entry and scaling costs. Gnutella-like P2P networks are complex heterogeneous networks, in which the underlying oveday 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. Simula- tions demonstrate that the algorithm performs well in various scenarios and that heterogeneous P2P net- works are very sensitive to deliberate attacks.

关 键 词：random walks SCALE-FREE PEER-TO-PEER largest component deliberate attack 

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