Geographic information service request load balancing algorithm considering spatial access density

doi:10.13474/j.cnki.11-2246.2021.0048

Abstract

Abstract: Effective load balancing is the most commonly used method to improve the response efficiency of the geographic information service request, but the existing load balancing algorithm cannot take into account the deficiency of both spatial and service request volume in the aspect of spatial service invocation. Therefore, by introducing the spatial access density and considering the relationship between the frequency of geographic information service requests and the spatial distribution of data, this paper proposes a load balancing algorithm of mass geographic information service requests based on spatial access density. Firstly, based on the geographic information data access call log, the spatial frequent range of data access is obtained and the quadtree index is constructed to establish the spatial access density equilibrium model. Then, based on the spatial access density equilibrium model, the polling allocation of geographic information service requests is carried out. Finally, by comparing the efficiency and performance experiments under the same experimental environment, the proposed algorithm can effectively improve the efficiency of geographic information service request response.

Key words: spatial access density, geographic information service, load balance, data access call log, quadtree

CLC Number:

P208

LIU Xiaoli, SUN Wei, LI Chengming. Geographic information service request load balancing algorithm considering spatial access density[J]. Bulletin of Surveying and Mapping, 2021, 0(2): 77-81,166.

References

[1] ZHOU C, CHEN Z, LIU Y, et al. Data decomposition method for parallel polygon rasterization considering load balancing[J]. Computers and Geosciences, 2015, 85(PA):196-209.
[2] CARDELLINI V, COLAJANNI M, YU P. Redirection algorithms for load sharing in distributed Web-server systems[C]//IEEE International Conference on Distributed Computing Systems.Austin:IEEE, 1999.
[3] IQBAL M A, SALTZ J H, BOKHAT S H. Performance tradeoffs in static and dynamic load balancing strategies[EB/OL]. 1986-04-23[2020-09-15]. https://www.researchgate.net/profile/Joel_Saltz/publication/23578306_Performance_tradeoffs_in_static_and_dynamic_load_balancing_strategies/links/00b4952b9364edec3a000000.pdf.
[4] TONG L, DAN B, HAHN S. Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin[J]. ACM SIGPLAN Notices, 2009, 44(4):65-74.
[5] GUO M, HUANG Y, GUAN Q, et al. An efficient data organization and scheduling strategy for accelerating large vector data rendering[J]. Transactions in GIS, 2017:1217-1236.
[6] ZHOU C, CHEN Z, LIU Y, et al. A strategy for parallelising polygon rasterisation algorithms using multi-core CPUs[J]. Spatial Science, 2015, 61(1):47-68.
[7] CHOI D, CHUNG K S, SHON J. An improvement on the weighted least-connection scheduling algorithm for load balancing in web cluster systems[C]//International Conference on Grid and Distributed Computing.Jeju Island:Springer, 2010:127-134.
[8] ZHANG M, XIONG Y, ZHANG Q, et al. MMC03-4:on the optimal scheduling for media streaming in data-driven overlay networks[C]//IEEE Global Telecommunications Conference. San Francisco:IEEE, 2006.
[9] 王浩, 喻占武, 李锐,等. 基于开销代价的网络地理信息服务负载均衡算法研究[J]. 测绘学报, 2009,38(3):242-249.
[10] 胡珂, 李成名, 沈建明. 分布式时空数据库去中心化负载均衡方法[J]. 测绘通报, 2018(12):65-68.
[11] 李忠民, 喻占武, 朱莉. 基于空间数据内容的动态负载均衡方法[J]. 武汉大学学报(信息科学版), 2009, 34(5):622-625.
[12] 李鹤元, 安晓亚, 陈刚, 等. 一种地理信息服务动态负载均衡算法[J]. 武汉大学学报(信息科学版), 2016, 41(11):1524-1529.
[13] 郭明强,谢忠,黄颖.集群并发环境下大规模矢量数据负载均衡算法[J].武汉大学学报(信息科学版),2013,38(9):1131-1134.
[14] TU W, CAO J, YUE Y, et al. Coupling mobile phone and social media data:a new approach to understanding urban functions and diurnal patterns[J]. International Journal of Geographical Information Science, 2017,31(12):2331-2358.
[15] LONG Y, THILL J C. Combining smart card data and household travel survey to analyze jobs-housing relationships in Beijing[J]. Computers, Environment and Urban Systems, 2015,53:19-35.