ERSN:一种高效鲁棒的超结点对等网络  

ERSN: An Efficient and Robust Super-Peer P2P Network

作　　者：郑倩冰[1] 彭伟[1] 卢锡城[1] 

机构地区：[1]国防科学技术大学计算机学院,长沙410073

出　　处：《计算机研究与发展》2006年第4期607-612,共6页Journal of Computer Research and Development

基　　金：国家自然科学基金项目(90412011;90204005;90104001)

摘　　要：超结点对等网络利用对等结点的异构性解决了低带宽结点带宽瓶颈问题,但目前超结点对等网络的构建协议效率低且网络拓扑鲁棒性弱.提出一种高效鲁棒的超结点对等网络ERSN,采用基于漫步算法的结点采样协议,估计网络需求,构建高效的超结点对等网络,并建立叶结点间的应急连接,增强超结点对等网络的鲁棒性.模拟实验证明,与Gnutella0.6超结点对等网络比较,ERSN网络中负责处理定位请求的结点数目最多减少了76%,并在多个超结点和叶结点同时离开网络的情况下,将文件定位命中率最大提高了36.4%.Super-peer P2P network takes advantage of the heterogeneity of capabilities across peers to solve the problem of bandwidth barrier. However, its constructing protocols are inefficient and its topology is fragile. An efficient and robust super-peer P2P network ERSN is presented. The ERSN utilizes peer sampling protocol based on random walks to estimate the network requirements for constructing an efficient super-peer network and establishes emergence links between leaf peers to get a robust network. Experimental results show that compared with Gnutella 0.6 network, the number of peers which process the locating request reduces by 76 % at most and the hit rate for locating file increases by 36.4 % at most with many super-peers and leaf peers leaving network simultaneously.

关 键 词：超结点 叠加网络拓扑 漫步算法 无结构对等网络 

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