CN102281202A - Dispatching method, server and system - Google Patents
Dispatching method, server and system Download PDFInfo
- Publication number
- CN102281202A CN102281202A CN2011102580652A CN201110258065A CN102281202A CN 102281202 A CN102281202 A CN 102281202A CN 2011102580652 A CN2011102580652 A CN 2011102580652A CN 201110258065 A CN201110258065 A CN 201110258065A CN 102281202 A CN102281202 A CN 102281202A
- Authority
- CN
- China
- Prior art keywords
- request end
- formation
- request
- server
- grade
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a dispatching method, a server and a dispatching system. The method comprises the following steps of: respectively establishing queues for request ends of different levels by the server; after the server receives the access requests of the request ends, putting the request ends into the corresponding queues respectively; after the server receives the processing agreement response of a processing end, transmitting the request ends to be processed to the processing end for processing; and if the request ends of a certain level or multiple different levels in the queues of the server are completely processed, putting the request ends, the levels of which are smaller than those of the processed request ends, into the corresponding queues of the processed request ends according to a preset control strategy by the server, and performing processing, wherein the lower the level is, the higher the priority is.
Description
Technical field
The invention belongs to network communication field, relate in particular to a kind of dispatching method, server and system.
Background technology
Along with the extensive use of Internet communication technology in society, the also more and more polynary change of multiple-user network service manner.In prior art, application number is that the priority scheduling in a kind of communication network and the technology of access control have been described in 200880107492.7 invention " priority scheduling in the communication network and access control ".Foregoing invention comprises following content: in one aspect, can distinguish the order of priority of data flow, and the grouping with data flow of higher gradually priority can be placed on the some place that moves closer to the formation head, and can experience shorter gradually queueing delay then.In yet another aspect, can the grouping of terminal be transferred to Target cell from the cell-of-origin, and can be grouped in the time quantum of having waited in the formation of cell-of-origin for its note goes up this owing to switching.Aspect another, can permit all prioritized data stream and non-prioritized data if cell load is slight flows, if cell load be severe only permitting prioritized data stream, if cell load be moderate could permit all prioritized data stream and some non-prioritized data stream.
Foregoing invention is by distributing particular priority to the user, and the data stream packet that will have higher priority is placed on the formation head, can experience shorter gradually queueing delay; And according to the weight degree of cell load the data flow of different priorities is handled in decision.Yet, in the foregoing invention patent application, when the data of a large amount of different priorities pour in, cause the data of lower priority to can not get timely processing, user's experience reduces greatly.
Summary of the invention
The invention provides a kind of dispatching method, server and system, to address the above problem.
The invention provides a kind of dispatching method, may further comprise the steps.Server is that the request end of different brackets is set up formation respectively, and server is put into corresponding formation respectively with the request end after receiving the access request of described request end.After server receives the response of end for process agreement processing, push pending described request end to described end for process and handle.After if a certain grade or a plurality of different brackets request end dispose in the server queue, server is put into the request end corresponding queues that disposed with the formation middle grade less than the request end that disposes according to the default control strategy, handles, wherein, grade is low more, and priority is high more.
The present invention also provides a kind of dispatching method, may further comprise the steps.Server is that the request end of different brackets is set up formation respectively, and server is put into corresponding formation respectively with the request end after receiving the access request of described request end, and wherein, the lower grade request end is queuing simultaneously in the formation of high grade request end than it.After server receives the response of end for process agreement processing, push pending described request end to described end for process and handle.After if a certain grade or a plurality of different brackets request end dispose in the server queue, server is put into the request end corresponding queues that disposed with the formation middle grade less than the request end that disposes according to the default control strategy, handles, wherein, grade is low more, and priority is high more.
The present invention also provides a kind of server, comprises setting up module, request processing module and control module.Set up module connection request processing module, the request processing module link control module.Wherein, set up module, be used to the request end of different brackets to set up formation respectively.Request processing module after being used to receive the access request of described request end, is put into corresponding formation respectively with the request end, receive the response that end for process agree to handle after, pushes pending described request end to described end for process processing.Control module, be used for after if a certain grade of formation or a plurality of different brackets request end dispose, according to the default control strategy formation middle grade is put into the request end corresponding queues that has disposed less than the request end that disposes, handle, wherein, grade is low more, and priority is high more.
The present invention also provides a kind of dispatching patcher, comprises request end, server and end for process.Request end Connection Service device, server connection processing end.Wherein, server is that the request end of different brackets is set up formation respectively, after server receives the access request of described request end, the request end is put into corresponding formation respectively, after server receives the response of end for process agreement processing, pushing pending described request end to described end for process handles, after if a certain grade or a plurality of different brackets request end dispose in the server queue, server is put into the request end corresponding queues that has finished according to the default control strategy with the formation middle grade less than the request end that disposes, handle, wherein, grade is low more, and priority is high more.
Compared to prior art, according to dispatching method provided by the invention, server and system,, can when initiating request, data line up according to different brackets at the data of different priority levels, mass data is dredged, hierarchical service is provided better.Simultaneously, according to data processing end idle condition, server is adjusted data processing sequence flexibly according to specific policy, more than all reduced queue waiting time, improved data-handling efficiency.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, and illustrative examples of the present invention and explanation thereof are used to explain the present invention, do not constitute improper qualification of the present invention.In the accompanying drawings:
Figure 1 shows that the flow chart of the dispatching method that first preferred embodiment provides according to the present invention;
Figure 2 shows that the schematic diagram of the formation that first preferred embodiment provides according to the present invention;
Figure 3 shows that the flow chart of the dispatching method that second preferred embodiment provides according to the present invention;
Figure 4 shows that the schematic diagram of the server that preferred embodiment provides according to the present invention;
Figure 5 shows that the schematic diagram of the dispatching patcher that preferred embodiment provides according to the present invention.
Embodiment
Hereinafter will describe the present invention with reference to the accompanying drawings and in conjunction with the embodiments in detail.Need to prove that under the situation of not conflicting, embodiment and the feature among the embodiment among the application can make up mutually.
Figure 1 shows that the flow chart of the dispatching method that first preferred embodiment provides according to the present invention.As shown in Figure 1, the dispatching method that provides of preferred embodiment of the present invention comprises step 101～104.
Step 101: server is that the request end of different brackets is set up formation respectively.Wherein, the request end is divided into different grades by data processing priority, and server is set up formation respectively by the request end different brackets.
Step 102: server is put into corresponding formation respectively with the request end after receiving the access request of request end.At first, request end Connection Service device sends the request of access to server.After server receives the access request of request end, the request end is put into corresponding class queue respectively begin queuing.
Step 103: server pushes pending request end to end for process and handles after receiving the response of end for process agreement processing.Wherein, request end Connection Service device, server connection processing end.Particularly, after end for process sends the message of agreeing to handle to server, first request end enters processing in the server transmission order notification queue, the request end is agreed to enter, pending request end to the end for process of server push is handled, and data processing finishes, and end for process initiatively sends message to server, server removes the request end according to message from formation, and next pending request end to the end for process of propelling movement is handled.
Step 104: after a certain grade or a plurality of different brackets request end dispose in the server queue, server is put into the request end corresponding queues that has disposed according to the default control strategy with the formation middle grade less than the request end that disposes, handle, wherein, grade is low more, and priority is high more.
For example, if the request end grade is three grades, the first estate request end corresponding queues is first formation, and the second rank request end corresponding queues is second formation, and tertiary gradient request end corresponding queues is the 3rd formation.
If third level request end disposes earlier, server is put into the 3rd formation according to default scheduling strategy with the second rank request end in the first estate request end in first formation, second formation, and back 3 second rank request ends in back 5 the first estate request ends, second formation in first formation are according to priority put into the 3rd formation.
Figure 2 shows that the schematic diagram of the formation that first preferred embodiment provides according to the present invention.As shown in Figure 2, if second and third rank request end disposes earlier, server is put into second, third formation according to default scheduling strategy with the first estate request end in first formation, with back 5 a, b, c, d, e the first estate request end in first formation, a, b, c put into second formation, the front of the second rank request end that receives after being positioned at, d, e put into the 3rd formation, the front of the tertiary gradient request end that receives after being positioned at.
Figure 3 shows that the flow chart of the dispatching method that second preferred embodiment provides according to the present invention.As shown in Figure 3, the dispatching method that provides of preferred embodiment of the present invention comprises step 301～304.
Step 301: server is that the request end of different brackets is set up formation respectively.Wherein, the request end is divided into different grades by data processing priority, and server is set up formation respectively by the request end different brackets.
Step 302: server is put into corresponding formation respectively with the request end after receiving the access request of request end, and wherein, the lower grade request end is queuing simultaneously in the formation of high grade request end than it.At first Connection Service device in request end sends the request of access to server.After server receives the access request of request end, the request end is put into corresponding class queue respectively begin queuing.
For example, if the request end grade is three grades, the first estate request end corresponding queues is first formation, and the second rank request end corresponding queues is second formation, and tertiary gradient request end corresponding queues is the 3rd formation, and wherein, grade is low more, and priority is high more.The first estate request end is queuing simultaneously in second formation, is arranged in the back of second formation, the second rank request end request end; The second rank request end is queuing simultaneously in the 3rd formation, is arranged in the back of the 3rd formation tertiary gradient request end.
Step 303: server pushes pending request end to end for process and handles after receiving the response of end for process agreement processing.Wherein, request end Connection Service device, server connection processing end.
Particularly, end for process is after the response that server send to agree is handled, and server sends that first request end enters processing in the order notification queue, and the request end is disagreed with and entered, server removes the request end from current queue, but the described request end does not leave another queue queue.
After end for process sends the response of agreeing to handle to server, first request end enters processing in the server transmission order notification queue, the request end is agreed to enter, pending request end to the end for process of server push is handled, data processing finishes, end for process initiatively sends message to server, and server removes the request end according to message from formation, and next pending request end to the end for process of propelling movement is handled.
Step 304: after a certain grade or a plurality of different brackets request end dispose in the server queue, server is put into the request end corresponding queues that has disposed according to the default control strategy with the formation middle grade less than the request end that disposes, handle, wherein, grade is low more, and priority is high more.
For example, if the request end grade is 3 grades, the first estate request end corresponding queues is first formation, and the second rank request end corresponding queues is second formation, and tertiary gradient request end corresponding queues is the 3rd formation.
If third level request end disposes earlier, server is put into the 3rd formation according to default scheduling strategy with the second rank request end in the first estate request end in first formation, second formation, and back 3 second rank request ends in back 5 the first estate request ends, second formation in first formation are put into the 3rd formation.
Figure 4 shows that the schematic diagram of the server that preferred embodiment provides according to the present invention.As shown in Figure 4, server 20 comprises and sets up module 201, request processing module 202 and control module 203.Set up module 201 connection request processing modules 202, request processing module 202 link control modules 203.Wherein, set up module 201 and be used to the request end of different brackets to set up formation respectively, request processing module 202 is put into corresponding formation respectively with the request end after being used to receive the access request of request end, after receiving the message of end for process agreement processing, push pending request end to end for process and handle.Control module 203 is used for waiting pending if after a certain grade of formation or a plurality of different brackets request end dispose, according to the default control strategy formation middle grade is put into the request end corresponding queues that has disposed less than the request end that disposes.Specific operation process about server is described with aforementioned method, so repeat no more in this.
Figure 5 shows that the schematic diagram of the dispatching patcher that preferred embodiment provides according to the present invention.As shown in Figure 5, dispatching patcher 1 comprises a plurality of request ends, server 20 and a plurality of end for process.With three request ends, three end for process is example, request end 11, request end 12, request end 13, server 20 and end for process 31, end for process 32, end for process 33.Request end 11, request end 12, request end 13 Connection Service devices 20, server 20 connection processing ends 31, end for process 32, end for process 33.Wherein, server 20 is set up formation respectively for different brackets request end 11, request end 12, request end 13, after server 20 receives the access request of request end 11, request end 12, request end 13, request end 11, request end 12, request end 13 are put into corresponding formation respectively.After server 20 receives the response of end for process 31 agreement processing, push pending request end 11 to end for process 31 and handle.After if a certain rank request end 12 or a plurality of different brackets request end 12, request end 13 dispose in server 20 formations, server 20 is put into the request end 12 that finished or a plurality of different brackets request end 12, request end 13 corresponding queues with the formation middle grade less than the request end 11 that disposes according to the default control strategy, handles.Specific operation process about dispatching patcher is described with aforementioned method, so repeat no more in this.
In sum, the dispatching method that preferred embodiment provides according to the present invention, server and system at the data of different priority levels, can line up according to different brackets when data are initiated request, and mass data is dredged, and hierarchical service is provided better.Simultaneously, according to data processing end idle condition, server is adjusted data processing sequence flexibly according to specific policy, more than all reduced queue waiting time, improved data-handling efficiency.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. dispatching method is characterized in that:
Server is that the different brackets request end is set up formation respectively;
Server is put into corresponding formation respectively with the request end after receiving the access request of described request end;
After server receives the response of end for process agreement processing, push pending described request end to described end for process and handle;
After a certain grade or a plurality of different brackets request end dispose in the server queue, server is put into the request end corresponding queues that disposed with the formation middle grade less than the request end that disposes according to the default control strategy, handles, wherein, grade is low more, and priority is high more.
2. method according to claim 1 is characterized in that: described control strategy comprises:
If the request end grade is 3 grades, the first estate request end corresponding queues is first formation, and the second rank request end corresponding queues is second formation, and tertiary gradient request end corresponding queues is the 3rd formation; If tertiary gradient request end disposes earlier, server is put into the 3rd formation according to default scheduling strategy with the second rank request end in the first estate request end in first formation, second formation.
3. method according to claim 2 is characterized in that: described scheduling strategy comprises:
Back 3 second rank request ends in back 5 the first estate request ends, second formation in first formation are according to priority put into the 3rd formation.
4. method according to claim 1 is characterized in that: described control strategy comprises:
If the request end grade is 3 grades, the first estate request end corresponding queues is first formation, and the second rank request end corresponding queues is second formation, and tertiary gradient request end corresponding queues is the 3rd formation; If second and third rank request end disposes earlier, server is put into second, third formation according to default scheduling strategy with the first estate request end in first formation.
5. method according to claim 4 is characterized in that: described scheduling strategy comprises:
With back 5 the first estate request ends in first formation, put into second formation for wherein preceding 3, put into the 3rd formation for other 2.
6. dispatching method is characterized in that:
Server is that the different brackets request end is set up formation respectively;
Server is put into corresponding formation respectively with the request end after receiving the access request of described request end, and wherein, the lower grade request end is queuing simultaneously in the formation of high grade request end than it;
After server receives the response of end for process agreement processing, push pending described request end to described end for process and handle;
After a certain grade or a plurality of different brackets request end dispose in the server queue, server is put into the request end corresponding queues that disposed with the formation middle grade less than the request end that disposes according to the default control strategy, handles, wherein, grade is low more, and priority is high more.
7. method according to claim 6 is characterized in that: if the request end grade is 3 grades, and then the first estate request end queuing simultaneously in the second rank request end corresponding queues; The second rank request end is queuing simultaneously in the corresponding queues of tertiary gradient request end.
8. method according to claim 7 is characterized in that:
When line up simultaneously in the lower grade request end, be arranged in back than the formation request end of its high grade request end in the formation of high grade request end than it.
9. a server is characterized in that, comprising: set up module, request processing module and control module, set up module connection request processing module, and the request processing module link control module, wherein:
Set up module, be used to the different brackets request end to set up formation respectively;
Request processing module after being used to receive the access request of described request end, is put into corresponding formation respectively with the request end, receive the response that end for process agree to handle after, pushes pending described request end to described end for process processing;
Control module, be used for after if a certain grade of formation or a plurality of different brackets request end dispose, according to the default control strategy formation middle grade is put into the request end corresponding queues that has disposed less than the request end that disposes, handle, wherein, grade is low more, and priority is high more.
10. a dispatching patcher is characterized in that, comprising: request end, server and end for process, and request end Connection Service device, server connection processing end, wherein:
Server is that the different brackets request end is set up formation respectively;
Server is put into corresponding formation respectively with the request end after receiving the access request of described request end;
After server receives the response of end for process agreement processing, push pending described request end to described end for process and handle;
After if a certain grade or a plurality of different brackets request end dispose in the server queue, server is put into the request end corresponding queues that finished with the formation middle grade less than the request end that disposes according to the default control strategy, handles, wherein, grade is low more, and priority is high more.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011102580652A CN102281202A (en) | 2011-09-02 | 2011-09-02 | Dispatching method, server and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011102580652A CN102281202A (en) | 2011-09-02 | 2011-09-02 | Dispatching method, server and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102281202A true CN102281202A (en) | 2011-12-14 |
Family
ID=45106394
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011102580652A Pending CN102281202A (en) | 2011-09-02 | 2011-09-02 | Dispatching method, server and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102281202A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897613A (en) * | 2015-12-08 | 2016-08-24 | 乐视云计算有限公司 | Level-limit-free QoS realizing method and level-limit-free QoS system |
| CN108093272A (en) * | 2017-12-29 | 2018-05-29 | 北京奇艺世纪科技有限公司 | A kind of video CD N method for optimizing scheduling and device |
| CN108694018A (en) * | 2017-04-11 | 2018-10-23 | 爱思开海力士有限公司 | Data storage device and its operating method |
| CN108768886A (en) * | 2018-05-30 | 2018-11-06 | 无锡知更鸟网络科技有限公司 | A kind of SaaS data access increased quality method |
| CN112543489A (en) * | 2020-11-24 | 2021-03-23 | 上海擎昆信息科技有限公司 | Method and device for controlling user equipment admission |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1182553A2 (en) * | 2000-08-24 | 2002-02-27 | Cognos Incorporated | Efficient assignment of processing resources in a fair queuing system |
| CN1422475A (en) * | 2000-02-08 | 2003-06-04 | 天然网络技术有限公司 | Multi-level scheduling method for multiplexing packets in a communications network |
| CN101360052A (en) * | 2008-09-28 | 2009-02-04 | 成都市华为赛门铁克科技有限公司 | Method and device for flow scheduling |
| CN101552726A (en) * | 2009-05-14 | 2009-10-07 | 北京交通大学 | A grading services edge router |
-
2011
- 2011-09-02 CN CN2011102580652A patent/CN102281202A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1422475A (en) * | 2000-02-08 | 2003-06-04 | 天然网络技术有限公司 | Multi-level scheduling method for multiplexing packets in a communications network |
| EP1182553A2 (en) * | 2000-08-24 | 2002-02-27 | Cognos Incorporated | Efficient assignment of processing resources in a fair queuing system |
| CN101360052A (en) * | 2008-09-28 | 2009-02-04 | 成都市华为赛门铁克科技有限公司 | Method and device for flow scheduling |
| CN101552726A (en) * | 2009-05-14 | 2009-10-07 | 北京交通大学 | A grading services edge router |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897613A (en) * | 2015-12-08 | 2016-08-24 | 乐视云计算有限公司 | Level-limit-free QoS realizing method and level-limit-free QoS system |
| CN108694018A (en) * | 2017-04-11 | 2018-10-23 | 爱思开海力士有限公司 | Data storage device and its operating method |
| CN108694018B (en) * | 2017-04-11 | 2021-05-25 | 爱思开海力士有限公司 | Data storage device and operation method thereof |
| CN108093272A (en) * | 2017-12-29 | 2018-05-29 | 北京奇艺世纪科技有限公司 | A kind of video CD N method for optimizing scheduling and device |
| CN108093272B (en) * | 2017-12-29 | 2020-11-24 | 北京奇艺世纪科技有限公司 | Video CDN scheduling optimization method and device |
| CN108768886A (en) * | 2018-05-30 | 2018-11-06 | 无锡知更鸟网络科技有限公司 | A kind of SaaS data access increased quality method |
| CN112543489A (en) * | 2020-11-24 | 2021-03-23 | 上海擎昆信息科技有限公司 | Method and device for controlling user equipment admission |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103493449B (en) | Efficient circuit in packet switching network | |
| CN102369688B (en) | Method for adjusting resources dynamically and scheduling device | |
| EP2783490B1 (en) | Time-sensitive data delivery | |
| CN102170396B (en) | QoS control method of cloud storage system based on differentiated service | |
| CN101127721B (en) | Bandwidth control method and bandwidth control device | |
| CN104079501A (en) | Queue scheduling method based on multiple priorities | |
| CN1989738A (en) | Propagation of minimum guaranteed scheduling rates | |
| CN103079273A (en) | Resource management method suitable for multilayer satellite system | |
| CN102281202A (en) | Dispatching method, server and system | |
| CN102611735A (en) | Load balancing method and system of application services | |
| CN102487494B (en) | Short message flow control method and system | |
| CN101594307B (en) | Multi-queue based scheduling method and system | |
| CN102811176B (en) | A kind of data flow control method and device | |
| Hua et al. | Scheduling heterogeneous flows with delay-aware deduplication for avionics applications | |
| CN111181873B (en) | Data transmission method, data transmission device, storage medium and electronic equipment | |
| CN102045253A (en) | Method and device for sending video surveillance service messages in link aggregation network | |
| CN102891809B (en) | Multi-core network device message presses interface order-preserving method and system | |
| CN109802895A (en) | Data processing system, method and token management method | |
| CN104301254A (en) | Data package dispatching method for data center network | |
| CN105991588B (en) | A kind of method and device for defending message attack | |
| CN102143053B (en) | Method, device and system for transmitting data | |
| CN102333026A (en) | Message forwarding method and device | |
| CN103701721A (en) | Message transmission method and device | |
| CN101707556B (en) | Method, equipment and system for data scheduling in switched network | |
| CN101616096A (en) | Array dispatching method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20111214 |