P2P空间矢量数据索引网络组策略的优化研究  

Optimal Study on Group Strategy on Index Network of P2P Spatial Vector Data

作　　者：吴家皋[1] 庄嵩杰[1] 田宇坤[1] 邹志强[1] 胡斌[2] 

机构地区：[1]南京邮电大学计算机学院计算机技术研究所,江苏南京210003 [2]南京师范大学虚拟地理环境教育部重点实验室,江苏南京210046

出　　处：《计算机技术与发展》2013年第4期63-66,70,共5页Computer Technology and Development

基　　金：国家"863"高技术发展计划项目(2009AA12Z219);国家自然科学基金资助项目(40801149);东南大学计算机网络和信息集成教育部重点实验室开放研究基金项目(K93-9-2010-06)

摘　　要：近几年来P2P网络系统由于其出色的数据共享功能和数据传输效率得到飞速的发展。特别在具有海量数据的地理信息系统中,P2P网络以其利用客户资源协同的组策略可以有效提高当前整个索引系统的性能。文中将针对当前组策略节点选择的不足之处,提出一种适用于P2P空间矢量数据索引网络客户组成员节点优化加入算法和相适应的节点动态替换算法。在综合了索引网络节点时延、带宽的基础上,加入可调权值在这两者之间进行平衡,最后得出节点的性能指标并实现算法。仿真结果表明该策略可以优化客户组成员的组成结构,从而提高空间索引网络的性能。In recent years P2P network system developed rapidly because of its excellent data sharing ability and rapid data transfer efficiency. Especially with a massive data in geographic information system, the performance of the entire index system can be optimized efficiently by P2P network group strategy with the use of customer resources. For the disadvantage of group strategy node selection is discussed,a node optimal join algorithm that applied to group member on index network of P2P spatial vector data and a node dynamic replacement algorithm adapted to the strategy are proposed in this paper. In comprehensive consideration of nodes＇ delay and bandwidth on index network, the two metric can be balanced by an adjustable weight, then the performance index of nodes is obtained and the algorithm is realized. Experimental results show that the customer group structure can be optimized by the strategy, and the performance of spatial index network can be improved.

关 键 词：P2P 空间矢量数据 索引网络 组策略 节点选择 

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