一种基于地理单元热度的瓦片缓存策略

发布时间：2018-05-17 16:33

本文选题：缓存策略 + 地理单元　；参考：《计算机工程与应用》2017年05期

【摘要】：针对瓦片数据传输时造成的服务器与网络压力过大、响应时间长的问题,在客户端建立缓存机制,构建瓦片缓存索引,提出了瓦片数据的GUH缓存替换算法。该算法基于瓦片最小地理单元,融合了瓦片的缩放层级和地理位置热度,并利用热度挥发适应瓦片缓存的时间性。在此基础上,将热度价值与缓存空间抽象为0/1背包问题,并通过蚁群算法进行求解。实验结果表明,该算法在瓦片命中率和字节命中率方面有显著提高。
[Abstract]:In order to solve the problem that the pressure of the server and the network is too big and the response time is long, the caching mechanism is set up in the client and the tile caching index is built. The GUH cache replacement algorithm for tile data is proposed. The algorithm is based on the minimum geographic unit of tile, and the heat of the scale and location of the tiles is fused and the heat is used. The degree of volatility is adapted to the timeliness of the tile caching. On this basis, the heat value and cache space are abstracted as the 0/1 knapsack problem and solved by the ant colony algorithm. The experimental results show that the algorithm has a significant improvement in the hit rate and the hit rate of the bytes.
【作者单位】：北京林业大学信息学院;
【基金】：中央高校基本科研业务费专项资金资助(No.TD2014-02) 中国地质调查局地质调查工作项目(No.1212011120436)
【分类号】：P208;P209

【相似文献】