摘要
Kad网络是一种主流的文件共享对等网络(即P2P network),不法信息在其上的传播导致对其进行网络监管的需求也与日俱增.Kad网络中广泛使用的节点标识Kad ID存在"Kad ID别名"问题,即单个节点具有多个Kad ID.为解决这一问题,设计实现Kad网络节点信息爬虫—Kcrawler,并提出了最佳节点标识概念,以获得实际Kad网络中节点的多个候选标识之间的对应关系信息.实验结果表明{userID}的稳定因子最大,是最佳节点标识.
Kad network has become a main kind of file-sharing Peer-to-Peer（P2P） network,leading to the increasing demand of censoring it.In order to accurately determine the censoring object,the problem of optimal peer identification will be put forward.This paper tries to solve this problem.Kad network peer information crawler is designed and implemented to crawl peer information of multiple candidate identifications＇ relationship in real Kad network.Experimental results show that {userID} is the optimal peer identification.
出处
《微电子学与计算机》
CSCD
北大核心
2011年第8期126-128,共3页
Microelectronics & Computer
关键词
P2P网络
KAD网络
爬虫
节点标识
peer-to-peer network
Kad network
crawler
peer identification
