基于平衡兴趣树的P2P空间数据服务调度  

Spatial data service scheduling algorithm of P2P networks based on balance interest tree

作　　者：侯哲威[1,2] 王青山[1] 丁琳[3] 任留成[2] 

机构地区：[1]解放军信息工程大学测绘学院,郑州450052 [2]空军指挥学院,北京100097 [3]中国科学院遥感应用研究所,北京100101

出　　处：《计算机应用研究》2009年第9期3414-3417,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(40771140);国家"973"计划资助项目(2007CB714406)

摘　　要：构建空间信息网格要求解决海量地理空间数据传输问题,通过分析空间数据服务特征,对空间数据设计了多级网格索引,利用P2P技术设计了基于平衡兴趣树的空间数据服务网络模型。算法按peer兴趣区对申请空间数据服务的peer进行组织,将peer间路由关系动态组织成一种新的拓扑结构——平衡兴趣树。算法可动态维护网格热度表中数据块的热度,通过热度表可快速发现网格数据块在P2P网络中的位置并下载,从而减轻了空间数据服务器压力,提高了服务效率。The transport problem of vast spatial data through Internet must be solved in establishing spatial information grid （SIG）. Designed the multilevel grid index of spatial data and a network model of spatial data service based on balance interest tree by analyzing the basic character of spatial data service and using P2P technology. According to the interesting region of peers, effectively organized the peers requested spatial data service by the algorithm, and transformed the routing relationship of peers to a new topology structure ： dynamic balance interest tree. This algorithm can maintain the degree of heat of data grid in the heat table, and can find the location of data grid in the P2P network quickly by the heat table and download, so the pressure of spatial data service and improves the efficiency of service.

关 键 词：对等网 分布式 平衡兴趣树 空间数据服务 空间信息网格 

分 类 号：TP319[自动化与计算机技术—计算机软件与理论]