CN103685309A - Asynchronous request queue model oriented to map visualization tile service - Google Patents
Asynchronous request queue model oriented to map visualization tile service Download PDFInfo
- Publication number
- CN103685309A CN103685309A CN201310729316.XA CN201310729316A CN103685309A CN 103685309 A CN103685309 A CN 103685309A CN 201310729316 A CN201310729316 A CN 201310729316A CN 103685309 A CN103685309 A CN 103685309A
- Authority
- CN
- China
- Prior art keywords
- request
- tile
- queue
- priority
- asynchronous
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Telephonic Communication Services (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention provides an asynchronous request queue model oriented to the map visualization tile service and belongs to the fields of computer network technology and queue control technology. By means of the principles and methods of the Queuing Theory, the asynchronous request queue model mainly solves the access problem of the visualization tile service of networked maps and achieves hierarchical, real-time and smooth map tile access of a client. The asynchronous request queue model oriented to the map visualization tile service is implemented through the following steps including, firstly, setting a request queue with a fixed capacity; when a new request comes, determining whether to put the new request into the queue or discard the request according to the state and the priority of the queue; besides, establishing threads identical to concurrent requests in quantity, performing a tile obtaining process and returning results in a call-back mode. The asynchronous request queue model oriented to the map visualization tile service relates to the technologies such as priority control, concurrent request quantity control, network asynchronous request and request queue management under high-frequency visualization requests, thereby being a high-frequency and high-timeliness network asynchronous request queue model with the priority control and being applicable to access of the map visualization tile network service.
Description
Technical field
The present invention relates to computer networking technology and control of queue technology, specifically, relate to the technology such as priority control under high frequency visualization request, the control of concurrent request amount, network asynchronous request, request queue management.The present invention is one and possesses the high frequency of priority control, the network asynchronous request queue model of high timeliness, is applicable to the access of map visualization tile network service.
Background technology
Map visualization tile client-requested has high, the ageing height of request frequency, the strict requirement of priority conditions.Along with user constantly changes the operation of view, tile request occurs continually on backstage; Tile when front view center is prepreerence request all the time; View tile peripheral and adjacent level is asked with different priority weights simultaneously.Comprising correlation techniques such as the asynchronism and concurrency access mechanism based on HTTP procotol, priority claim queuing models.
HTML (Hypertext Markup Language) (Hypertext transfer protocol, HTTP) be distributed, collaboration type, the communication protocol between hyper-media system application, the basis of World Wide Web (WWW) exchange message, have simple and fast, flexibly, without features such as connection, stateless.The request type of HTTP is conventional mainly contains two kinds of GET and POST, is synchronization of access mode, is blocked state during request; Asynchronous implementation method is comparatively complicated, and programming difficulty is high, but request expense is little, is applicable to the applied environment of frequent access.Main list of references comprises
http:// www.w3.org/Protocols/; Http:// progrium.com/blog/2012/12/06/async-http- responses-with-response-redirection/deng.
Queueing theory is the important branch of operational research and applied probability, and in actual life, the application example of queueing theory is seen everywhere, and is bringing into play its important function.It is mainly comprised of three parts: input process, queue discipline and service system.The client that input process is described service system according to what kind of rule arrives; Whether queue discipline is described service and is allowed to queue up, and whether client allows to queue up; Service system is mainly described quantity and the organizational form of information desk, and the distribution mode of client's required time.In queuing system, what client and service organization were concerned about most is queue length, wait, residence time and the distribution thereof of client in system, and the problems such as the busy period of information desk, these indexs are also the most important features of queuing system.Main list of references comprises Qingchun Jiang, Sharma Chakravarthy.Queueing analysis of relational operators for continuous data streams, Technical Report CSE, 2003 (02).; Yingxian Liang.Application of mathematical logic in queue theory, Journal of Shenyang Institute ofAeronautcal Engineering, 2003 etc.
Towards the Asynchronous Request queuing model of map visualization tile service access, combine the Queueing Theory Method of asynchronous network request technology and priority control, wherein be specifically related to the technical problems such as the control of map tile priority, the control of concurrent request amount, request queue management, at present visible document/patent, the solution of comparison system does not also occur.
Summary of the invention
The object of the invention is the access problem for the service of networking map visualization tile, set up the high frequency access of a kind of support, possess priority control and network access quantity controls simultaneously, the asynchronous network access request queuing model with high-timeliness, realize client have levels, in real time, smooth map tile access.
Basic ideas of the present invention are: the request queue of a fixed capacity is set, and each in queue can be held the information of a tile request; When having new request to arrive, according to quene state, priority situation, determine whether this request puts into queue or give up; On the other hand, the thread of foundation and concurrent request amount corresponding number takes out the request that priority is the highest and carries out tile acquisition process, and returns results in the mode of readjustment from queue.This process instance an Asynchronous Request queuing model that possesses input process, queue discipline and service system.
Technical scheme of the present invention provides a kind of Asynchronous Request queuing model with priority and flow control, specifically comprises following implementation step:
1) a linking number initial value defined by the user, represents to service end, to send the number of request simultaneously;
2) the tile request queue of definition regular length (linking number * 2), each in queue has been preserved the information of tile request, comprises five, tile numbering, priority, timestamp, solicited status and return data pointer;
3) definition is for the asynchronous call back function that returns to tile, and callback information comprises tile numbering, timestamp and the tile data corresponding with tile request queue;
4) according to user, browse the viewpoint generation in real time of map and upgrade tile and treat request list, according to view definition priority, basic priority rule is followed successively by from high to low: viewpoint center, viewpoint edge, adjacent lower floor, adjacent upper strata;
5) open queuing request thread and cyclically read tile and treat each in request list, call queue request function and carry out tile request, until queue stops thread when empty;
6), when tile request occurs, first judge that whether tile request queue is full, if less than request being added to queue; If otherwise the priority of current request is higher than the item of lowest priority in queue, replaces it; When above two conditions all do not meet, current request is abandoned;
7) open a plurality of network request threads, number of threads is consistent with user-defined linking number, each thread execution operates as follows: from tile request queue, take out the request that priority is the highest, and resolved and formed URL service access address, to Visualization Service request tile, after tile returns, will ask accordingly to treat to remove request list from tile request queue and tile, and return results by call back function.
Above-mentioned steps is characterised in that:
step 4) and step 5) be outside input process, according to user's viewpoint, generate the tile request with priority, by background thread so that the time interval is cyclically sent tile access request to queuing model fast;
step 6) realized the core mechanism of queuing model medium priority, externally thread constantly sends in the process of request, and what guarantee to enter queue is the request that priority is the highest;
The present invention compared with prior art has following features: (1) supports the real-time tile access access of high frequency, and external user program can be continuously, Batch sending request, acquisition real-time response effect; (2) priority is controlled and flow control combines, guaranteed fast, when responding tile request in time, exactly, effectively alleviate the load that visual tile is served.
Accompanying drawing explanation
Fig. 1 overall procedure of the present invention
The priority of Fig. 2 based on two dimension view generates schematic diagram
The priority of Fig. 3 based on 3-D view generates schematic diagram
The multi-thread access of Fig. 4 tile request queue
Fig. 5 two dimension display effect figure
Embodiment
The present invention requires user to input initial linking number, and this linking number determined by indexs such as network conditions, and default value is 6, and following implementation step be take this value and described as example.
Fig. 1 has illustrated three parts, to consist of overall procedure of the present invention on the whole: (1) input process: external program generates the tile request with priority according to view show state, and continues to send request to queuing model module; (2) queue discipline: based on priority and flow control principle, queuing model will respond front 6 requests that priority is the highest concomitantly; (3) service system: tile result is returned in the service of queuing model access tile, will ask accordingly to remove from queue, and transfer to external program to process by call back function.
The structure of a tile request of the present invention's definition comprises following components:
solicited status: tile request comprises waits to ask, asks, asked three kinds of states, representative request enters queuing model, accesses tile service respectively, tile service returns results, here it should be noted that, when solicited status is when asking, this tile request is by locked, can do not substituted by other requests, until the abnormal conditions appearance such as overtime are returned to or served to result.
External user program, according to above-mentioned organization definition, generates tile request according to different view features.Fig. 2 has illustrated a kind of tile Request Priority create-rule of two dimension view, runic solid box represents the forms border of two dimension view, dotted line frame has represented the border of view buffer memory, grid is tile, digitized representation in tile priority, priority is according to from viewpoint center to spiral successively decreasing around.Fig. 3 has illustrated a kind of tile Request Priority create-rule of 3-D view, according to the related tile in visual angle from the close-by examples to those far off, correspondingly generates priority tile request from high to low.
Fig. 4 has illustrated that the multithreading working mechanism of queuing model, the execution route of its peripheral queuing request thread represent with blue arrow line, and the execution route of queuing model tile request thread represents with red arrow line; " request interface " is above is external user program, and " request interface " is following is queuing model program.
Below exemplify a kind of processing scheme of external program.Whenever view changes, while producing new tile demand, external user program generates tile request, form a tile and treat request list, then open queuing request thread, continue, cyclically to queuing model, send tile request, the false code of thread work flow process (the above blue line part of Fig. 4 " request interface ") is as follows:
Meanwhile, external program is realized call back function, and by queuing model routine call, function prototype is as follows:
CallbackTile (tile numbering, tile data)
First call back function copies tile data transfer to upper procedure to process, and then corresponding tile request is treated to remove request list from tile, for avoiding multi-thread access conflict, while removing, need lock list.
The main part of queuing model is comprised of request interface (the following blue line part of Fig. 4 " request interface ") and tile request thread (the following red line part of Fig. 4 " request interface ") two parts, and the former is expressed as follows by false code:
Request interface has been realized queue discipline when request arrives in queuing model, tile request thread has been realized the course of work of service system, and as described in above-mentioned false code, thread starts when request arrives, maximum thread is 6, and its implementation is expressed as follows by false code:
Above-mentioned steps has realized a queuing model that maximum concurrency is 6 tile requests, utilizes queue rule to avoid repeating to send request and making high priority tile to obtain real-time response.Tile request queue is set as 2 times of linking number, and 12, one side has been guaranteed the real-time of tile request, has served as the role of Time priority rule, has avoided on the other hand queue long, consumes resources.
Utilize the two dimension view display effect that the present invention realizes to see Fig. 5, this view is of a size of wide 1091 pixels, high 636 pixels, and each tile is of a size of wide 256 pixels, high 256 pixels.In figure, required tile number is 20, and the priority orders of request is to successively decrease in the shape of a spiral towards periphery from view center, and actual displayed is sequentially shown in red Arabic numerals in figure.When single tile average response time is 0.5 second, view all shows that the used time is less than 3 seconds.The present invention is applicable to priority and controls lower high frequency fine-granularity network access, can realize the having levels of networking map visualization tile service, in real time, smooth access.
Claims (3)
1. towards the Asynchronous Request queuing model of map visualization tile service access, it is characterized in that comprising following implementation step:
Step 1, a linking number initial value defined by the user, represents to service end, to send the number of request simultaneously;
Step 2, definition length is the tile request queue of 2 times of linking numbers, each in queue has been preserved the information of tile request, comprises tile numbering, priority, timestamp, solicited status and five of the data pointers that return;
Step 3, definition is for the asynchronous call back function that returns to tile, and callback information comprises tile numbering, timestamp and the tile data corresponding with tile request queue;
Step 4, the viewpoint of browsing map according to user generates in real time and upgrades tile and treat request list, and according to view definition priority, basic priority rule is followed successively by from high to low: viewpoint center, viewpoint edge, adjacent lower floor, adjacent upper strata;
Step 5, opens queuing request thread and cyclically reads tile and treat each in request list, calls queue request function and carries out tile request, until queue stops thread when empty;
Step 6, when tile request occurs, first judges that whether tile request queue is full, if less than request being added to queue; If otherwise the priority of current request is higher than the item of lowest priority in queue, replaces it; When above two conditions all do not meet, current request is abandoned;
Step 7, open the quantity network request thread consistent with user-defined linking number, each thread execution operates as follows: from tile request queue, take out the request that priority is the highest, and resolved and formed URL service access address, to Visualization Service request tile, after tile data returns, will ask accordingly to treat to remove request list from tile request queue and tile, and return results by call back function.
2. Asynchronous Request queuing model according to claim 1, it is characterized in that having realized asynchronous tile access stencil with synchronous HTTP network access protocol, support the real-time tile access access of high frequency, external user program can be continuously, send request in bulk, obtains real-time response effect.
3. Asynchronous Request queuing model according to claim 1, is characterized in that priority to control and flow control combines, and guarantees fast, when responding tile request in time, exactly, effectively alleviates the load that visual tile is served.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310729316.XA CN103685309B (en) | 2013-12-26 | 2013-12-26 | The method for building up of Asynchronous Request queue towards map visualization tile service access |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310729316.XA CN103685309B (en) | 2013-12-26 | 2013-12-26 | The method for building up of Asynchronous Request queue towards map visualization tile service access |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103685309A true CN103685309A (en) | 2014-03-26 |
| CN103685309B CN103685309B (en) | 2019-09-13 |
Family
ID=50321623
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310729316.XA Expired - Fee Related CN103685309B (en) | 2013-12-26 | 2013-12-26 | The method for building up of Asynchronous Request queue towards map visualization tile service access |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103685309B (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104156482A (en) * | 2014-08-26 | 2014-11-19 | 天津市普迅电力信息技术有限公司 | Map tile data publishing method |
| CN104731899A (en) * | 2015-03-19 | 2015-06-24 | 浪潮通用软件有限公司 | Data high-concurrency processing method based on asynchronous processing |
| CN104917833A (en) * | 2015-06-08 | 2015-09-16 | 北京集奥聚合网络技术有限公司 | Asynchronous information processing method based on NIO request |
| CN105069058A (en) * | 2015-07-24 | 2015-11-18 | 中国地质大学（武汉） | Quick response method of network map request for high-frequency interaction environment |
| CN107294872A (en) * | 2017-05-05 | 2017-10-24 | 中广热点云科技有限公司 | A kind of method and system for improving communication base station efficiency of service |
| CN107430627A (en) * | 2015-04-01 | 2017-12-01 | 微软技术许可有限责任公司 | The priority ranking request of map layer |
| CN108021462A (en) * | 2017-12-08 | 2018-05-11 | 北京百度网讯科技有限公司 | Method and apparatus for calling cloud service |
| CN108255853A (en) * | 2016-12-29 | 2018-07-06 | 卓望数码技术（深圳）有限公司 | The request asynchronous processing method and system of a kind of plug-in type |
| CN108334555A (en) * | 2017-12-31 | 2018-07-27 | 广州都市圈网络科技有限公司 | Vector is changed the line map velocity optimization method, system, electronic equipment and storage medium |
| CN109631874A (en) * | 2018-12-11 | 2019-04-16 | 四川省交通运输厅交通勘察设计研究院 | The method of real-time stream is superimposed on three-dimensional electronic navigation channel chart |
| CN112902968A (en) * | 2021-02-01 | 2021-06-04 | 成都紫瑞青云航空宇航技术有限公司 | High-efficiency three-dimensional digital navigation earth generation method and system |
| CN113691604A (en) * | 2021-08-18 | 2021-11-23 | 深圳鼎盛电脑科技有限公司 | Adaptive current limiting method, device, equipment and medium for network request |
| CN115037802A (en) * | 2022-06-02 | 2022-09-09 | 北京百度网讯科技有限公司 | Request processing method and device, electronic equipment and storage medium |
| CN117171288A (en) * | 2023-11-02 | 2023-12-05 | 中国地质大学（武汉） | Grid map analysis method, device, equipment and medium |
| CN112902968B (en) * | 2021-02-01 | 2024-10-22 | 成都紫瑞青云航空宇航技术有限公司 | High-efficiency three-dimensional digital navigation earth generation method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102750180A (en) * | 2012-05-28 | 2012-10-24 | 中国科学院遥感应用研究所 | Multithreading display mechanism of two-dimensional map tiles |
| CN102968442A (en) * | 2012-10-22 | 2013-03-13 | 武大吉奥信息技术有限公司 | Network map tile service aggregation method and system |
| CN103279487A (en) * | 2013-04-25 | 2013-09-04 | 中国科学院遥感与数字地球研究所 | Organization and management method of map tile caching |
-
2013
- 2013-12-26 CN CN201310729316.XA patent/CN103685309B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102750180A (en) * | 2012-05-28 | 2012-10-24 | 中国科学院遥感应用研究所 | Multithreading display mechanism of two-dimensional map tiles |
| CN102968442A (en) * | 2012-10-22 | 2013-03-13 | 武大吉奥信息技术有限公司 | Network map tile service aggregation method and system |
| CN103279487A (en) * | 2013-04-25 | 2013-09-04 | 中国科学院遥感与数字地球研究所 | Organization and management method of map tile caching |
Non-Patent Citations (1)
| Title |
|---|
| 陈桦,李艳明,朱美正: "一种支持大量并发用户的瓦片缓存方案研究", 《计算机工程与科学》 * |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104156482A (en) * | 2014-08-26 | 2014-11-19 | 天津市普迅电力信息技术有限公司 | Map tile data publishing method |
| CN104731899A (en) * | 2015-03-19 | 2015-06-24 | 浪潮通用软件有限公司 | Data high-concurrency processing method based on asynchronous processing |
| CN107430627B (en) * | 2015-04-01 | 2020-12-11 | 微软技术许可有限责任公司 | Map layer prioritization requests |
| CN107430627A (en) * | 2015-04-01 | 2017-12-01 | 微软技术许可有限责任公司 | The priority ranking request of map layer |
| CN104917833A (en) * | 2015-06-08 | 2015-09-16 | 北京集奥聚合网络技术有限公司 | Asynchronous information processing method based on NIO request |
| CN105069058A (en) * | 2015-07-24 | 2015-11-18 | 中国地质大学（武汉） | Quick response method of network map request for high-frequency interaction environment |
| CN105069058B (en) * | 2015-07-24 | 2018-11-27 | 中国地质大学（武汉） | Network map for high frequency interactive environment requests fast response method |
| CN108255853A (en) * | 2016-12-29 | 2018-07-06 | 卓望数码技术（深圳）有限公司 | The request asynchronous processing method and system of a kind of plug-in type |
| CN107294872A (en) * | 2017-05-05 | 2017-10-24 | 中广热点云科技有限公司 | A kind of method and system for improving communication base station efficiency of service |
| CN107294872B (en) * | 2017-05-05 | 2019-07-30 | 中广热点云科技有限公司 | A kind of method and system improving communication base station efficiency of service |
| CN108021462A (en) * | 2017-12-08 | 2018-05-11 | 北京百度网讯科技有限公司 | Method and apparatus for calling cloud service |
| CN108334555A (en) * | 2017-12-31 | 2018-07-27 | 广州都市圈网络科技有限公司 | Vector is changed the line map velocity optimization method, system, electronic equipment and storage medium |
| CN109631874A (en) * | 2018-12-11 | 2019-04-16 | 四川省交通运输厅交通勘察设计研究院 | The method of real-time stream is superimposed on three-dimensional electronic navigation channel chart |
| CN112902968A (en) * | 2021-02-01 | 2021-06-04 | 成都紫瑞青云航空宇航技术有限公司 | High-efficiency three-dimensional digital navigation earth generation method and system |
| CN112902968B (en) * | 2021-02-01 | 2024-10-22 | 成都紫瑞青云航空宇航技术有限公司 | High-efficiency three-dimensional digital navigation earth generation method and system |
| CN113691604A (en) * | 2021-08-18 | 2021-11-23 | 深圳鼎盛电脑科技有限公司 | Adaptive current limiting method, device, equipment and medium for network request |
| CN115037802A (en) * | 2022-06-02 | 2022-09-09 | 北京百度网讯科技有限公司 | Request processing method and device, electronic equipment and storage medium |
| CN115037802B (en) * | 2022-06-02 | 2024-03-08 | 北京百度网讯科技有限公司 | Request processing method and device, electronic equipment and storage medium |
| CN117171288A (en) * | 2023-11-02 | 2023-12-05 | 中国地质大学（武汉） | Grid map analysis method, device, equipment and medium |
| CN117171288B (en) * | 2023-11-02 | 2024-01-12 | 中国地质大学（武汉） | Grid map analysis method, device, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103685309B (en) | 2019-09-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103685309A (en) | Asynchronous request queue model oriented to map visualization tile service | |
| CN105912401B (en) | A kind of distributed data batch processing system and method | |
| CN109327509B (en) | Low-coupling distributed streaming computing system of master/slave architecture | |
| CN105205231B (en) | A kind of power distribution network Digital Simulation System based on DCOM | |
| WO2018130163A1 (en) | Scheduling method and device for mobile cloud computing platform | |
| CN101799773B (en) | Memory access method of parallel computing | |
| CN103645904B (en) | A kind of cache implementing method of interface interchange | |
| CN103019859B (en) | A kind of method and system to service request scheduling | |
| CN104112049B (en) | Based on the MapReduce task of P2P framework across data center scheduling system and method | |
| Shao et al. | Page: a partition aware engine for parallel graph computation | |
| CN101146127A (en) | A client buffer update method and device in distributed system | |
| CN112631800A (en) | Kafka-oriented data transmission method and system, computer equipment and storage medium | |
| CN108667851A (en) | A kind of regulator control system lightweight man-machine interactive system | |
| CN111984505B (en) | Fortune dimension data acquisition device and acquisition method | |
| CN110020046B (en) | Data capturing method and device | |
| CN109388501B (en) | Communication matching method, device, equipment and medium based on face recognition request | |
| Liu et al. | KubFBS: A fine‐grained and balance‐aware scheduling system for deep learning tasks based on kubernetes | |
| CN110879753A (en) | GPU acceleration performance optimization method and system based on automatic cluster resource management | |
| CN103955397A (en) | Virtual machine scheduling multi-strategy selection method based on micro-architecture perception | |
| CN111049898A (en) | Method and system for realizing cross-domain architecture of computing cluster resources | |
| CN111427887A (en) | Method, device and system for rapidly scanning HBase partition table | |
| CN102662732A (en) | Double-drive thread pool model | |
| CN115118475A (en) | Method, device, equipment and medium for dispatching cryptographic equipment cluster | |
| CN111538575B (en) | Resource scheduling system, method, device, equipment and medium | |
| CN115309759A (en) | Monitoring label synchronization method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190913 Termination date: 20201226 |