P2P网络中基于区域划分的超级节点选取机制  

Supernode Selection Mechanism Based on District Partition in Peer-to-Peer Networks

作　　者：郭良敏[1] 杨寿保[1] 郭磊涛[1] 韦冬[1] 

机构地区：[1]中国科学技术大学计算机科学系

出　　处：《小型微型计算机系统》2008年第2期208-212,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60273041;60673172)资助;国家“八六三”计划项目(2002AA104560)资助;CNGI2005(CNGI-04-15-7A)资助.

摘　　要：P2P网络中的相邻节点在物理位置上不一定相邻,这将会增加P2P相邻节点间的延迟.本文通过聚集半分布式P2P网络中物理位置相近的节点,提出基于区域划分的超级节点选取机制.该机制将P2P网络中的节点按照物理位置的远近关系划分成若干区域,保证了区域内节点在物理位置上是相近的.利用MATLAB进行了仿真实验,实验结果表明使用这种机制能降低约35%的半分布式P2P网络的信息检索延迟,有效地提高了检索的效率,并且具有较好的可扩展性.The neighboring nodes in P2P network are not always physical neighbours so that the delay between nodes is affected. In this paper by collecting physical neighboring nodes in distributed P2P overlay network,the supernode selection mechanism based on district partition is put forward. This mechanism districts P2P into several regions according to physical position to ensure nodes are close. Simulation results show it can decrease about 35 percent network search delay lower,it is effective and scalable.

关 键 词：P2P 超级节点 区域划分 检索延迟 

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