现场名字解析系统中地理邻居发现机制研究  

Research on geography neighbor discovery mechanism in local name mapping and resolution system

作　　者：张芳 孙鹏 李杨[2] ZHANG Fang;SUN Peng;LI Yang(University of Chinese Academy of Sciences,Beijing 100049,China;National Network New Media Engineering Research Center,Institute of Acoustics,Chinese Academy of Sciences,Beijing 100190,China)

机构地区：[1]中国科学院大学,北京100049 [2]中国科学院声学研究所国家网络新媒体工程技术研究中心,北京100190

出　　处：《电子设计工程》2022年第9期6-10,17,共6页Electronic Design Engineering

基　　金：中国科学院战略性科技先导专项课题(XDC02070100)。

摘　　要：针对用户移动后解析服务节点切换问题,文中提出一种基于Geohash网格编码的节点地理邻居生成方法,用于新服务节点的快速发现。该方法通过把节点的地理位置转换为Geohash网格编码,借助编码规律提高近邻查询效率。实验结果表明,与kNN查询中最精确的穷举法对比,在保证地理邻居节点查全率的情况下,节点数量级为104时,算法平均耗时下降60%,且随着节点数量的不断上升,算法耗时下降比例会继续增加。在节点数量较大时,所提方法可以大量节省计算资源。In order to solve the problem of resolution nodes switching caused by user movement,a method to generate geography neighbors of nodes based on Geohash encoding has been proposed to improve the efficiency of new resolution node discovery. By converting the geographic location of nodes into Geohash encoding,this method improves the efficiency of neighbor query with the help of coding rules. Compared with the most accurate exhaustive method in kNN query,experimental results show that the average time of the algorithm decreases by 60% when the node order is 104,and the decrease ratio of the algorithm time will continue to increase with the increasing number of nodes,when the recall rate of the geographic neighbor of the resolution node is guaranteed.When the number of nodes is large,the proposed method can save a lot of computing resources.

关 键 词：现场名字解析系统 信息中心网络 Geohash编码 地理邻居 最近邻查询 

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